didericis
9bf4deac74
- 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>
8 lines
1.0 KiB
Plaintext
8 lines
1.0 KiB
Plaintext
\BOOKMARK [1][-]{section.1}{\376\377\0001\000.\000\040\000I\000n\000t\000r\000o\000d\000u\000c\000t\000i\000o\000n}{}% 1
|
|
\BOOKMARK [1][-]{section.2}{\376\377\0002\000.\000\040\000D\000e\000f\000i\000n\000i\000t\000i\000o\000n\000s}{}% 2
|
|
\BOOKMARK [1][-]{section.3}{\376\377\0003\000.\000\040\000O\000u\000t\000e\000r\000p\000l\000a\000n\000a\000r\000i\000t\000y\000\040\000o\000f\000\040\000l\000e\000v\000e\000l\000\040\000c\000o\000m\000p\000o\000n\000e\000n\000t\000s}{}% 3
|
|
\BOOKMARK [1][-]{section.4}{\376\377\0004\000.\000\040\000E\000v\000e\000n\000\040\000L\000e\000v\000e\000l\000\040\000G\000r\000a\000p\000h\000s}{}% 4
|
|
\BOOKMARK [2][-]{section*.1}{\376\377\000E\000m\000p\000i\000r\000i\000c\000a\000l\000\040\000s\000t\000a\000t\000u\000s}{section.4}% 5
|
|
\BOOKMARK [2][-]{section*.2}{\376\377\000T\000h\000e\000\040\000b\000o\000u\000n\000d\000a\000r\000y\000\040\000c\000a\000s\000e\000\040\000n\000\040\000=\000\040\0002\0001}{section.4}% 6
|
|
\BOOKMARK [1][-]{section*.3}{\376\377\000R\000e\000f\000e\000r\000e\000n\000c\000e\000s}{}% 7
|