kochen-specker.info

home candidates references
« home « candidates

The graph T???C@?_P_D?D?A_W_?RGH`IWG_We?eC`_wA

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