Files
math-research/papers
didericis 659068fca7 coloring_nested_tire_graphs: worst-case proof sketch via König 3-edge-coloring; chunked enumeration + threshold search infrastructure
Proves the clean piece: when both T1 and T2 give direct all-3 γ-face
partitions of E(γ), the worst-case overlap is ≥ 6, witnessed by
König's edge-coloring theorem on the 3-regular bipartite "face-
incidence graph" G. A proper 3-edge-coloring of G lifts to a Latin
σ on γ satisfying both face partitions, and S_3 symmetry gives 6
distinct such σ.

Identifies the gap: T2's chord is on B_in_2, not on γ, so T2 doesn't
directly give a γ-partition. The proof closes if we exhibit an
"induced γ-partition" determined by T2's annular triangulation —
conjectured but not constructed here.

Also commits chunked enumeration code and threshold-search script
launched separately.

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