Lean 4 formalization of the corrected Erdős Problem 796, proving the second-order asymptotic and explicit kernel-checked bounds.
Proof for the off-diagonal commonality region of cycles of length 2k and 2m+1
Computer-assisted proofs and clean-room audits for the r=10 and r=11 fixed cases of Erdős Problem 617.
Tuza's conjecture for graphs of maximum degree at most seven — paper, certificate catalogue, and exact verifiers
Research notes, exact computations, and reproducible verification for MathOverflow 413935
Proof of the semi-inducibility of the alternating 4k+2 cycles.
Bounds, exact computations, barriers, and open problems for extremal Seidel quadratic forms on the Boolean cube.
Paper I: a finite, Lean-verified fractional clique-partition bound for split graphs. Part of an Erdős #81 research program; #81 remains open.
Lean 4 formalization and reproducibility artifacts for the exact saturated 6- and 7-Sperner numbers
Reproducible proofs of eight exact finite Zarankiewicz numbers, including a complete DRAT/LRAT and exact SCIP/VIPR certificate for Z(10,23,3,3)=112, plus Z(13,23,3,3)≤144.
Machine-checked progress on the Brualdi-Goldwasser (1984) Laplacian-ratio maximizer for trees (Lean 4 + Mathlib, no sorry) + Telperion, a sympy-to-Lean certificate pipeline
Add a description, image, and links to the extremal-combinatorics topic page so that developers can more easily learn about it.
To associate your repository with the extremal-combinatorics topic, visit your repo's landing page and select "manage topics."