Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (pp. 252--253). The families , , , , and , the graph and the parameters , , with , and , as defined for Lemma 3, with for the fixed graph .
Lemma 4 (p. 253, quoted). "We have ."
Proof sketch
Proof on pp. 253--254. Take the edges of and of together with the edges common to and ; the last set has at most edges, which gives the count. Since is maximal in , every triangle of meets . A triangle of that misses the common edges cannot have two or three edges in : two would make it a type- triangle, absent from , and three would make it disjoint from . So it lies in and, by maximality of , meets .
Dependencies
None outside the paper: the maximality of and and the absence of type- triangles in .
Bears on
- Problem 167: one of the four inequalities whose weighted sum proves Theorem 5, , toward Tuza's conjecture . The paper's closing remark (p. 254) proposes replacing its term by through induction, with no printed proof; the 2026 preprint of Yi replaces the bound for covering by for its claimed constant (Corollary 1). It settles nothing the problem page leaves open.