Erdős–Gallai–Tuza triangle independence-covering problem

For a graph GG, let α1(G)\alpha_1(G) be the maximum cardinality of an edge set FE(G)F\subseteq E(G) such that FE(T)1|F\cap E(T)|\le 1 for every triangle TT of GG, and let τ1(G)\tau_1(G) be the minimum cardinality of an edge set FE(G)F\subseteq E(G) such that FE(T)F\cap E(T)\ne\varnothing for every triangle TT of GG. Determine the optimal asymptotic constant governing α1(G)+τ1(G)\alpha_1(G)+\tau_1(G) over graphs with mm edges; equivalently, determine the value and existence of limmminE(G)=mα1(G)+τ1(G)m2/3\lim_{m\to\infty}\min_{|E(G)|=m}\frac{\alpha_1(G)+\tau_1(G)}{m^{2/3}}.

Progress summary

Solved

A new unrefereed preprint claims to give the exact long-term constant, but the result has not yet been independently checked.

Erdős, Gallai, and Tuza asked for the optimal asymptotic constant governing triangle independence and covering numbers in an mm-edge graph. Earlier work concerned a related nn-vertex inequality rather than this sharp-constant problem.

Known results

  • Puleo (2015) reduced the related unrestricted nn-vertex conjecture to triangular graphs by showing that a vertex-minimal counterexample has minimum degree greater than n/2n/2.
  • Earlier work established α1(G)+τ1(G)=Ω(m2/3)\alpha_1(G)+\tau_1(G)=\Omega(m^{2/3}) and studied the distinct bound α1(G)+τ1(G)5n2/16\alpha_1(G)+\tau_1(G)\leq 5n^2/16.

August 2026 claimed exact constant

Liu and Zeng’s arXiv preprint claims $$\lim_{m\to\infty}\min_{|E(G)|=m}\frac{\alpha_1(G)+\tau_1(G)}{m^{2/3}}=\frac{3}{2}.\nItgivesmatchingboundsuptoorder\nIt gives matching bounds up to order m^{1/3}$ and an extremal construction, but the result is unrefereed and no independent verification or objection report was found.

Current status (as of August 2026): the sharp constant 3/23/2 is claimed in a new preprint, but its correctness has not yet been independently verified.

Sources
Sources & referencesView supporting material

Primary source

arXiv

Additional references

Solutions 0

No solutions have been posted yet.