kochen-specker.info

home candidates references
« home « small graphs

The graph MOPC?`wAokS??T@B_

This graph is not embeddable.

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 -> 7
  • 1 -> 3
  • 2 -> 9
  • 3 -> 12
  • 4 -> 1
  • 5 -> 5
  • 6 -> 8
  • 7 -> 10
  • 8 -> 4
  • 9 -> 13

contact@kochen-specker.info

modified on 04-07-2023