didericis
b526d204ff
UPDATED: birkhoff_internally_6_connected.tex now adds the distinction
between "internally 6-connected" (= cyclic edge conn ≥ 6 in dual)
and the framework's needed condition (= cyclic edge conn EXACTLY 6,
so 6-edge cuts exist). Notes that this is a real a priori
restriction not provided by Birkhoff alone.
NEW NOTE: even_separating_cycle.tex (3 pages)
Addresses: "must a min 4CT counterexample have a separating n-cycle
with n even and n ≥ 6?"
Honest answer: I don't know of a proof either way.
Key contributions:
- Lemma (cut-parity in cubic graphs): |C| ≡ |S| ≡ |T| (mod 2).
So even-length cycles in primal G ↔ cuts with even-sized sides
in dual G^*.
- |V(G^*)| = 2|V(G)| - 4 is always even, so both sides have
matching parity.
- Birkhoff doesn't rule out odd-length separating cycles ≥ 7.
- Second-link heuristic: in internally 6-conn triangulations,
the "second link" of any vertex is typically a 6-cycle, giving
abundant separating 6-cycles in practice. But this is
heuristic, not proven for all such triangulations.
Conjecture (stated, not proven): every internally 6-conn planar
triangulation with ≥ 12 vertices has a separating even n-cycle
with n ≥ 6.
Equivalent: every planar cubic graph with cyclic edge connectivity
≥ 6 and ≥ 20 vertices has a cyclic edge cut of size exactly 6.
This is a structural question; I don't know a planar cubic
counterexample.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
math-research
Personal mathematics research repository by Eric Bauerfeld. Papers are written in AMS-LaTeX using the amsart document class.
Papers
kempe_style_search_for_smaller_contradiction
Humans Suffice: A Novel Proof of the Four Color Theorem
An in-progress proof of the Four Color Theorem via a minimal counterexample argument. The paper builds on Kempe's 1879 strategy — establishing valid cases for vertices of degree ≤ 4, then extending the argument to the degree-5 case using properties of non-adjacent degree-5 vertices, merged subgraphs, and locked colorings.
plane_depth_labelling
Plane Depth Labelling
Early-stage paper. Title and author information set; content in progress.
Creating a New Paper
Use run.sh to scaffold a new paper from the AMS-LaTeX template:
./run.sh init_paper "Your Paper Title"
This creates a new directory (name derived from the title) containing a paper.tex pre-filled with the title and author.
Setup
The Python library code in lib/ requires SageMath. Run setup once per machine:
./run.sh setup <sage_python_path> <sage_site_packages> [system_name]
sage_python_path— path to the SageMath Python interpreter (e.g./opt/sage/local/bin/python3)sage_site_packages— path to SageMath's site-packages directorysystem_name— optional label for this machine (defaults tohostname -s); used to store per-machine env files as.env.<system_name>
On subsequent runs the paths default to whatever was saved in .env, so ./run.sh setup alone re-runs setup with the existing configuration.
Setup also compiles the plantri submodule via make.
Running Sage
To run a Sage script with plantri available on PATH:
./run.sh sage <script.py> [args...]
Or to open an interactive Sage session:
./run.sh sage
Linting
./run.sh lint
Runs pyright and pylint on lib/ using the SageMath Python interpreter.
Shell Completion
To enable tab-completion for run.sh in zsh, add this to your .zshrc:
eval "$(path/to/run.sh completion)"
Or source it once in the current shell session:
eval "$(./run.sh completion)"
Building
Papers are compiled with LaTeX. From within a paper directory:
latexmk -pdf paper.tex