kochen-specker.info

home candidates references
« home « candidates

The graph T????A?OD?E?B_EOKG`GoChAD_aP_U_Q?BPO

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 -> 0
  • 1 -> 17
  • 2 -> 19
  • 3 -> 13
  • 4 -> 20
  • 5 -> 14
  • 6 -> 2
  • 7 -> 15
  • 8 -> 10
  • 9 -> 7