kochen-specker.info
home
candidates
references
«
home
«
candidates
The graph
S??CA?_c?o@_o_HGOaaQGKS?IgAgS?M?W
Unembeddable subgraph
The graph
IpD?GUbV?
is a subgraph of this graph. It is not embeddable. Hence, this graph is not embeddable either. One possible monomorphism of the unembeddable graph into this one, is given by:
0 -> 18
1 -> 10
2 -> 12
3 -> 6
4 -> 19
5 -> 4
6 -> 15
7 -> 7
8 -> 1
9 -> 17