Wiki
Wiki

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 B\mathscr B, B1\mathscr B_1, B2\mathscr B_2, B′\mathscr B', S\mathscr S and B1′\mathscr B_1', the graph G′G' and the parameters γ\gamma, β\beta, δ\delta with ∣B1∣=γν|\mathscr B_1|=\gamma\nu, ∣B2∣=βν|\mathscr B_2|=\beta\nu and ∣B1′∣=δν|\mathscr B_1'|=\delta\nu, as defined for Lemma 3, with ν=ν(G)\nu=\nu(G) for the fixed graph GG.

Lemma 4 (p. 253, quoted). "We have τ(G)≤(3+3δ−β)ν\tau(G)\le(3+3\delta-\beta)\nu."

Proof sketch

Proof on pp. 253--254. Take the edges of B1\mathscr B_1 and of B1′\mathscr B_1' together with the edges common to E[B]E[\mathscr B] and E[B′]E[\mathscr B']; the last set has at most 3∣B′∣−βν3|\mathscr B'|-\beta\nu edges, which gives the count. Since B′\mathscr B' is maximal in G′G', every triangle of G′G' meets E[B′]E[\mathscr B']. A triangle of G′G' that misses the common edges cannot have two or three edges in E[B′]∖E[B]E[\mathscr B']\setminus E[\mathscr B]: two would make it a type-(B,1)(\mathscr B,1) triangle, absent from G′G', and three would make it disjoint from B\mathscr B. So it lies in S\mathscr S and, by maximality of B1′\mathscr B_1', meets E[B1′]E[\mathscr B_1'].

Dependencies

None outside the paper: the maximality of B′\mathscr B' and B1′\mathscr B_1' and the absence of type-(B,1)(\mathscr B,1) triangles in G′G'.

Bears on

  • Problem 167: one of the four inequalities whose weighted sum proves Theorem 5, τ(G)≤6623ν(G)\tau(G)\le\frac{66}{23}\nu(G), toward Tuza's conjecture τ(G)≤2ν(G)\tau(G)\le2\nu(G). The paper's closing remark (p. 254) proposes replacing its 3δ3\delta term by (3−ε)δ(3-\varepsilon)\delta through induction, with no printed proof; the 2026 preprint of Yi replaces the bound 3∣B1′∣3|\mathscr B_1'| for covering S\mathscr S by 114∣B1′∣\frac{11}4|\mathscr B_1'| for its claimed constant 6322\frac{63}{22} (Corollary 1). It settles nothing the problem page leaves open.