Tuza's conjecture for graphs of maximum degree at most seven — paper, certificate catalogue, and exact verifiers
-
Updated
Aug 10, 2026 - TeX
Tuza's conjecture for graphs of maximum degree at most seven — paper, certificate catalogue, and exact verifiers
Paper I: a finite, Lean-verified fractional clique-partition bound for split graphs. Part of an Erdős #81 research program; #81 remains open.
Add a description, image, and links to the triangle-packing topic page so that developers can more easily learn about it.
To associate your repository with the triangle-packing topic, visit your repo's landing page and select "manage topics."