Heawood family explained

In graph theory the term Heawood family refers to either one of the following two related graph families generated via ΔY- and YΔ-transformations:

K _{7} .

• the family of 78 graphs generated from

K _{7} and K _{3,3,1,1} .

In either setting the members of the graph family are collectively known as Heawood graphs, as the Heawood graph is a member.This is in analogy to the Petersen family, which too is named after its member the Petersen graph.

\mu =6 .

The

K _{7} -family

The

K _{7} -family is generated from the complete graph K _{7} through repeated application of ΔY- and YΔ-transformations.The family consists of 20 graphs, all of which have 21 edges.The unique smallest member, K _{7} , has seven vertices.The unique largest member, the Heawood graph, has 14 vertices.

Only 14 out of the 20 graphs are intrinsically knotted, all of which are minor minimal with this property. The other six graphs have knotless embeddings.This shows that knotless graphs are not closed under ΔY- and YΔ-transformations.

All members of the

K _{7} -family are intrinsically chiral.

The

K _{3,3,1,1} -family

The

K _{3,3,1,1} -family is generated from the complete multipartite graph K _{3,3,1,1} through repeated application of ΔY- and YΔ-transformations.The family consists of 58 graphs, all of which have 22 edges.The unique smallest member, K _{3,3,1,1} , has eight vertices.The unique largest member has 14 vertices.

All graphs in this family are intrinsically knotted and are minor minimal with this property.

The

\{K _{7,K} _{3,3,1,1} \} -family

The Heawood family generated from both

K _{7} and K _{3,3,1,1} through repeated application of ΔY- and YΔ-transformations is the disjoint union of the K _{7} -family and the K _{3,3,1,1} -family. It consists of 78 graphs.\mu = 6 .In particular, they are neither planar nor linkless.Van der Holst suggested that they might form the complete list of excluded minors for both the 4-flat graphs and the graphs with \mu\le 5 .

This conjecture can be further motivated from structural similarities to other topologically defined graphs classes:

K _{5} and K _{3,3} (the Kuratowski graphs) are the excluded minors for planar graphs and \mu\le 3 .K _{6} and K _{3,3,1} generate all excluded minors for linkless graphs and \mu\le 4 (the Petersen family).K _{7} and K _{3,3,1,1} are conjectured to generate all excluded minors for 4-flat graphs and \mu\le 5 (the Heawood family).

References

^[1]

^[2]

^[3]

Notes and References

1. Mellor, B., & Wilson, R. (2023). Topological Symmetries of the Heawood family. arXiv preprint arXiv:2311.08573.
2. Goldberg, N., Mattman, T. W., & Naimi, R. (2014). Many, many more intrinsically knotted graphs. Algebraic & Geometric Topology, 14(3), 1801-1823.
3. van der Holst, H. (2006). Graphs and obstructions in four dimensions. Journal of Combinatorial Theory, Series B, 96(3), 388-404.