Commit Graph

4 Commits

Author SHA1 Message Date
didericis c5f81842c7 Run Heawood pigeonhole between nested connected tire clusters
Add the two-sided cluster decomposition proposition: a vertex's full
Heawood face-sum splits as exactly one child-cluster contribution plus
one parent-cluster contribution (the at-most-two-clusters bound makes the
pairing binary and complete). Explain why this fails per-tire -- a vertex
on many same-depth tires has only a fragment of its face-star in any one
tire -- and recast the chain-pigeonhole and 4CT conjectures to nested
clusters with a cluster restriction relation.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-17 01:10:30 -04:00
didericis 646cf9d12f Add connected tire clusters with two-cluster-per-vertex proposition
Define a connected tire cluster (union of same-depth tires joined by
shared vertices, transitive closure), prove same-depth tires meet only
in vertices, and prove every vertex lies in at most two clusters (one at
each of two consecutive depths) -- the bounded coarsening of the
unbounded per-vertex tire count.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-17 01:03:37 -04:00
didericis 251c453437 Add Heawood chain-pigeonhole programme to tire-dual paper
Define a +/-1 Heawood face-labelling of a tire, its induced boundary
Heawood sequences and restriction relation, and interface compatibility
(0<->0, +1<->-1 = vertex face-sum vanishes mod 3). State the Heawood
chain-pigeonhole conjecture and a tire route to the Four Colour Theorem,
parallel to the medial programme.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-17 00:45:03 -04:00
didericis 851ca7fbed Scaffold Heawood restrictions on nested tire graph duals paper
Add a new paper stub referencing the nested tire decompositions paper,
with intro, Heawood bibliography entry, and an empty restrictions section.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-17 00:31:48 -04:00