kochen-specker.info

home candidates references
« home « candidates

The graph T????A?WA_D?oC`G?w?s?CY?acKQCaOY?sPO

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