kochen-specker.info
home
candidates
references
«
home
«
candidates
The graph
S???C@?g?o?oT?GWL?P_oaPGKhED_?eE?
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 -> 0
2 -> 8
3 -> 13
4 -> 19
5 -> 16
6 -> 14
7 -> 12
8 -> 1
9 -> 7