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). As for Lemma 2: a fixed graph, , a fixed independent family of triangles, the edges of the triangles of a family, with , the graph obtained by deleting , and with . On p. 253: let be an independent family of triangles in of maximum size subject to (such a family exists because of ), so that . Let be the set of triangles that have exactly one edge in common with , that edge lying in . Let be an independent subset of of maximum size, and define by . The definition of does not name the graph; the proofs of Lemmas 3 and 4 use it for triangles of .
Lemma 3 (p. 253, quoted). "We have ."
Proof sketch
Proof on p. 253. Run the construction of Lemma 1 inside , with in place of and in place of . The new point is that a triangle of paired with has the shared edge as its only edge outside , since otherwise it would be a type- triangle, and has none; so swapping members of pairs keeps the constraint , and the maximality of applies as before. This gives a transversal of with at most edges; adding , of size , gives a transversal of of size at most .
Dependencies
Lemma 1's construction, rerun in .
Bears on
- Problem 167: one of the four inequalities whose weighted sum proves Theorem 5, , toward Tuza's conjecture ; it is also one of the four lemmas that the 2026 preprint of Yi restates for its claimed constant (Corollary 1). It settles nothing the problem page leaves open.