kochen-specker.info

home candidates references
« home « candidates

The graph T???C@?G?oOocOPOEA?T?AO[SaV@G?Ww@QH?

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