kochen-specker.info

home candidates references
« home « candidates

The graph T??CA?_CCCH?IGL??e?a_e?P@_gShB?Y?LIO

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