kochen-specker.info
home
candidates
references
«
home
«
candidates
The graph
S???C@_S@OA_HAoCAGcQ?EeAEB@F@AXG_
Unembeddable subgraph
The graph
It?IQGiDO
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 -> 1
1 -> 19
2 -> 9
3 -> 13
4 -> 10
5 -> 12
6 -> 4
7 -> 5
8 -> 16
9 -> 17