kochen-specker.info

home candidates references
« home « candidates

The graph T???C@_S@_P?B?@_OOaPGHGOQG`QSCgc@BPA

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 -> 0
  • 1 -> 19
  • 2 -> 11
  • 3 -> 14
  • 4 -> 18
  • 5 -> 10
  • 6 -> 12
  • 7 -> 3
  • 8 -> 4
  • 9 -> 17