Enumerate non-Hamiltonian cyclically-5-connected cubic planar graphs by
running plantri -c5 -d for n in {23,25,26} (n=24 already in the previous
commit) and filtering for non-Hamiltonian dual:
n=23 -> 0 of 1970 (recomputes Faulkner-Younger minimality)
n=24 -> 1 of 6833 (the Tutte/Fig 2.10 graph)
n=25 -> 1 of 23384 (new; unique 46-vertex one)
n=26 -> 0 of 82625
Both T (n=24) and T_25 (n=25) verified internally 6-connected by exhaustive
5-cut scan: every 5-cut is the neighborhood of a degree-5 vertex. This is
the strongest connectivity a planar triangulation can have and the level
at which Birkhoff-style reductions terminate, so both are genuinely
irreducible bases of any decomposition argument.
T_25 is also bridge-derived: witness Even Level Graph from source 24
(max level 4) at depth 2, orbit only 3114 states. Forward switches:
remove {21,23} add {22,24}; remove {3,5} add {1,6}. Both adds are bridges
of the even parity subgraph. Same witness signature as T (minimum total
Betti, tiny orbit, depth 2).
New subsection "Beyond n=24: enumeration and the next 5-connected core",
abstract extended, new Figure 7 (core_n25_dual.png). Reproducibility
scripts: draw_core_witness.py and verify_core_witness.py (both
parametrized so they work on any 5-conn non-Ham-dual core's g6).
Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
Record the partition sweep on the n=24 Fig 2.10 dual. New subsection +
experiments/bridge_partition_sweep.py.
Findings:
- A bridge switch is a constrained diagonal flip; bridge-derived via L
means lying in an Even-Level-Graph component of the restricted flip
graph. So the question is which flip-components contain an ELG.
- Identity: every 4-coloring of a triangulation has e_cross = 2n-4 (each
face has one within-pair edge), so total parity-subgraph Betti =
(c_A+c_B)-2; intertwining trees are the Betti-0 case.
- Of T's 333 valid partitions, total Betti splits 288/42/3 over 1/2/3;
min is 1 (T not intertwining). All 27 partitions found bridge-derived
(depth 2-3) have the minimum Betti 1 -> necessary.
- But not sufficient: only 27 of 288 Betti-1 partitions yield a witness;
the rest have flip-orbits >1.5e5 with no ELG, and a 12x budget increase
found none. The discriminator is flip-component structure (sharp
orbit-size dichotomy), not a numerical invariant. Characterizing which
Betti-minimal partitions sit in an ELG component is left open.
Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
Add the n=24 result to the Even Level Graph Generators paper: the dual of
the unique 44-vertex non-Hamiltonian cyclically-5-connected cubic planar
graph (Holton-McKay Fig. 2.10) -- a 24-vertex 5-connected triangulation,
the first conjecture test outside the 3-cut family -- is a bridge-derived
level graph, two verified bridge switches from an Even Level Graph
(source 19).
- Generate the graph rather than transcribe it: plantri -c5 lists all 6833
5-connected 24-vertex triangulations; exactly one has a non-Hamiltonian
dual, which also settles the uniqueness Holton-McKay left open at 44
vertices (cyclically-5-connected triangulation <=> dual cubic graph).
- New abstract sentence + "cyclically-5-connected case: n=24" subsection,
noting the classic 46-vertex Tutte graph is only cyclically 3-connected.
- Figure 6 (figures/fig210_dual.png): the dual T, parity-coloured, with the
two introduced bridge edges {6,19} and {20,22} in green (style of Fig. 5).
- Experiments: test_fig210_dual_bridge.py (generate->filter->test pipeline),
verify_fig210_witness.py (step-verifies the witness), draw_fig210_dual.py
(figure), fig210_dual.g6 (the unique graph). paper.pdf rebuilt (10 pages).
Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
experiments/test_tutte_bridge.py: bridge-derivability test for the dual of
the 46-vertex Tutte graph (a 25-vertex non-intertwining triangulation,
since the Tutte graph is non-Hamiltonian) -- the conjecture's first case
beyond the n=21 Holton-McKay duals. Reuses the fast integer-state bridge
engine: per source labelling with bipartite parity subgraphs, run a
backward bridge-orbit BFS for an Even Level Graph witness.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
Replace the radial (crossing-heavy) figure with two crossing-free planar
drawings (networkx planar_layout / Chrobak-Payne):
fig:n21-elgs -- the six witness Even Level Graphs, parity-coloured, with
the bridge-switch-flipped edges dashed red;
fig:n21-duals -- the six resulting duals, with the introduced bridge edges
solid green.
ELG and dual are drawn with independent planar layouts so neither has any
edge crossing (a flip diagonal would otherwise cross other edges when its
quadrilateral is non-convex, which happens for duals 0 and 3). Drop forced
equal aspect so panels fill and labels separate.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
Figure fig:n21-witnesses: each of the six Holton-McKay duals drawn as its
witness Even Level Graph in a radial-by-level layout (source centre,
level-k vertices on ring k), coloured by parity. Dashed red edges are the
flipped same-parity edges and solid green edges the introduced bridges;
applying the switches yields the dual. Duals 1,2 are ELGs outright.
draw_witnesses.py generates the combined 2x3 figure and per-dual PNGs from
the verified witness JSONs.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
Tested duals 1 and 2: both are Even Level Graphs directly (dual 1 for
source 10, dual 2 for source 9), so bridge-derived with a zero-length
switch sequence. All six Holton-McKay duals are confirmed non-intertwining
(consistent with the dual-Hamiltonian theorem, since all six HM graphs are
non-Hamiltonian) and all six are bridge-derived. Saved witness files
dual_1.json, dual_2.json (0 switches) to complete the archive for all six.
Updated the n=21 subsection accordingly.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
- Conjecture now reads "bridge-derived level graph ... an intertwining tree,
or both" -- the stronger form the evidence actually supports (a bridge-
derived level graph is automatically a valid derived level graph).
- Empirical table recomputed for bridge-derivability, exhaustively for n<=9
(every backward bridge-orbit fully enumerable there):
n=7: 1 inter-only; n=8: 2 inter-only; n=9: 14 inter-only; missing=0.
Added prose: below n=21 every class is intertwining, so the table shows
how far the bridge-derived disjunct reaches on its own (36/50 at n=9) and
that the two disjuncts complement each other; "bridge only" is 0 in range.
- n=21 subsection notes the four witnesses are explicit, short (path lengths
3,1,2,4), archived, and step-verified.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
The hunt only logged partition indices; the actual witness ELGs were lost.
Re-extract them (deterministic) with full bridge-switch paths and verify
every step independently. Saved as experiments/witnesses/dual_<i>.json
(labels, ELG source, ELG + dual graph6 and edge lists, the explicit
remove/add bridge-switch sequence, verified flag). All four verify:
dual 0: ELG source 18, 3 bridge switches to dual
dual 3: ELG source 16, 1 bridge switch to dual
dual 4: ELG source 20, 2 bridge switches to dual
dual 5: ELG source 1, 4 bridge switches to dual
So each dual is only a handful of bridge switches from an Even Level Graph,
and the witnesses are now reproducible and human-checkable.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
Backward bridge-switch search (sharded over valid parity partitions) found
an Even Level Graph witness for each of the four previously-open duals:
dual 0: partition 12, witness orbit 9458
dual 3: partition 9, witness orbit 388
dual 4: partition 23, witness orbit 3842
dual 5: partition 12, witness orbit 165668
So all four are bridge-derived level graphs, hence valid derived level
graphs. Combined with the two duals that are Even Level Graphs outright,
the disjunction is now confirmed for ALL SIX critical iso classes at n=21
-- the first nontrivial test of the conjecture passes.
Why it worked where exhaustion failed: a witness, when it exists, tends to
sit in a SMALL orbit (here a few hundred to ~1.7e5 states) reachable
quickly, while other parity partitions of the same triangulation have
orbits >1e6. We only need one good partition. The bridge restriction both
shrinks orbits ~100x and guarantees validity, so any ELG found in a
backward orbit is an immediate witness.
- Update paper n=21 subsection to report the resolution.
- Add shard_hunt.py (partition-sharded parallel witness hunt).
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
Findings at n=9 (50 triangulations, orbits fully exhaustible):
- 36 bridge-derived, 14 NOT bridge-derived. So bridge-derived is a PROPER
subclass of derived (49 derived at n=9). All 14 non-bridge graphs are
intertwining trees -- as are all 50, necessarily: intertwining tree
<=> dual Hamiltonian, and the smallest non-Hamiltonian 3-connected cubic
planar graph has 38 vertices, i.e. dual on 2n-4=38 => n=21. Hence every
triangulation with n<=20 is an intertwining tree, and the disjunction
"bridge-derived OR intertwining" is trivially true below n=21. The 4
Holton-McKay duals are the first non-intertwining triangulations.
- Static parity-subgraph invariants (Betti numbers, component counts,
cross-edge count, existence of an all-forest partition) do NOT separate
bridge-derived from non-bridge-derived -- both classes realize beta=0
partitions and identical ranges. Bridge-derivability is dynamical, not a
simple static invariant; no easy obstruction.
- Side lemma: every valid parity partition of an n-vertex triangulation has
exactly 2n-4 cross edges (intra-edges = n-2). Holds for all n=9 graphs.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
- fast_bridge.py: states as 210-bit integer edge-bitmasks (compact memory,
O(1) set ops); build a NetworkX graph only once per state for the planar
embedding; parity-subgraph bridges via one iterative DFS per state instead
of per-edge subgraph copies. Validated identical orbits to the slow version;
throughput ~5170 states/s vs ~1100 (graph.copy was 66% of old runtime).
- fast_decide.py: integrated, gated ELG-witness check (only even-class
sources with all-opposite-class neighbourhoods are tested with the
ground-truth is_even_level_graph, then parity match). Witness detection
validated (ELGs -> True, T*_9 -> False).
- Feasibility finding: bridge orbits are ~100x smaller than full E/O orbits
but still 1e5-1e6 states per labelling (partitions 0,1 of dual 0 exceed
310k and 685k without exhausting), x ~150 valid parity partitions per dual.
Exhausting every orbit -- required for a conclusive NEGATIVE -- is
computationally infeasible. A conclusive POSITIVE (witness ELG) remains
reachable; none found so far.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
- Define bridge switch (E/O switch whose new same-parity edge is a bridge
in its parity subgraph) and bridge-derived level graph in the paper.
Note that bridge switches preserve bipartite parity subgraphs, so every
bridge-derived level graph is automatically valid.
- Discover the E/O-switch relation is directed (irreversible when a switch
produces a cross-parity edge); T*_9 reaches an ELG forward but no ELG
reaches it, explaining why it is not derived. This rules out a simple
switch-invariant characterization.
- Bridge orbits are far smaller than full E/O orbits (~10^4 vs ~10^8 for
some labellings), making exhaustive search feasible. Each of the 4 open
duals has ~150 valid parity partitions; exhaustive bridge-orbit search
per partition can decide bridge-derivability conclusively.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
- Add Theorem: maximal planar G is an intertwining tree iff its dual
G* is Hamiltonian (Tait-style Jordan-curve argument). Consequence:
smallest non-intertwining-tree triangulations are the 6 duals of the
38-vertex Holton-McKay graphs, at n=21.
- Load the 6 graphs from McKay's authoritative planar_code file
(nonham38m4.pc), verified: 38 vertices, cubic, planar, non-Hamiltonian.
- All 6 duals confirmed not intertwining trees (exhaustive 2^20 check).
- 2 of 6 duals are themselves Even Level Graphs (sources 9, 10), hence
derived level graphs -- first cases where the derived disjunct does
work the intertwining-tree disjunct cannot.
- Remaining 4: bounded E/O-orbit search inconclusive; status open. This
is the first genuinely undetermined instance of the conjecture.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
- New paper papers/even_level_graph_generators/: defines Even Level
Graph (every level cycle even), derived level graphs, intertwining
trees, and the disjunction conjecture (every maximal planar graph is
a derived level graph or intertwining tree). Empirically tested
through n=11: every iso class is at least an intertwining tree, so
the disjunction holds trivially in this range. The intertwining tree
disjunct fails at the Tutte graph dual (n=25), so the disjunction
becomes non-trivial past some unknown threshold.
- Level Switching paper: adds Section 4 (Reachability via edge
switches) with the two-step argument (Sleator-Tarjan-Thurston for
Case 1; face-merges for Case 2) and Theorem 4.1 (O(n) edge switches
suffice to reach all-depth-0).
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
didericis