kochen-specker.info

home candidates references
« home « candidates

The graph T???C@?GC_B?oA@WPW@AaLA@AQ?dI?WgHg_g

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 -> 20
  • 2 -> 17
  • 3 -> 12
  • 4 -> 11
  • 5 -> 3
  • 6 -> 4
  • 7 -> 16
  • 8 -> 19
  • 9 -> 10