diff --git a/papers/even_level_graph_generators/experiments/draw_fig210_dual.py b/papers/even_level_graph_generators/experiments/draw_fig210_dual.py new file mode 100644 index 0000000..ecec9c3 --- /dev/null +++ b/papers/even_level_graph_generators/experiments/draw_fig210_dual.py @@ -0,0 +1,151 @@ +"""Draw 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 T. Same style as draw_witnesses.py / Figure 5: +crossing-free planar drawing, vertices coloured by the fixed parity +labelling (blue even, orange odd), and the bridge edges introduced by the +two bridge switches from T's witness Even Level Graph drawn solid green. + +Writes ../figures/fig210_dual.png. +""" +import sys +import os +sys.path.insert(0, '/Users/didericis/Code/math-research/papers/' + 'level_resolutions_of_maximal_planar_graphs/experiments') +sys.path.insert(0, os.path.dirname(os.path.abspath(__file__))) +import networkx as nx +import matplotlib +matplotlib.use('Agg') +import matplotlib.pyplot as plt +from matplotlib.lines import Line2D +from sage.all import Graph # type: ignore +from tutte_dual_treecolor import dual_triangulation +from test_tutte_bridge import valid_parity_partitions_via_coloring +from test_fig210_dual_bridge import sage_to_nx +from fast_bridge import EdgeCode, parity_bridges +from test_conjecture import is_even_level_graph + +HERE = os.path.dirname(os.path.abspath(__file__)) +FDIR = os.path.join(HERE, '..', 'figures') +EVEN_C = '#9ecae1' +ODD_C = '#fdae6b' + + +def build(): + g6 = open(os.path.join(HERE, 'fig210_dual.g6')).read().strip() + T, _ = dual_triangulation(sage_to_nx(Graph(g6))) + parts, _ = valid_parity_partitions_via_coloring(T) + labels = parts[9] # the witness-bearing partition + return T, labels + + +def neighbors(code, labels, state): + G = code.graph_of(state) + ok, emb = nx.check_planarity(G) + ea = {v: set() for v in code.nodes if labels[v] == 0} + oa = {v: set() for v in code.nodes if labels[v] == 1} + for u, v in G.edges(): + if labels[u] == labels[v]: + (ea if labels[u] == 0 else oa)[u].add(v) + (ea if labels[u] == 0 else oa)[v].add(u) + br = parity_bridges(ea) | parity_bridges(oa) + for u, v in G.edges(): + f1 = emb.traverse_face(u, v) + if len(f1) != 3: + continue + f2 = emb.traverse_face(v, u) + if len(f2) != 3: + continue + w = next(a for a in f1 if a not in (u, v)) + x = next(b for b in f2 if b not in (u, v)) + if w == x or G.has_edge(w, x) or labels[w] != labels[x]: + continue + if labels[u] == labels[v] and frozenset((u, v)) not in br: + continue + yield (state & ~(1 << code.bit(u, v))) | (1 << code.bit(w, x)) + + +def elg_src(code, labels, state): + G = code.graph_of(state) + for s in code.nodes: + cs = labels[s] + nb = set(G.neighbors(s)) + if not nb or any(labels[w] == cs for w in nb): + continue + ok, lv = is_even_level_graph(G, frozenset({s})) + if ok and all((lv[v] % 2 == 0) == (labels[v] == cs) for v in code.nodes): + return s + return None + + +def witness_added_edges(T, labels): + """Backward bridge BFS to the ELG; return (source, [added bridge edges]).""" + code = EdgeCode(T.nodes()) + s0 = code.state_of(T) + parent = {s0: None} + frontier = [s0] + W = None + while frontier and W is None: + nf = [] + for st in frontier: + if elg_src(code, labels, st) is not None: + W = st + break + for ns in neighbors(code, labels, st): + if ns not in parent: + parent[ns] = st + nf.append(ns) + if W: + break + frontier = nf + path = [] + c = W + while c is not None: + path.append(c) + c = parent[c] + # path[0]=ELG ... path[-1]=T; edges added going ELG->T are present in T + added = [] + for k in range(len(path) - 1): + A = set(map(frozenset, code.graph_of(path[k]).edges())) + B = set(map(frozenset, code.graph_of(path[k + 1]).edges())) + added.append(tuple(sorted(next(iter(B - A))))) + return elg_src(code, labels, W), added + + +def main(): + os.makedirs(FDIR, exist_ok=True) + T, labels = build() + src, added = witness_added_edges(T, labels) + print('ELG source', src, 'bridge edges introduced', added) + + fig, ax = plt.subplots(figsize=(7.5, 7.5)) + pos = nx.planar_layout(T) + colors = [EVEN_C if labels[v] == 0 else ODD_C for v in T.nodes()] + hl = {frozenset(e) for e in added} + plain = [e for e in T.edges() if frozenset(e) not in hl] + nx.draw_networkx_edges(T, pos, edgelist=plain, ax=ax, + edge_color='#b0b0b0', width=0.9) + nx.draw_networkx_edges(T, pos, edgelist=[tuple(e) for e in hl], ax=ax, + edge_color='#2ca02c', width=2.6) + nx.draw_networkx_nodes(T, pos, node_color=colors, node_size=240, + edgecolors='#444444', linewidths=0.6, ax=ax) + nx.draw_networkx_labels(T, pos, font_size=8, ax=ax) + ax.margins(0.12) + ax.axis('off') + handles = [ + Line2D([0], [0], marker='o', color='w', markerfacecolor=EVEN_C, + markeredgecolor='#444', markersize=9, label='even parity'), + Line2D([0], [0], marker='o', color='w', markerfacecolor=ODD_C, + markeredgecolor='#444', markersize=9, label='odd parity'), + Line2D([0], [0], color='#2ca02c', lw=2.6, label='bridge edge introduced'), + ] + fig.legend(handles=handles, loc='lower center', ncol=3, fontsize=9, + frameon=False) + fig.tight_layout(rect=(0, 0.05, 1, 1)) + out = os.path.join(FDIR, 'fig210_dual.png') + fig.savefig(out, dpi=160) + plt.close(fig) + print('wrote', out) + + +if __name__ == '__main__': + main() diff --git a/papers/even_level_graph_generators/experiments/fig210_dual.g6 b/papers/even_level_graph_generators/experiments/fig210_dual.g6 new file mode 100644 index 0000000..8be89ad --- /dev/null +++ b/papers/even_level_graph_generators/experiments/fig210_dual.g6 @@ -0,0 +1 @@ +ksP@@?PE?O?`@??_?O?A@?G??OG?O??G??A@??o??A???C@??E???@????O???E????G????OG???OG???G????B?????W????@?????A@????A@?????o?????G?????@@?????CC?????GG?????E??????@K diff --git a/papers/even_level_graph_generators/experiments/test_fig210_dual_bridge.py b/papers/even_level_graph_generators/experiments/test_fig210_dual_bridge.py new file mode 100644 index 0000000..b45ace1 --- /dev/null +++ b/papers/even_level_graph_generators/experiments/test_fig210_dual_bridge.py @@ -0,0 +1,95 @@ +"""Bridge-derivability test for the dual of Holton-McKay's Fig. 2.10 graph +-- the smallest known non-Hamiltonian *cyclically 5-connected* cubic +planar graph (44 vertices, attributed to Tutte). + +We obtain the graph by generation rather than transcription. A 44-vertex +cubic planar graph is the dual of a 24-vertex triangulation, and a cubic +graph is cyclically 5-connected iff its dual triangulation is 5-connected +(no separating 3- or 4-cycle). So we run + + plantri -c5 -d -g 24 + +to list every 5-connected 24-vertex triangulation's cubic dual, keep the +non-Hamiltonian ones (Hamiltonicity of the dual = intertwining-tree of the +triangulation, by the paper's equivalence), and test each resulting +triangulation T = dual(H) for bridge-derivability. This is the conjecture's +first test in the cyclically-5-connected regime -- the family the n=21 and +46-vertex-Tutte duals (all only cyclically 3-connected) never reached. + +Run after /tmp/nonham_duals.g6 has been produced by the Hamiltonicity +filter (lines: " "). +""" +import sys +import os +import time +sys.path.insert(0, '/Users/didericis/Code/math-research/papers/' + 'level_resolutions_of_maximal_planar_graphs/experiments') +sys.path.insert(0, os.path.dirname(os.path.abspath(__file__))) +import networkx as nx +from sage.all import Graph # type: ignore +from tutte_dual_treecolor import dual_triangulation +from fast_bridge import EdgeCode +from test_tutte_bridge import ( + characterize, valid_parity_partitions_via_coloring, search_partition, +) + + +def sage_to_nx(G): + H = nx.Graph() + H.add_nodes_from(int(v) for v in G.vertices()) + H.add_edges_from((int(u), int(v)) for u, v in G.edges(labels=False)) + return H + + +def test_one(g6, cap=600_000, time_limit=180.0, log=print): + H = sage_to_nx(Graph(g6)) + T, _ = dual_triangulation(H) # 24-vertex triangulation + info = characterize(T) + log('dual triangulation T: n=%(n)d m=%(m)d triangulation=%(is_triangulation)s ' + 'separating_triangles=%(separating_triangles)d four_connected=%(four_connected)s' + % info) + five_conn = (nx.node_connectivity(T) >= 5) + log(' vertex-connectivity(T) >= 5: %s [cyclically-5-connected cubic dual]' + % five_conn) + + code = EdgeCode(T.nodes()) + code.state0 = code.state_of(T) + n = info['n'] + parts, n_col = valid_parity_partitions_via_coloring(T) + log(' %d valid parity partitions (from %d 4-colorings)' % (len(parts), n_col)) + + t0 = time.time() + for k, labels in enumerate(parts): + st, sz, depth = search_partition(code, labels, n, cap, time_limit) + if st == 'found': + log(' ==> BRIDGE-DERIVED: ELG witness at %d bridge switches ' + '(partition %d, orbit>=%d, %.0fs)' % (depth, k, sz, time.time() - t0)) + return 'bridge-derived', depth + if st in ('capped', 'timeout') or (k + 1) % 25 == 0: + log(' partition %d/%d: %s (orbit>=%d, %.0fs)' + % (k + 1, len(parts), st, sz, time.time() - t0)) + # if every orbit fully exhausted with no witness -> conclusive NO + log(' ==> NO witness over all %d valid partitions (%.0fs)' + % (len(parts), time.time() - t0)) + return 'no-witness', None + + +def main(): + path = '/tmp/nonham_duals.g6' + rows = [] + with open(path) as f: + for line in f: + line = line.strip() + if line: + idx, g6 = line.split(None, 1) + rows.append((int(idx), g6)) + print('%d non-Hamiltonian cyclically-5-connected 44-vertex duals to test\n' + % len(rows), flush=True) + for idx, g6 in rows: + print('### candidate (plantri index %d): %s' % (idx, g6), flush=True) + verdict, depth = test_one(g6) + print('### verdict: %s\n' % verdict, flush=True) + + +if __name__ == '__main__': + main() diff --git a/papers/even_level_graph_generators/experiments/verify_fig210_witness.py b/papers/even_level_graph_generators/experiments/verify_fig210_witness.py new file mode 100644 index 0000000..004639e --- /dev/null +++ b/papers/even_level_graph_generators/experiments/verify_fig210_witness.py @@ -0,0 +1,79 @@ +import sys +E='/Users/didericis/Code/math-research/papers/even_level_graph_generators/experiments' +L='/Users/didericis/Code/math-research/papers/level_resolutions_of_maximal_planar_graphs/experiments' +sys.path.insert(0,E); sys.path.insert(0,L) +import networkx as nx +from sage.all import Graph +from tutte_dual_treecolor import dual_triangulation +from test_tutte_bridge import valid_parity_partitions_via_coloring +from test_fig210_dual_bridge import sage_to_nx +from fast_bridge import EdgeCode, parity_bridges +from test_conjecture import is_even_level_graph + +g6=open('/tmp/nonham_duals.g6').read().split(None,1)[1].strip() +H=sage_to_nx(Graph(g6)); T,_=dual_triangulation(H) +parts,_=valid_parity_partitions_via_coloring(T) +labels=parts[9]; code=EdgeCode(T.nodes()); s0=code.state_of(T); n=24 + +def neighbors(state): + G=code.graph_of(state); ok,emb=nx.check_planarity(G) + ea={v:set() for v in code.nodes if labels[v]==0}; oa={v:set() for v in code.nodes if labels[v]==1} + for u,v in G.edges(): + if labels[u]==labels[v]: (ea if labels[u]==0 else oa)[u].add(v);(ea if labels[u]==0 else oa)[v].add(u) + br=parity_bridges(ea)|parity_bridges(oa); out=[] + for u,v in G.edges(): + f1=emb.traverse_face(u,v) + if len(f1)!=3: continue + f2=emb.traverse_face(v,u) + if len(f2)!=3: continue + w=next(a for a in f1 if a not in(u,v)); x=next(b for b in f2 if b not in(u,v)) + if w==x or G.has_edge(w,x) or labels[w]!=labels[x]: continue + if labels[u]==labels[v] and frozenset((u,v)) not in br: continue + out.append((state&~(1< T) +src=elg_src(W) +print('=== Fig 2.10 dual T: bridge-derived, witness at %d bridge switches ==='%(len(path)-1)) +print('ELG source s =',src) +ok,lv=is_even_level_graph(code.graph_of(W),frozenset({src})) +print('ELG verified (all level cycles even from s=%d): %s'%(src,ok)) +print('max level =',max(lv.values())) +allgood=True +for k in range(len(path)-1): + A=code.graph_of(path[k]); B=code.graph_of(path[k+1]) + EA=set(map(frozenset,A.edges())); EB=set(map(frozenset,B.edges())) + new=tuple(sorted(next(iter(EB-EA)))); rem=tuple(sorted(next(iter(EA-EB)))) + # bridge condition on NEW edge in B's parity subgraph (forward result) + ea={v:set() for v in code.nodes if labels[v]==0}; oa={v:set() for v in code.nodes if labels[v]==1} + for u,v in B.edges(): + if labels[u]==labels[v]: (ea if labels[u]==0 else oa)[u].add(v);(ea if labels[u]==0 else oa)[v].add(u) + br=parity_bridges(ea)|parity_bridges(oa) + if labels[new[0]]==labels[new[1]]: + valid=frozenset(new) in br; kind='same-parity bridge in %s subgraph'%('even' if labels[new[0]]==0 else 'odd') + else: + valid=True; kind='cross-parity (enters neither subgraph)' + allgood &= valid + print(' switch %d: remove level-edge %s, add %s [%s] valid=%s'%(k+1,rem,new,kind,valid)) +print('ALL STEPS VALID BRIDGE SWITCHES:',allgood) +print('T is intertwining tree:', False, '(dual H non-Hamiltonian =', not Graph(g6).is_hamiltonian(),')') diff --git a/papers/even_level_graph_generators/figures/fig210_dual.png b/papers/even_level_graph_generators/figures/fig210_dual.png new file mode 100644 index 0000000..af9677f Binary files /dev/null and b/papers/even_level_graph_generators/figures/fig210_dual.png differ diff --git a/papers/even_level_graph_generators/paper.aux b/papers/even_level_graph_generators/paper.aux index 62baa8d..b0d584b 100644 --- a/papers/even_level_graph_generators/paper.aux +++ b/papers/even_level_graph_generators/paper.aux @@ -19,41 +19,45 @@ \@writefile{toc}{\contentsline {section}{\tocsection {}{1}{Introduction}}{1}{section.1}\protected@file@percent } \@writefile{toc}{\contentsline {section}{\tocsection {}{2}{Definitions}}{2}{section.2}\protected@file@percent } \newlabel{def:edge-switch}{{2.4}{2}{Edge switch}{theorem.2.4}{}} -\@writefile{toc}{\contentsline {section}{\tocsection {}{3}{Outerplanarity of level components}}{2}{section.3}\protected@file@percent } -\newlabel{sec:outerplanar-components}{{3}{2}{Outerplanarity of level components}{section.3}{}} \@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces BFS levels from the degree-$3$ vertex source $S = \{4\}$. The source is level $0$, its three neighbours are level $1$, and the remaining vertices are level $2$. Colour encodes the level.}}{3}{figure.1}\protected@file@percent } \newlabel{fig:levels}{{1}{3}{BFS levels from the degree-$3$ vertex source $S = \{4\}$. The source is level $0$, its three neighbours are level $1$, and the remaining vertices are level $2$. Colour encodes the level}{figure.1}{}} \@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces A level cycle in the triangulation of Figure\nonbreakingspace \ref {fig:levels}. The triangle $1\!-\!2\!-\!3$ is a simple cycle whose three vertices all lie at level $1$, so it is a level cycle at level $1$.}}{3}{figure.2}\protected@file@percent } \newlabel{fig:level-cycle}{{2}{3}{A level cycle in the triangulation of Figure~\ref {fig:levels}. The triangle $1\!-\!2\!-\!3$ is a simple cycle whose three vertices all lie at level $1$, so it is a level cycle at level $1$}{figure.2}{}} +\@writefile{toc}{\contentsline {section}{\tocsection {}{3}{Outerplanarity of level components}}{3}{section.3}\protected@file@percent } +\newlabel{sec:outerplanar-components}{{3}{3}{Outerplanarity of level components}{section.3}{}} \newlabel{thm:outerplanar-component}{{3.1}{3}{}{theorem.3.1}{}} \@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces An edge switch on the level cycle of Figure\nonbreakingspace \ref {fig:level-cycle}. The chosen cycle edge $1\!-\!2$ is shared by the triangular faces $(0,1,2)$ and $(1,2,4)$; the switch deletes $1\!-\!2$ (red, left) and inserts $0\!-\!4$ (green, right). Vertex colours indicate the original levels in $G$.}}{4}{figure.3}\protected@file@percent } \newlabel{fig:edge-switch}{{3}{4}{An edge switch on the level cycle of Figure~\ref {fig:level-cycle}. The chosen cycle edge $1\!-\!2$ is shared by the triangular faces $(0,1,2)$ and $(1,2,4)$; the switch deletes $1\!-\!2$ (red, left) and inserts $0\!-\!4$ (green, right). Vertex colours indicate the original levels in $G$}{figure.3}{}} \@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces Parity subgraphs of $G' = T$ with respect to the level structure of Figure\nonbreakingspace \ref {fig:levels} (here we take $G = G' = T$). Left: $T$ with vertices coloured by $\ell _G \nonscript \mskip -\medmuskip \mkern 5mu\mathbin {\mathgroup \symoperators mod}\penalty 900 \mkern 5mu\nonscript \mskip -\medmuskip 2$ (blue $=$ even, orange $=$ odd). Middle: the even parity subgraph $E_{G,S}(G')$, induced on $\{0, 4, 5, 6\}$; only edges with both endpoints even appear. Right: the odd parity subgraph $O_{G,S}(G')$, induced on $\{1, 2, 3\}$; the highlighted triangle shows that $O_{G,S}(G')$ is not bipartite for this choice of $G'$.}}{4}{figure.4}\protected@file@percent } \newlabel{fig:parity-subgraph}{{4}{4}{Parity subgraphs of $G' = T$ with respect to the level structure of Figure~\ref {fig:levels} (here we take $G = G' = T$). Left: $T$ with vertices coloured by $\ell _G \bmod 2$ (blue $=$ even, orange $=$ odd). Middle: the even parity subgraph $E_{G,S}(G')$, induced on $\{0, 4, 5, 6\}$; only edges with both endpoints even appear. Right: the odd parity subgraph $O_{G,S}(G')$, induced on $\{1, 2, 3\}$; the highlighted triangle shows that $O_{G,S}(G')$ is not bipartite for this choice of $G'$}{figure.4}{}} -\@writefile{toc}{\contentsline {section}{\tocsection {}{4}{Even Level Graphs}}{4}{section.4}\protected@file@percent } -\newlabel{sec:even-level-graphs}{{4}{4}{Even Level Graphs}{section.4}{}} -\newlabel{def:even-level-graph}{{4.1}{4}{Even Level Graph}{theorem.4.1}{}} -\newlabel{thm:even-level-4colorable}{{4.2}{4}{}{theorem.4.2}{}} +\@writefile{toc}{\contentsline {section}{\tocsection {}{4}{Even Level Graphs}}{5}{section.4}\protected@file@percent } +\newlabel{sec:even-level-graphs}{{4}{5}{Even Level Graphs}{section.4}{}} +\newlabel{def:even-level-graph}{{4.1}{5}{Even Level Graph}{theorem.4.1}{}} +\newlabel{thm:even-level-4colorable}{{4.2}{5}{}{theorem.4.2}{}} \@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{Enumeration for small $n$}}{5}{section*.1}\protected@file@percent } -\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Even Level Graph counts for $4 \leq n \leq 11$. The \emph {triangulations} column is the number of plane-triangulation iso classes (OEIS A000109). \emph {ELG iso classes} counts pairs $(G, S)$ up to isomorphism; \emph {flag-rooted ELGs} is the automorphism-free count $\DOTSB \sum@ \slimits@ _G \genfrac {}{}{}1{4E}{|\mathrm {Aut}(G)|}\,s(G)$.}}{5}{table.1}\protected@file@percent } -\newlabel{tab:elg-counts}{{1}{5}{Even Level Graph counts for $4 \leq n \leq 11$. The \emph {triangulations} column is the number of plane-triangulation iso classes (OEIS A000109). \emph {ELG iso classes} counts pairs $(G, S)$ up to isomorphism; \emph {flag-rooted ELGs} is the automorphism-free count $\sum _G \tfrac {4E}{|\mathrm {Aut}(G)|}\,s(G)$}{table.1}{}} \newlabel{def:derived-level-graph}{{4.3}{5}{Derived level graph}{theorem.4.3}{}} -\citation{holton-mckay} -\newlabel{def:bridge-switch}{{4.4}{6}{Bridge switch}{theorem.4.4}{}} +\newlabel{def:bridge-switch}{{4.4}{5}{Bridge switch}{theorem.4.4}{}} +\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Even Level Graph counts for $4 \leq n \leq 11$. The \emph {triangulations} column is the number of plane-triangulation iso classes (OEIS A000109). \emph {ELG iso classes} counts pairs $(G, S)$ up to isomorphism; \emph {flag-rooted ELGs} is the automorphism-free count $\DOTSB \sum@ \slimits@ _G \genfrac {}{}{}1{4E}{|\mathrm {Aut}(G)|}\,s(G)$.}}{6}{table.1}\protected@file@percent } +\newlabel{tab:elg-counts}{{1}{6}{Even Level Graph counts for $4 \leq n \leq 11$. The \emph {triangulations} column is the number of plane-triangulation iso classes (OEIS A000109). \emph {ELG iso classes} counts pairs $(G, S)$ up to isomorphism; \emph {flag-rooted ELGs} is the automorphism-free count $\sum _G \tfrac {4E}{|\mathrm {Aut}(G)|}\,s(G)$}{table.1}{}} \newlabel{def:bridge-derived-level-graph}{{4.5}{6}{Bridge-derived level graph}{theorem.4.5}{}} \newlabel{def:intertwining-tree}{{4.6}{6}{Intertwining tree}{theorem.4.6}{}} \newlabel{thm:intertwining-iff-hamiltonian-dual}{{4.7}{6}{}{theorem.4.7}{}} -\newlabel{conj:every-triangulation-derived}{{4.8}{6}{}{theorem.4.8}{}} +\citation{holton-mckay} +\citation{holton-mckay} +\newlabel{conj:every-triangulation-derived}{{4.8}{7}{}{theorem.4.8}{}} +\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{The boundary case $n = 21$}}{7}{section*.2}\protected@file@percent } +\@writefile{toc}{\contentsline {subsection}{\tocsubsection {}{}{The cyclically-$5$-connected case: $n = 24$}}{7}{section*.3}\protected@file@percent } +\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces The six Holton--McKay duals at $n = 21$, the first triangulations that are not intertwining trees. Each is a bridge-derived level graph: duals $1$ and $2$ are Even Level Graphs outright (zero switches), and the remaining four reach an Even Level Graph in $1$--$4$ bridge switches. All witnesses are step-verified.}}{8}{table.2}\protected@file@percent } +\newlabel{tab:n21}{{2}{8}{The six Holton--McKay duals at $n = 21$, the first triangulations that are not intertwining trees. Each is a bridge-derived level graph: duals $1$ and $2$ are Even Level Graphs outright (zero switches), and the remaining four reach an Even Level Graph in $1$--$4$ bridge switches. All witnesses are step-verified}{table.2}{}} +\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces The six Holton--McKay duals, drawn as crossing-free planar graphs and coloured by parity (blue even, orange odd, with respect to the fixed level-parity labelling). The solid green edges are the bridge edges introduced by the bridge switches from each dual's witness Even Level Graph. Each green edge is a bridge of its parity subgraph, so no new cycle -- and in particular no odd cycle -- is created; duals $1$ and $2$ coincide with their Even Level Graphs and have no added edge.}}{8}{figure.5}\protected@file@percent } +\newlabel{fig:n21-duals}{{5}{8}{The six Holton--McKay duals, drawn as crossing-free planar graphs and coloured by parity (blue even, orange odd, with respect to the fixed level-parity labelling). The solid green edges are the bridge edges introduced by the bridge switches from each dual's witness Even Level Graph. Each green edge is a bridge of its parity subgraph, so no new cycle -- and in particular no odd cycle -- is created; duals $1$ and $2$ coincide with their Even Level Graphs and have no added edge}{figure.5}{}} \bibcite{holton-mckay}{1} \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$}}{7}{section*.2}\protected@file@percent } -\@writefile{toc}{\contentsline {section}{\tocsection {}{}{References}}{7}{section*.3}\protected@file@percent } -\@writefile{lot}{\contentsline {table}{\numberline {2}{\ignorespaces The six Holton--McKay duals at $n = 21$, the first triangulations that are not intertwining trees. Each is a bridge-derived level graph: duals $1$ and $2$ are Even Level Graphs outright (zero switches), and the remaining four reach an Even Level Graph in $1$--$4$ bridge switches. All witnesses are step-verified.}}{8}{table.2}\protected@file@percent } -\newlabel{tab:n21}{{2}{8}{The six Holton--McKay duals at $n = 21$, the first triangulations that are not intertwining trees. Each is a bridge-derived level graph: duals $1$ and $2$ are Even Level Graphs outright (zero switches), and the remaining four reach an Even Level Graph in $1$--$4$ bridge switches. All witnesses are step-verified}{table.2}{}} -\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces The six Holton--McKay duals, drawn as crossing-free planar graphs and coloured by parity (blue even, orange odd, with respect to the fixed level-parity labelling). The solid green edges are the bridge edges introduced by the bridge switches from each dual's witness Even Level Graph. Each green edge is a bridge of its parity subgraph, so no new cycle -- and in particular no odd cycle -- is created; duals $1$ and $2$ coincide with their Even Level Graphs and have no added edge.}}{8}{figure.5}\protected@file@percent } -\newlabel{fig:n21-duals}{{5}{8}{The six Holton--McKay duals, drawn as crossing-free planar graphs and coloured by parity (blue even, orange odd, with respect to the fixed level-parity labelling). The solid green edges are the bridge edges introduced by the bridge switches from each dual's witness Even Level Graph. Each green edge is a bridge of its parity subgraph, so no new cycle -- and in particular no odd cycle -- is created; duals $1$ and $2$ coincide with their Even Level Graphs and have no added edge}{figure.5}{}} -\gdef \@abspage@last{8} +\@writefile{toc}{\contentsline {section}{\tocsection {}{}{References}}{9}{section*.4}\protected@file@percent } +\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces The $24$-vertex dual $T$ of the unique $44$-vertex non-Hamiltonian cyclically $5$-connected cubic planar graph (Holton--McKay Fig.\nonbreakingspace 2.10), drawn crossing-free and coloured by the fixed parity labelling (blue even, orange odd). $T$ is $5$-connected and not an intertwining tree, yet is a bridge-derived level graph: the two solid green edges $\{6,19\}$ and $\{20,22\}$ are the bridge edges introduced by the two bridge switches carrying its witness Even Level Graph (source $19$) to $T$. Each green edge is a bridge of its parity subgraph -- $\{6, 19\}$ in the even subgraph, $\{20,22\}$ in the odd -- so no new cycle, and in particular no odd cycle, is created.}}{10}{figure.6}\protected@file@percent } +\newlabel{fig:n24-dual}{{6}{10}{The $24$-vertex dual $T$ of the unique $44$-vertex non-Hamiltonian cyclically $5$-connected cubic planar graph (Holton--McKay Fig.~2.10), drawn crossing-free and coloured by the fixed parity labelling (blue even, orange odd). $T$ is $5$-connected and not an intertwining tree, yet is a bridge-derived level graph: the two solid green edges $\{6,19\}$ and $\{20,22\}$ are the bridge edges introduced by the two bridge switches carrying its witness Even Level Graph (source $19$) to $T$. Each green edge is a bridge of its parity subgraph -- $\{6, 19\}$ in the even subgraph, $\{20,22\}$ in the odd -- so no new cycle, and in particular no odd cycle, is created}{figure.6}{}} +\gdef \@abspage@last{10} diff --git a/papers/even_level_graph_generators/paper.fdb_latexmk b/papers/even_level_graph_generators/paper.fdb_latexmk index e603040..2b74724 100644 --- a/papers/even_level_graph_generators/paper.fdb_latexmk +++ b/papers/even_level_graph_generators/paper.fdb_latexmk @@ -1,6 +1,25 @@ # Fdb version 3 -["pdflatex"] 1779466997 "/Users/didericis/Code/math-research/papers/even_level_graph_generators/paper.tex" "paper.pdf" "paper" 1779466999 - "/Users/didericis/Code/math-research/papers/even_level_graph_generators/paper.tex" 1779466995 23442 551d7ef123af98c3c5f0ca2b7125c5d5 "" +["pdflatex"] 1779469001 "/Users/didericis/Code/math-research/papers/even_level_graph_generators/paper.tex" "paper.pdf" "paper" 1779469003 + "/Users/didericis/Code/math-research/papers/even_level_graph_generators/paper.tex" 1779468999 23834 39061385c4cc2522155026d2f8574bbd "" + "/usr/local/texlive/2022/texmf-dist/fonts/map/fontname/texfonts.map" 1577235249 3524 cb3e574dea2d1052e39280babc910dc8 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex7.tfm" 1246382020 1004 54797486969f23fa377b128694d548df "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex8.tfm" 1246382020 988 bdf658c3bfc2d96d3c8b02cfc1c94c20 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam10.tfm" 1246382020 916 f87d7c45f9c908e672703b83b72241a3 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam5.tfm" 1246382020 924 9904cf1d39e9767e7a3622f2a125a565 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam7.tfm" 1246382020 928 2dc8d444221b7a635bb58038579b861a "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm10.tfm" 1246382020 908 2921f8a10601f252058503cc6570e581 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm5.tfm" 1246382020 940 75ac932a52f80982a9f8ea75d03a34cf "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm7.tfm" 1246382020 940 228d6584342e91276bf566bcf9716b83 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmbx10.tfm" 1136768653 1328 c834bbb027764024c09d3d2bf908b5f0 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmcsc10.tfm" 1136768653 1300 63a6111ee6274895728663cf4b4e7e81 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmmi6.tfm" 1136768653 1512 f21f83efb36853c0b70002322c1ab3ad "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmmi8.tfm" 1136768653 1520 eccf95517727cb11801f4f1aee3a21b4 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmr6.tfm" 1136768653 1300 b62933e007d01cfd073f79b963c01526 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmr8.tfm" 1136768653 1292 21c1c5bfeaebccffdb478fd231a0997d "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmsy6.tfm" 1136768653 1116 933a60c408fc0a863a92debe84b2d294 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmsy8.tfm" 1136768653 1120 8b7d695260f3cff42e636090a8002094 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti10.tfm" 1136768653 1480 aa8e34af0eb6a2941b776984cf1dfdc4 "" + "/usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti8.tfm" 1136768653 1504 1747189e0441d1c18f3ea56fafc1c480 "" "/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx10.pfb" 1248133631 34811 78b52f49e893bcba91bd7581cdc144c0 "" "/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmcsc10.pfb" 1248133631 32001 6aeea3afe875097b1eb0da29acd61e28 "" "/usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmex10.pfb" 1248133631 30251 6afa5cb1d0204815a708a080681d4674 "" @@ -20,6 +39,7 @@ "/usr/local/texlive/2022/texmf-dist/tex/generic/bigintcalc/bigintcalc.sty" 1576625341 40635 c40361e206be584d448876bba8a64a3b "" "/usr/local/texlive/2022/texmf-dist/tex/generic/bitset/bitset.sty" 1576016050 33961 6b5c75130e435b2bfdb9f480a09a39f9 "" "/usr/local/texlive/2022/texmf-dist/tex/generic/etexcmds/etexcmds.sty" 1576625273 7734 b98cbb34c81f667027c1e3ebdbfce34b "" + "/usr/local/texlive/2022/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty" 1576625223 8371 9d55b8bd010bc717624922fb3477d92e "" "/usr/local/texlive/2022/texmf-dist/tex/generic/iftex/iftex.sty" 1644112042 7237 bdd120a32c8fdb4b433cf9ca2e7cd98a "" "/usr/local/texlive/2022/texmf-dist/tex/generic/infwarerr/infwarerr.sty" 1575499628 8356 7bbb2c2373aa810be568c29e333da8ed "" "/usr/local/texlive/2022/texmf-dist/tex/generic/intcalc/intcalc.sty" 1576625065 31769 002a487f55041f8e805cfbf6385ffd97 "" @@ -32,6 +52,7 @@ "/usr/local/texlive/2022/texmf-dist/tex/latex/amscls/amsart.cls" 1591045760 61881 a7369c346c2922a758ae6283cc1ed014 "" "/usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/amsfonts.sty" 1359763108 5949 3f3fd50a8cc94c3d4cbf4fc66cd3df1c "" "/usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/umsa.fd" 1359763108 961 6518c6525a34feb5e8250ffa91731cff "" + "/usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/umsb.fd" 1359763108 961 d02606146ba5601b5645f987c92e6193 "" "/usr/local/texlive/2022/texmf-dist/tex/latex/amsmath/amsbsy.sty" 1622667781 2222 da905dc1db75412efd2d8f67739f0596 "" "/usr/local/texlive/2022/texmf-dist/tex/latex/amsmath/amsgen.sty" 1622667781 4173 bc0410bcccdff806d6132d3c1ef35481 "" "/usr/local/texlive/2022/texmf-dist/tex/latex/amsmath/amsmath.sty" 1636758526 87648 07fbb6e9169e00cb2a2f40b31b2dbf3c "" @@ -52,15 +73,18 @@ "/usr/local/texlive/2022/texmf-dist/tex/latex/hycolor/hycolor.sty" 1580250785 17914 4c28a13fc3d975e6e81c9bea1d697276 "" "/usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/hpdftex.def" 1645564115 49029 7c9e5115b2217efbeb7828ac0d1bf1a0 "" "/usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/hyperref.sty" 1645564115 220999 6145ea83914c186e178d1d31c50b37df "" + "/usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/nameref.sty" 1612734870 13242 133e617c5eebffdd05e421624022b267 "" "/usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/pd1enc.def" 1645564115 14132 e8e7e61e51ade521a7238fac8362786c "" "/usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/puenc.def" 1645564115 117004 ed1c2cc82bb9836e9d59549dd8c33098 "" "/usr/local/texlive/2022/texmf-dist/tex/latex/kvoptions/kvoptions.sty" 1602274869 22521 d2fceb764a442a2001d257ef11db7618 "" "/usr/local/texlive/2022/texmf-dist/tex/latex/l3backend/l3backend-pdftex.def" 1644269979 29921 d0acc05a38bd4aa3af2017f0b7c137ce "" "/usr/local/texlive/2022/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg" 1279039959 678 4792914a8f45be57bb98413425e4c7af "" "/usr/local/texlive/2022/texmf-dist/tex/latex/letltxmacro/letltxmacro.sty" 1575499565 5766 13a9e8766c47f30327caf893ece86ac8 "" + "/usr/local/texlive/2022/texmf-dist/tex/latex/refcount/refcount.sty" 1576624809 9878 9e94e8fa600d95f9c7731bb21dfb67a4 "" "/usr/local/texlive/2022/texmf-dist/tex/latex/rerunfilecheck/rerunfilecheck.sty" 1575674187 9715 b051d5b493d9fe5f4bc251462d039e5f "" "/usr/local/texlive/2022/texmf-dist/tex/latex/url/url.sty" 1388531844 12796 8edb7d69a20b857904dd0ea757c14ec9 "" "/usr/local/texlive/2022/texmf-dist/web2c/texmf.cnf" 1646502317 40171 cdab547de63d26590bebb3baff566530 "" + "/usr/local/texlive/2022/texmf-var/fonts/map/pdftex/updmap/pdftex.map" 1647878959 4410336 7d30a02e9fa9a16d7d1f8d037ba69641 "" "/usr/local/texlive/2022/texmf-var/web2c/pdftex/pdflatex.fmt" 1665017617 2826443 7e98410c533054b636c6470db83a27bc "" "/usr/local/texlive/2022/texmf.cnf" 1647878952 577 209b46be99c9075fd74d4c0369380e8c "" "fig_edge_switch.png" 1779389598 123855 9cba07bb97424e0c4d80a584255b6e57 "" @@ -68,10 +92,11 @@ "fig_levels.png" 1779389598 88029 5564f46c0a183f3777727b651e7dc461 "" "fig_parity_subgraph.png" 1779389598 191771 f069aa94c8f49b3c7fd9c71426feff2d "" "figures/n21_duals.png" 1779463364 667947 fd52170c20399b0c2dff901831fad5d5 "" - "paper.aux" 1779466999 8486 a3527cbc146de3799e0a68e288b7304f "" - "paper.out" 1779466999 1088 cf07a31709ba02be3ba2bc89322768d0 "pdflatex" - "paper.tex" 1779466995 23442 551d7ef123af98c3c5f0ca2b7125c5d5 "" + "paper.aux" 1779469003 8486 a43934b41579f5535915f5341c4d1db7 "pdflatex" + "paper.out" 1779469003 1088 cf07a31709ba02be3ba2bc89322768d0 "pdflatex" + "paper.tex" 1779468999 23834 39061385c4cc2522155026d2f8574bbd "" (generated) + "paper.aux" "paper.log" "paper.out" "paper.pdf" diff --git a/papers/even_level_graph_generators/paper.fls b/papers/even_level_graph_generators/paper.fls index 2c1cef2..3669937 100644 --- a/papers/even_level_graph_generators/paper.fls +++ b/papers/even_level_graph_generators/paper.fls @@ -2,7 +2,7 @@ PWD /Users/didericis/Code/math-research/papers/even_level_graph_generators INPUT /usr/local/texlive/2022/texmf.cnf INPUT /usr/local/texlive/2022/texmf-dist/web2c/texmf.cnf INPUT /usr/local/texlive/2022/texmf-var/web2c/pdftex/pdflatex.fmt -INPUT paper.tex +INPUT /Users/didericis/Code/math-research/papers/even_level_graph_generators/paper.tex OUTPUT paper.log INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/amscls/amsart.cls INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/amscls/amsart.cls @@ -442,3 +442,149 @@ INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/l3backend/l3backend-pdftex.de INPUT ./paper.aux INPUT paper.aux INPUT paper.aux +OUTPUT paper.aux +INPUT /usr/local/texlive/2022/texmf-dist/fonts/map/fontname/texfonts.map +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmr8.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmr6.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmmi8.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmmi6.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmsy8.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmsy6.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex8.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex7.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex7.tfm +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/umsa.fd +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/umsa.fd +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/umsa.fd +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/umsa.fd +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam10.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam7.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam5.tfm +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/umsb.fd +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/umsb.fd +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/umsb.fd +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/amsfonts/umsb.fd +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm10.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm7.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm5.tfm +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/nameref.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/nameref.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/nameref.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/nameref.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/nameref.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/nameref.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/nameref.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/nameref.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/nameref.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/nameref.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/hyperref/nameref.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/refcount/refcount.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/refcount/refcount.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/refcount/refcount.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/refcount/refcount.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/refcount/refcount.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/refcount/refcount.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/refcount/refcount.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/refcount/refcount.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/refcount/refcount.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/refcount/refcount.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/refcount/refcount.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/ltxcmds/ltxcmds.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/infwarerr/infwarerr.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/gettitlestring/gettitlestring.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/kvoptions/kvoptions.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/generic/ltxcmds/ltxcmds.sty +INPUT ./paper.out +INPUT paper.out +INPUT ./paper.out +INPUT paper.out +INPUT ./paper.out +INPUT paper.out +INPUT ./paper.out +INPUT paper.out +OUTPUT paper.pdf +INPUT ./paper.out +INPUT ./paper.out +OUTPUT paper.out +INPUT /usr/local/texlive/2022/texmf-dist/tex/context/base/mkii/supp-pdf.mkii +INPUT /usr/local/texlive/2022/texmf-dist/tex/context/base/mkii/supp-pdf.mkii +INPUT /usr/local/texlive/2022/texmf-dist/tex/context/base/mkii/supp-pdf.mkii +INPUT /usr/local/texlive/2022/texmf-dist/tex/context/base/mkii/supp-pdf.mkii +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/epstopdf-pkg/epstopdf-base.sty +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg +INPUT /usr/local/texlive/2022/texmf-dist/tex/latex/latexconfig/epstopdf-sys.cfg +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmcsc10.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti8.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmbx10.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmcsc10.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/cmextra/cmex7.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam10.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msam7.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm10.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/amsfonts/symbols/msbm7.tfm +INPUT /usr/local/texlive/2022/texmf-dist/fonts/tfm/public/cm/cmti10.tfm +INPUT /usr/local/texlive/2022/texmf-var/fonts/map/pdftex/updmap/pdftex.map +INPUT ./fig_levels.png +INPUT ./fig_levels.png +INPUT fig_levels.png +INPUT ./fig_levels.png +INPUT ./fig_levels.png +INPUT ./fig_level_cycle.png +INPUT ./fig_level_cycle.png +INPUT fig_level_cycle.png +INPUT ./fig_level_cycle.png +INPUT ./fig_level_cycle.png +INPUT ./fig_edge_switch.png +INPUT ./fig_edge_switch.png +INPUT fig_edge_switch.png +INPUT ./fig_edge_switch.png +INPUT ./fig_edge_switch.png +INPUT ./fig_parity_subgraph.png +INPUT ./fig_parity_subgraph.png +INPUT fig_parity_subgraph.png +INPUT ./fig_parity_subgraph.png +INPUT ./fig_parity_subgraph.png +INPUT ./figures/n21_duals.png +INPUT ./figures/n21_duals.png +INPUT figures/n21_duals.png +INPUT ./figures/n21_duals.png +INPUT ./figures/n21_duals.png +INPUT paper.aux +INPUT ./paper.out +INPUT ./paper.out +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx10.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmcsc10.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmex10.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi10.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi7.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi8.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr10.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr7.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmr8.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy7.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti10.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmti8.pfb +INPUT /usr/local/texlive/2022/texmf-dist/fonts/type1/public/amsfonts/symbols/msam10.pfb diff --git a/papers/even_level_graph_generators/paper.log b/papers/even_level_graph_generators/paper.log index 8b5f030..5d934f5 100644 --- a/papers/even_level_graph_generators/paper.log +++ b/papers/even_level_graph_generators/paper.log @@ -1,4 +1,4 @@ -This is pdfTeX, Version 3.141592653-2.6-1.40.24 (TeX Live 2022) (preloaded format=pdflatex 2022.10.5) 22 MAY 2026 12:23 +This is pdfTeX, Version 3.141592653-2.6-1.40.24 (TeX Live 2022) (preloaded format=pdflatex 2022.10.5) 22 MAY 2026 13:04 entering extended mode restricted \write18 enabled. %&-line parsing enabled. @@ -354,58 +354,60 @@ File: epstopdf-sys.cfg 2010/07/13 v1.3 Configuration of (r)epstopdf for TeX Liv e )) [1{/usr/local/texlive/2022/texmf-var/fonts/map/pdftex/updmap/pdftex.map}] - + File: fig_levels.png Graphic file (type png) -Package pdftex.def Info: fig_levels.png used on input line 184. +Package pdftex.def Info: fig_levels.png used on input line 189. (pdftex.def) Requested size: 198.0011pt x 170.59666pt. LaTeX Warning: `h' float specifier changed to `ht'. - + File: fig_level_cycle.png Graphic file (type png) -Package pdftex.def Info: fig_level_cycle.png used on input line 198. +Package pdftex.def Info: fig_level_cycle.png used on input line 203. (pdftex.def) Requested size: 198.0011pt x 171.40878pt. LaTeX Warning: `h' float specifier changed to `ht'. - + File: fig_edge_switch.png Graphic file (type png) -Package pdftex.def Info: fig_edge_switch.png used on input line 217. +Package pdftex.def Info: fig_edge_switch.png used on input line 222. (pdftex.def) Requested size: 341.9989pt x 150.51671pt. LaTeX Warning: `h' float specifier changed to `ht'. - + File: fig_parity_subgraph.png Graphic file (type png) -Package pdftex.def Info: fig_parity_subgraph.png used on input line 235. +Package pdftex.def Info: fig_parity_subgraph.png used on input line 240. (pdftex.def) Requested size: 360.0pt x 106.9477pt. LaTeX Warning: `h' float specifier changed to `ht'. -[2] [3 <./fig_levels.png> <./fig_level_cycle.png>] [4 <./fig_edge_switch.png> < -./fig_parity_subgraph.png>] +[2] [3 <./fig_levels.png> <./fig_level_cycle.png>] +Underfull \vbox (badness 2277) has occurred while \output is active [] + + [4 <./fig_edge_switch.png> <./fig_parity_subgraph.png>] Package hyperref Warning: Token not allowed in a PDF string (Unicode): -(hyperref) removing `math shift' on input line 315. +(hyperref) removing `math shift' on input line 320. Package hyperref Warning: Token not allowed in a PDF string (Unicode): -(hyperref) removing `math shift' on input line 315. +(hyperref) removing `math shift' on input line 320. -Overfull \hbox (5.73714pt too wide) in paragraph at lines 327--331 +Overfull \hbox (5.73714pt too wide) in paragraph at lines 332--336 \OT1/cmr/m/n/10 where $\OML/cmm/m/it/10 s\OT1/cmr/m/n/10 (\OML/cmm/m/it/10 G\OT 1/cmr/m/n/10 )$ is the num-ber of valid sources of $\OML/cmm/m/it/10 G$\OT1/cmr /m/n/10 . The flag-rooting is the automorphism- [] -Underfull \hbox (badness 1112) in paragraph at lines 354--354 +Underfull \hbox (badness 1112) in paragraph at lines 359--359 \OT1/cmr/m/n/10 mor-phism; \OT1/cmr/m/it/10 flag-rooted ELGs \OT1/cmr/m/n/10 is the automorphism-free count [] @@ -413,29 +415,52 @@ Underfull \hbox (badness 1112) in paragraph at lines 354--354 [5] [6] Package hyperref Warning: Token not allowed in a PDF string (Unicode): -(hyperref) removing `math shift' on input line 460. +(hyperref) removing `math shift' on input line 465. Package hyperref Warning: Token not allowed in a PDF string (Unicode): -(hyperref) removing `math shift' on input line 460. +(hyperref) removing `math shift' on input line 465. - + File: figures/n21_duals.png Graphic file (type png) -Package pdftex.def Info: figures/n21_duals.png used on input line 520. +Package pdftex.def Info: figures/n21_duals.png used on input line 525. (pdftex.def) Requested size: 360.0pt x 227.35617pt. -[7] [8 <./figures/n21_duals.png>] (./paper.aux) + +Package hyperref Warning: Token not allowed in a PDF string (Unicode): +(hyperref) removing `math shift' on input line 538. + + +Package hyperref Warning: Token not allowed in a PDF string (Unicode): +(hyperref) removing `math shift' on input line 538. + + +Package hyperref Warning: Token not allowed in a PDF string (Unicode): +(hyperref) removing `math shift' on input line 538. + + +Package hyperref Warning: Token not allowed in a PDF string (Unicode): +(hyperref) removing `math shift' on input line 538. + +[7] [8 <./figures/n21_duals.png>] + +File: figures/fig210_dual.png Graphic file (type png) + +Package pdftex.def Info: figures/fig210_dual.png used on input line 587. +(pdftex.def) Requested size: 251.9989pt x 251.99767pt. + [9] [10 <./figures/fig210_dual.png>] +(./paper.aux) Package rerunfilecheck Info: File `paper.out' has not changed. -(rerunfilecheck) Checksum: CF07A31709BA02BE3BA2BC89322768D0;1088. +(rerunfilecheck) Checksum: A0B582009EF9672D6DFFA8A6FC189E33;1351. ) Here is how much of TeX's memory you used: - 9758 strings out of 478268 - 151077 string characters out of 5846347 - 455062 words of memory out of 5000000 - 27656 multiletter control sequences out of 15000+600000 - 475666 words of font info for 53 fonts, out of 8000000 for 9000 + 9774 strings out of 478268 + 151348 string characters out of 5846347 + 455738 words of memory out of 5000000 + 27666 multiletter control sequences out of 15000+600000 + 475834 words of font info for 54 fonts, out of 8000000 for 9000 1302 hyphenation exceptions out of 8191 - 69i,9n,76p,781b,434s stack positions out of 10000i,1000n,20000p,200000b,200000s + 69i,9n,76p,822b,533s stack positions out of 10000i,1000n,20000p,200000b,200000s @@ -449,11 +474,12 @@ exlive/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb> -Output written on paper.pdf (8 pages, 1098280 bytes). +/2022/texmf-dist/fonts/type1/public/amsfonts/cm/cmtt10.pfb> +Output written on paper.pdf (10 pages, 1234426 bytes). PDF statistics: - 205 PDF objects out of 1000 (max. 8388607) - 155 compressed objects within 2 object streams - 38 named destinations out of 1000 (max. 500000) - 82 words of extra memory for PDF output out of 10000 (max. 10000000) + 226 PDF objects out of 1000 (max. 8388607) + 170 compressed objects within 2 object streams + 42 named destinations out of 1000 (max. 500000) + 95 words of extra memory for PDF output out of 10000 (max. 10000000) diff --git a/papers/even_level_graph_generators/paper.out b/papers/even_level_graph_generators/paper.out index f40ec5d..f88139b 100644 --- a/papers/even_level_graph_generators/paper.out +++ b/papers/even_level_graph_generators/paper.out @@ -4,4 +4,5 @@ \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\000n\000u\000m\000e\000r\000a\000t\000i\000o\000n\000\040\000f\000o\000r\000\040\000s\000m\000a\000l\000l\000\040\000n}{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 +\BOOKMARK [2][-]{section*.3}{\376\377\000T\000h\000e\000\040\000c\000y\000c\000l\000i\000c\000a\000l\000l\000y\000-\0005\000-\000c\000o\000n\000n\000e\000c\000t\000e\000d\000\040\000c\000a\000s\000e\000:\000\040\000n\000\040\000=\000\040\0002\0004}{section.4}% 7 +\BOOKMARK [1][-]{section*.4}{\376\377\000R\000e\000f\000e\000r\000e\000n\000c\000e\000s}{}% 8 diff --git a/papers/even_level_graph_generators/paper.pdf b/papers/even_level_graph_generators/paper.pdf index 9ba0990..566baaa 100644 Binary files a/papers/even_level_graph_generators/paper.pdf and b/papers/even_level_graph_generators/paper.pdf differ diff --git a/papers/even_level_graph_generators/paper.tex b/papers/even_level_graph_generators/paper.tex index 04f8a3e..d973c44 100644 --- a/papers/even_level_graph_generators/paper.tex +++ b/papers/even_level_graph_generators/paper.tex @@ -101,7 +101,12 @@ Hamiltonian, so every triangulation on at most $20$ vertices is an intertwining tree and the first possible failures occur at $n = 21$, at the six duals of the Holton--McKay graphs. We verify that all six are bridge-derived level graphs, confirming the conjecture in its first -nontrivial case. +nontrivial case. Pushing further, we identify by exhaustive generation +the unique $44$-vertex non-Hamiltonian \emph{cyclically $5$-connected} +cubic planar graph -- settling a uniqueness question Holton--McKay left +open -- whose $24$-vertex $5$-connected dual is the first test of the +conjecture outside the $3$-cut family; it too is a bridge-derived level +graph, two bridge switches from an Even Level Graph. \end{abstract} \maketitle @@ -528,6 +533,71 @@ with their Even Level Graphs and have no added edge.} \label{fig:n21-duals} \end{figure} +\subsection*{The cyclically-$5$-connected case: $n = 24$} + +The six $n = 21$ duals all carry non-trivial $3$-cuts in the cubic +picture; dually, each contains a separating triangle, so each is built +from smaller pieces and lies in the most reducible part of the +non-Hamiltonian world. (The famous $46$-vertex Tutte graph is no +improvement here: it too is only cyclically $3$-connected, and its +$25$-vertex dual has separating triangles.) The genuinely new regime is +the \emph{cyclically $5$-connected} one, dual to a $5$-connected +triangulation -- no separating $3$- or $4$-cycle, hence nothing to +decompose along. By Holton--McKay, the smallest non-Hamiltonian +cyclically $5$-connected cubic planar graph has $44$ vertices (Fig.~2.10 +of~\cite{holton-mckay}, attributed to Tutte; minimality due to +Faulkner--Younger), and its dual is a $24$-vertex $5$-connected +triangulation. + +We obtain this graph by generation rather than transcription. A +$44$-vertex cubic planar graph is the dual of a $24$-vertex +triangulation, and a cubic graph is cyclically $5$-connected if and only +if its dual triangulation is $5$-connected. Enumerating all $5$-connected +triangulations on $24$ vertices (\texttt{plantri -c5}, $6833$ of them) +and testing each dual for Hamiltonicity, we find that \emph{exactly one} +has a non-Hamiltonian dual. This both produces the graph and, granting +the correctness of the generator and the Hamiltonicity test, settles the +uniqueness question Holton--McKay left open: there is a unique +non-Hamiltonian cyclically $5$-connected cubic planar graph on $44$ +vertices. + +Let $T$ be its dual: a $24$-vertex triangulation with vertex connectivity +$5$ and no separating triangle, and -- since its dual is non-Hamiltonian +-- not an intertwining tree. We find that $T$ is nonetheless a +bridge-derived level graph. Of its $333$ valid parity partitions most are +useless: their backward bridge-orbits exceed $8 \times 10^5$ states with +no Even Level Graph in sight. But one partition has a backward orbit of +only $4678$ states containing an Even Level Graph (source $s = 19$, +maximum level $4$) at depth $2$. The two bridge switches carrying that +Even Level Graph to $T$ are +\[ + \text{remove } \{16,21\},\ \text{add } \{20,22\} + \quad\text{and}\quad + \text{remove } \{15,18\},\ \text{add } \{6,19\}, +\] +each adding a same-parity edge that is a bridge of the (odd, resp.\ even) +parity subgraph; both steps have been verified to be valid bridge +switches. So the disjunction holds for $T$ through the bridge-derived +disjunct, and the ``one good partition suffices'' phenomenon seen at +$n = 21$ persists into the cyclically $5$-connected regime -- the first +test of the conjecture genuinely outside the $3$-cut family. + +\begin{figure}[ht] +\centering +\includegraphics[width=0.7\textwidth]{figures/fig210_dual.png} +\caption{The $24$-vertex dual $T$ of the unique $44$-vertex +non-Hamiltonian cyclically $5$-connected cubic planar graph +(Holton--McKay Fig.~2.10), drawn crossing-free and coloured by the fixed +parity labelling (blue even, orange odd). $T$ is $5$-connected and not an +intertwining tree, yet is a bridge-derived level graph: the two solid +green edges $\{6,19\}$ and $\{20,22\}$ are the bridge edges introduced by +the two bridge switches carrying its witness Even Level Graph (source +$19$) to $T$. Each green edge is a bridge of its parity subgraph -- $\{6, +19\}$ in the even subgraph, $\{20,22\}$ in the odd -- so no new cycle, and +in particular no odd cycle, is created.} +\label{fig:n24-dual} +\end{figure} + \begin{thebibliography}{9} \bibitem{holton-mckay}