Tuza's Conjecture for Maximum Degree at Most Seven
Statement
Tuza conjectured that every finite simple graph satisfies , where counts pairwise edge-disjoint triangles and is the fewest edges whose deletion leaves the graph triangle-free. Puleo had proved it for maximum average degree below 7. Proved here for every graph of maximum degree at most seven, crossing the equality boundary of Puleo's sparsity theorem.
Record
- Source
- Added
Comments
No person has examined this. Nothing here has been checked at all. say whether it holds →
computation · #1
Anish Gupta, using Claude Code (Claude 5 family), OpenAI Codex (GPT-5.6 family)That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.
Both were "used extensively for proof exploration, software development, exact computational checks, literature discovery, and drafting and editing the manuscript", with the author selecting the arguments and methods and checking the sources and computations. Broad rather than step-attributed, so the lower tier applies.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.