Packing and covering triangles in the complete graph ${\displaystyle K_{5}}$. The maximum number of edge-disjoint triangles in this graph is two (left). If four edges are removed from the graph (red edges, right), the remaining subgraph becomes triangle-free, and more strongly bipartite (as shown by the blue and yellow vertex coloring). According to Tuza's conjecture, in any graph, it is possible to remove twice as many edges as the maximum triangle packing size, and eliminate all triangles. ${\displaystyle K_{5}}$ is an extreme case, for which exactly twice the packing size is needed.

Tuza's conjecture is an unsolved problem in graph theory, a branch of mathematics, concerning triangles in undirected graphs.

Statement

In any graph ${\displaystyle G}$, one can define two quantities ${\displaystyle \nu (G)}$ and ${\displaystyle \tau (G)}$ based on the triangles in ${\displaystyle G}$. The quantity ${\displaystyle \nu (G)}$ is the "triangle packing number", the largest number of edge-disjoint triangles that it is possible to find in ${\displaystyle G}$.^[1] It can be computed in polynomial time as a special case of the matroid parity problem.^[2] The quantity ${\displaystyle \tau (G)}$ is the size of the smallest "triangle-hitting set", a set of edges that touches at least one edge from each triangle.^[1]

Clearly, ${\displaystyle \nu (G)\leq \tau (G)\leq 3\nu (G)}$. For the first inequality, ${\displaystyle \nu (G)\leq \tau (G)}$, any triangle-hitting set must include at least one edge from each triangle of the optimal packing, and none of these edges can be shared between two or more of these triangles because the triangles are disjoint. For the second inequality, ${\displaystyle \tau (G)\leq 3\nu (G)}$, one can construct a triangle-hitting set of size ${\displaystyle 3\nu (G)}$ by choosing all edges of the triangles of an optimal packing. This must hit all triangles in ${\displaystyle G}$, even the ones not in the packing, because otherwise the packing could be made larger by adding any unhit triangle.^[1]

Tuza's conjecture asserts that the second inequality is not tight, and can be replaced by ${\displaystyle \tau (G)\leq 2\nu (G)}$. That is, according to this unproven conjecture, every undirected graph ${\displaystyle G}$ has a triangle-hitting set whose size is at most twice the number of triangles in an optimal packing.^[1]

History and partial results

Zsolt Tuza formulated Tuza's conjecture in 1981.^[1][3] If true, it would be best possible: there are infinitely many graphs for which ${\displaystyle \tau (G)=2\nu (G)}$, including all of the block graphs whose blocks are cliques of 2, 4, or 5 vertices.^[1]

The conjecture is known to hold for planar graphs,^[1] and more generally for sparse graphs of degeneracy at most six.^[4] (Planar graphs have degeneracy at most five.) It is also known to hold for graphs of treewidth at most six,^[5] for threshold graphs,^[6] for sufficiently dense graphs, and for chordal graphs that contain a large clique.^[1] For random graphs in the Erdős–Rényi–Gilbert model, it is true with high probability.^[7]

Although Tuza's conjecture remains unproven, the bound ${\displaystyle \tau (G)\leq 3\nu (G)}$ can be improved, for all graphs, to ${\displaystyle \tau (G)\leq (3-{\tfrac {3}{23}})\nu (G)\approx 2.8695\nu (G)}$.^[8]

See also

• Mantel's theorem
• Triangle removal lemma

References

External links

• van der Pol, Jorn (March 6, 2023), "Triangles, arcs, and ovals", The Matroid Union