Erdős–Gallai–Tuza triangle independence-covering problem
Erdős–Gallai–Tuza triangle independence-covering problem
For a graph , let be the maximum cardinality of an edge set such that for every triangle of , and let be the minimum cardinality of an edge set such that for every triangle of . Determine the optimal asymptotic constant governing over graphs with edges; equivalently, determine the value and existence of .
Progress summary
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 -edge graph. Earlier work concerned a related -vertex inequality rather than this sharp-constant problem.
Known results
- Puleo (2015) reduced the related unrestricted -vertex conjecture to triangular graphs by showing that a vertex-minimal counterexample has minimum degree greater than .
- Earlier work established and studied the distinct bound .
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}.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 is claimed in a new preprint, but its correctness has not yet been independently verified.
Sources
Sources & referencesView supporting material
Primary source
Additional references
- Sharp asymptotics for triangle independence and covering numbers — arXiv — Zhen Liu, Qinghou Zeng
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.