kochen-specker.info
home
candidates
references
«
home
«
candidates
The graph
S???C@?g?o?oWGDOXGCD_S`GbB@Gw?XA_
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 -> 15
1 -> 8
2 -> 9
3 -> 2
4 -> 17
5 -> 1
6 -> 14
7 -> 7
8 -> 0
9 -> 12