Source package for a preprint auditing two claimed proof mechanisms for Frankl's union-closed sets conjecture and recording structural reductions for minimum counterexamples.
The paper does not claim a proof of Frankl's conjecture. It gives explicit finite counterexamples to two proposed proof mechanisms, plus independently checkable structural lemmas for the minimum-counterexample route.
frankl-conjecture-audit.tex- top-level paper sourcefrankl-conjecture-audit.bbl- generated bibliography used for source-package buildsreferences.bib- bibliography databaseanc/verify_counterexamples.py- standard-library Python verifier for the A2 and Schrader counterexamples00README- source build descriptorLICENSE- Creative Commons Attribution 4.0 International
pdflatex frankl-conjecture-audit.tex
bibtex frankl-conjecture-audit
pdflatex frankl-conjecture-audit.tex
pdflatex frankl-conjecture-audit.tex
python3 anc/verify_counterexamples.py --trace --exhaustiveAuthor: Nelson Daniel Spence, Project Navi.