kochen-specker.info
home
candidates
references
«
home
«
candidates
The graph
S???C@?g@_B?@_QG@geE?GYHSGPSaC`k?
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 -> 19
1 -> 3
2 -> 9
3 -> 2
4 -> 16
5 -> 17
6 -> 15
7 -> 7
8 -> 0
9 -> 10