kochen-specker.info

home candidates references
« home « candidates

The graph S???C@_S@_P?B?`OG[@PGPCaQS@KQ?qT?

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

contact@kochen-specker.info

modified on 04-07-2023