didericis/math-research
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add bridge switch / bridge-derived level graph; set up exhaustive test

Browse Source 
- 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>
This commit is contained in:
didericis
2026-05-22 00:09:19 -04:00
parent 9bf4deac74
commit bb144f069e
8 changed files with 595 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files
papers/even_level_graph_generators/paper.aux
+10 -8
View File
@@ -34,18 +34,20 @@
\newlabel{sec:even-level-graphs}{{4}{3}{Even Level Graphs}{section.4}{}}
\newlabel{def:even-level-graph}{{4.1}{3}{Even Level Graph}{theorem.4.1}{}}
\newlabel{thm:even-level-4colorable}{{4.2}{3}{}{theorem.4.2}{}}
\citation{holton-mckay}
\newlabel{def:derived-level-graph}{{4.3}{4}{Derived level graph}{theorem.4.3}{}}
\newlabel{def:intertwining-tree}{{4.4}{4}{Intertwining tree}{theorem.4.4}{}}
\newlabel{thm:intertwining-iff-hamiltonian-dual}{{4.5}{4}{}{theorem.4.5}{}}
\newlabel{conj:every-triangulation-derived}{{4.6}{4}{}{theorem.4.6}{}}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{Empirical status}}{4}{section*.1}\protected@file@percent }
\newlabel{def:bridge-switch}{{4.4}{4}{Bridge switch}{theorem.4.4}{}}
\newlabel{def:bridge-derived-level-graph}{{4.5}{4}{Bridge-derived level graph}{theorem.4.5}{}}
\newlabel{def:intertwining-tree}{{4.6}{4}{Intertwining tree}{theorem.4.6}{}}
\newlabel{thm:intertwining-iff-hamiltonian-dual}{{4.7}{4}{}{theorem.4.7}{}}
\citation{holton-mckay}
\bibcite{holton-mckay}{1}
\newlabel{conj:every-triangulation-derived}{{4.8}{5}{}{theorem.4.8}{}}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{Empirical status}}{5}{section*.1}\protected@file@percent }
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{The boundary case $n = 21$}}{5}{section*.2}\protected@file@percent }
\newlabel{tocindent-1}{0pt}
\newlabel{tocindent0}{14.69437pt}
\newlabel{tocindent1}{17.77782pt}
\newlabel{tocindent2}{0pt}
\newlabel{tocindent3}{0pt}
\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{The boundary case $n = 21$}}{5}{section*.2}\protected@file@percent }
\@writefile{toc}{\contentsline {section}{\tocsection {}{}{References}}{5}{section*.3}\protected@file@percent }
\gdef \@abspage@last{5}
\@writefile{toc}{\contentsline {section}{\tocsection {}{}{References}}{6}{section*.3}\protected@file@percent }
\gdef \@abspage@last{6}