Files
math-research/papers
didericis 57eccad49c coloring_nested_tire_graphs: tree structure sweep on minimum-counterexample-eligible graphs
Strictly tests the cut-tire forest property on cubic plane graphs
whose primal triangulation is internally 6-connected (= eligible
to be a minimum counterexample to the 4CT, per Birkhoff 1913).

Verified internal 6-connectivity of two primal triangulations
(exhaustive check over all 5-vertex subsets):

  - Icosahedron (12v, 5-regular): YES, internally 6-connected.
    Dual = Dodecahedron.
  - Pentakis dodecahedron (32v, min deg 5, max deg 6):
    YES, internally 6-connected.  Dual = BuckyBall.

Tree structure sweep on the corresponding duals:
  - Dodecahedron: 45 cuts, 45/45 produce trees on both sides.
  - BuckyBall (60v cubic plane): 60 cuts, 60/60 produce trees.
  - TruncatedTet (12v): 2 cuts, 2/2 produce trees.

105/105 cuts on minimum-counterexample-eligible duals produced
trees on both sides. 0 failures.

(Tutte graph: ran out of timeout enumerating its 6-edge cuts;
skipped from final tally.)

This is the most direct evidence for Proposition (cut tires form a
forest): the tree structure holds on the actual Birkhoff-eligible
graphs.

Files:
  experiments/eligible_sweep.py
  experiments/eligible_sweep_data.txt
  notes/cut_tire_tree_structure.tex (updated)

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
2026-05-26 22:15:10 -04:00
..