The Heawood family is not the complete list of excluded minors for 4-flat graphs

A graph is 4-flat if the complex obtained by filling every simple cycle with a separate disk embeds piecewise linearly in four-dimensional space. The Heawood family consists of 78 graphs obtained from $K_7$ and $K_{3,3,1,1}$ by triangle–star and star–triangle transformations. Van der Holst proved that these graphs are not 4-flat; Georgakopoulos and Winter completed the proof that all 78 are excluded minors and conjectured that there are no other excluded minors for 4-flatness. We show that the known eleven-vertex, twenty-two-edge graph $H$ is not 4-flat and has no Heawood-family minor, resolving the completeness question negatively. Mattman and Pierce found by computer search that every proper minor of $H$ is 2-apex; this implies that $H$ itself is a further excluded minor. Mattman and Pierce found $H$, subsequently studied by Kim and Mattman. An earlier paper by the author proved that its one-edge extension $G_1$ has Colin de Verdière invariant 6 and no Heawood-family minor. This made 4-flatness completeness incompatible with van der Holst's proposed equivalence between 4-flatness and invariant at most 5. The new step is an explicit mod-two deleted-product cycle with invariant one. Van der Holst and Pendavingh's obstruction theorem therefore excludes an even map, and hence an embedding, of a cycle subcomplex of $H$ into four-dimensional space. Two separately written exact implementations evaluate the certificate, using moment-curve intersections and the recursive cellular invariant, respectively. This work has not yet been reviewed by experts. The proofs, the computer checks and the text were produced by AI models (from OpenAI and Anthropic), working under the author's direction. Computer-assisted; not yet reviewed by experts. Produced by AI models under the author's direction.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-11
DOI
https://doi.org/10.5281/zenodo.24146252
Primary Topic
Advanced Graph Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Heawood family is not the complete list of excluded minors for 4-flat graphs

P. Graham
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
preprint

The Heawood family is not the complete list of excluded minors for 4-flat graphs

P. Graham
preprint en

Abstract

A graph is 4-flat if the complex obtained by filling every simple cycle with a separate disk embeds piecewise linearly in four-dimensional space. The Heawood family consists of 78 graphs obtained from $K_7$ and $K_{3,3,1,1}$ by triangle–star and star–triangle transformations. Van der Holst proved that these graphs are not 4-flat; Georgakopoulos and Winter completed the proof that all 78 are excluded minors and conjectured that there are no other excluded minors for 4-flatness. We show that the known eleven-vertex, twenty-two-edge graph $H$ is not 4-flat and has no Heawood-family minor, resolving the completeness question negatively. Mattman and Pierce found by computer search that every proper minor of $H$ is 2-apex; this implies that $H$ itself is a further excluded minor. Mattman and Pierce found $H$, subsequently studied by Kim and Mattman. An earlier paper by the author proved that its one-edge extension $G_1$ has Colin de Verdière invariant 6 and no Heawood-family minor. This made 4-flatness completeness incompatible with van der Holst's proposed equivalence between 4-flatness and invariant at most 5. The new step is an explicit mod-two deleted-product cycle with invariant one. Van der Holst and Pendavingh's obstruction theorem therefore excludes an even map, and hence an embedding, of a cycle subcomplex of $H$ into four-dimensional space. Two separately written exact implementations evaluate the certificate, using moment-curve intersections and the recursive cellular invariant, respectively. This work has not yet been reviewed by experts. The proofs, the computer checks and the text were produced by AI models (from OpenAI and Anthropic), working under the author's direction. Computer-assisted; not yet reviewed by experts. Produced by AI models under the author's direction.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon