kochen-specker.info
home
candidates
references
«
home
«
candidates
The graph
S???C@?gA_D?@_bOEa?PKEaP`KED_?b@_
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 -> 9
2 -> 8
3 -> 19
4 -> 3
5 -> 2
6 -> 17
7 -> 10
8 -> 1
9 -> 14