kochen-specker.info

home candidates references
« home « candidates

The graph T???C@_SCOC_C_IGGI?KGF?aD_IDSD_w?J@o

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 -> 2
  • 1 -> 19
  • 2 -> 8
  • 3 -> 17
  • 4 -> 7
  • 5 -> 10
  • 6 -> 4
  • 7 -> 20
  • 8 -> 13
  • 9 -> 0