kochen-specker.info

home candidates references
« home « candidates

The graph T???C@?K@OO_@_OcAW?POe@B@HCDC_Gi_aK_

Unembeddable subgraph

The graph K@QCAGdA_c~? 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 -> 7
  • 2 -> 11
  • 3 -> 16
  • 4 -> 17
  • 5 -> 6
  • 6 -> 15
  • 7 -> 14
  • 8 -> 20
  • 9 -> 10
  • 10 -> 4
  • 11 -> 0