kochen-specker.info
home
candidates
references
«
home
«
candidates
The graph
S???C@?gA_D?@_cOpE?YGOwCYG``IBGs?
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 -> 14
1 -> 4
2 -> 9
3 -> 2
4 -> 18
5 -> 15
6 -> 7
7 -> 13
8 -> 0
9 -> 11