kochen-specker.info

home candidates references
« home « candidates

The graph T???C@?K@OA_gC_oGg?T?AQGWCQc`CHC_eL?

Unembeddable subgraph

The graph It?IQGiDO 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 -> 11
  • 1 -> 5
  • 2 -> 3
  • 3 -> 17
  • 4 -> 1
  • 5 -> 8
  • 6 -> 14
  • 7 -> 19
  • 8 -> 18
  • 9 -> 15

contact@kochen-specker.info

modified on 04-07-2023