kochen-specker.info
home
candidates
references
«
home
«
candidates
The graph
S???C@_S?WOWi?DOGP`L?pC`H`?s_`_F?
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 -> 16
1 -> 12
2 -> 9
3 -> 3
4 -> 13
5 -> 2
6 -> 8
7 -> 17
8 -> 1
9 -> 19