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). As for Lemma 2: GG a fixed graph, ν=ν(G)\nu=\nu(G), B\mathscr B a fixed independent family of ν\nu triangles, E[⋅]E[\cdot] the edges of the triangles of a family, B1\mathscr B_1 with ∣B1∣=γν|\mathscr B_1|=\gamma\nu, the graph G′G' obtained by deleting E[B1]E[\mathscr B_1], and B2\mathscr B_2 with ∣B2∣=βν|\mathscr B_2|=\beta\nu. On p. 253: let B′\mathscr B' be an independent family of triangles in G′G' of maximum size subject to ∣E[B′]∖E[B]∣≥βν|E[\mathscr B']\setminus E[\mathscr B]|\ge\beta\nu (such a family exists because of B2\mathscr B_2), so that ∣B′∣≤ν(1−γ)|\mathscr B'|\le\nu(1-\gamma). Let S\mathscr S be the set of triangles TT that have exactly one edge in common with E[B′]E[\mathscr B'], that edge lying in E[B′]∖E[B]E[\mathscr B']\setminus E[\mathscr B]. Let B1′\mathscr B_1' be an independent subset of S\mathscr S of maximum size, and define δ\delta by ∣B1′∣=δν|\mathscr B_1'|=\delta\nu. The definition of S\mathscr S does not name the graph; the proofs of Lemmas 3 and 4 use it for triangles of G′G'.

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

Proof sketch

Proof on p. 253. Run the construction of Lemma 1 inside G′G', with B′\mathscr B' in place of B\mathscr B and B1′\mathscr B_1' in place of B1\mathscr B_1. The new point is that a triangle of B′\mathscr B' paired with T1∈B1′T_1\in\mathscr B_1' has the shared edge as its only edge outside E[B]E[\mathscr B], since otherwise it would be a type-(B,1)(\mathscr B,1) triangle, and G′G' has none; so swapping members of pairs keeps the constraint ∣E[⋅]∖E[B]∣≥βν|E[\cdot]\setminus E[\mathscr B]|\ge\beta\nu, and the maximality of B′\mathscr B' applies as before. This gives a transversal of G′G' with at most 3∣B′∣−δν3|\mathscr B'|-\delta\nu edges; adding E[B1]E[\mathscr B_1], of size 3γν3\gamma\nu, gives a transversal of GG of size at most (3−δ)ν(3-\delta)\nu.

Dependencies

Lemma 1's construction, rerun 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); it is also one of the four lemmas that the 2026 preprint of Yi restates for its claimed constant 6322\frac{63}{22} (Corollary 1). It settles nothing the problem page leaves open.