---
title: Triangle-Covered Graphs in Extremal Theory
url: https://www.emergentmind.com/topics/triangle-covered-graph
type: topic
---

# Triangle-Covered Graphs in Extremal Theory

Searching arXiv for relevant papers on triangle-covered graphs and related triangle covering/packing notions.
Triangle-covered graph is a context-dependent term in graph theory rather than a single standardized definition. In recent edge-modification work, it denotes a graph in which **every vertex belongs to at least one triangle** [2509.11448]. In older local covering problems, closely related papers study graphs in which **every edge is contained in a triangle**, or more generally in a copy of $K_k$ [2409.11216; 1605.01816]. A different branch of the literature uses *triangle cover* for a set of edges or vertices meeting every triangle, and yet another uses *triangle clique cover* for collections of cliques that cover all $K_3$ subgraphs [1009.0353; 2005.07224; 1709.01590]. This suggests that the subject is best organized by the underlying covering relation: local edge coverage, local vertex coverage, global triangle transversals, and clique-based coverings.

## 1. Definitions and notation

The edge-transversal formulation studies sets that hit every triangle. For a graph $G$, the **triangle cover** in the edge sense is
$$
T_t(G)=\min\{|S|: S\subseteq E(G),\ G-S\text{ is triangle-free}\},
$$
and the **triangle packing** is
$$
v_t(G)=\max\{k:\text{there exist }k\text{ edge-disjoint triangles in }G\}.
$$
Equivalent notation also appears as $\tau_t(G)$ for the minimum edge cover and $\nu_t(G)$ for the maximum packing [1009.0353; 1605.01816].

A second, local notion concerns graphs in which every edge lies in a triangle. In [1605.01816], such graphs are called **irreducible**, meaning that every $e\in E$ lies in some triangle. In [2409.11216], this is treated as the $k=3$ case of a **$(k,1)$-cover**, where every edge lies in a copy of $K_k$.

A third notion is vertex-local. In [2509.11448], a graph $G$ is **triangle-covered** if **every vertex of $G$ belongs to at least one triangle**. The same paper defines a **$\Delta$-completion set** as a set of non-edges whose addition makes $G$ triangle-covered.

Further variants are standard in adjacent literatures. The **triangle covering number** $\tau_3(G)$ may denote the minimum number of vertices that hit all triangles [2005.07224]. A **triangle clique cover** is a set of cliques covering all triangles, with minimum size denoted $\theta_\triangle(G)=\theta_{K_3}(G)$ or $\mathcal{CC}_3(G)$ [1709.01590; 2506.10478]. The **triangle-degree** of a vertex is the number of triangles containing it [1901.09560]. A plausible implication is that claims about “triangle-covered graphs” cannot be transferred across papers without checking whether the coverage condition is on edges, vertices, or the family of all triangles.

## 2. Edge-local coverage: every edge in a triangle

The classical starting point is a question of Erdős from 1988: what is the minimum number of edges in a connected $n$-vertex graph where every edge is contained in a triangle? Catlin, Grossman, Hobbs, and Lai had already shown the stronger bound
$$
\#\text{edges}\ge \frac32(n-c)
$$
for graphs with $c$ components [2409.11216].

The exact modern formulation is for $(k,1)$-covers. If $k\ge 3$ and $G$ is a connected $n$-vertex graph in which every edge lies in a copy of $K_k$, write
$$
n-k=q(k-1)+r,\qquad q\ge 0,\quad 1\le r\le k-1.
$$
Then
$$
|E(G)|\ge (q+2)\binom{k}{2}-\binom{k-r}{2},
$$
with equality if and only if $G\in\mathcal{G}(qK_k,L)$, where $L$ is the union of two $K_k$s sharing $k-r$ vertices [2409.11216]. The extremal family is described through a **linear hypertree of cliques**, or equivalently a tree-like gluing scheme in which overlaps are kept as small as possible.

For triangles, this specializes to
$$
|E(G)|\ge 3(q+2)-\binom{3-r}{2},
$$
where $n-3=2q+r$ and $1\le r\le 2$ [2409.11216]. The extremal constructions are obtained by gluing triangles in a tree-like way. The same paper extends the problem to multiplicity constraints: for a connected graph in which every edge lies in at least two triangles, the sharp result is that the extremal graphs are precisely those with a $(4,1)$-cover. It also shows that this coincidence fails in general: for $\ell\ge 6$, the minimum for a $(3,\ell)$-cover is strictly less than for a $(\ell+2,1)$-cover [2409.11216].

This edge-local theory interacts directly with packing-covering questions. In [1605.01816], the irreducible condition is exactly the hypothesis needed for several algorithmic sufficient conditions toward Tuza’s conjecture.

## 3. Vertex-local coverage: every vertex in a triangle

Under the vertex-based definition, a triangle-covered graph is one in which every vertex belongs to at least one triangle [2509.11448]. This is a genuinely different requirement from edge-local coverage: an edge may fail to lie in any triangle even though both its endpoints do.

For connected triangle-covered graphs of order $n$, [2509.11448] gives a tight lower bound on the number of edges. If
$$
n=3q+r,\qquad 0\le r<3,\qquad \epsilon_r=\frac{r(5-r)}{2}\in\{0,2,3\},
$$
then every connected triangle-covered graph $G$ of order $n>3$ satisfies
$$
|E(G)|\ge 4q-1+\epsilon_r.
$$
The bound is tight for every $n$. The constructions are explicit: for $r=0$, one uses $q$ triangles connected by $q-1$ edges in a tree-like fashion, while for $r=1,2$ extra vertices are attached as specified in the paper. For $n\ge 8$, the extremal connected graphs admit a **tree-of-bags decomposition** in which each bag is either a triangle or one of finitely many exceptional graphs $H_1,\dots,H_7$ [2509.11448].

The same paper introduces the completion problem. A set
$$
F\subseteq \binom{V(G)}{2}\setminus E(G)
$$
is a **$\Delta$-completion set** if $G+F$ is triangle-covered. Deciding whether there exists a $\Delta$-completion set of size at most $t$ is $\mathbb{NP}$-complete, does not admit a constant-factor approximation algorithm under standard complexity assumptions, and remains $\mathbb{NP}$-complete on connected bipartite graphs [2509.11448]. On the positive side, the problem admits a polynomial-time $(\ln n+1)$-approximation algorithm for general graphs via a Set-Cover reduction.

For special classes the situation is sharper. Every edge in a minimum $\Delta$-completion set can be chosen between vertices at distance two. For trees, the minimum completion size ranges from $\lceil n/3\rceil$ to $\lceil n/2\rceil$, with paths attaining the lower bound and stars the upper bound, and there is a linear-time optimal algorithm [2509.11448]. For chordal graphs,
$$
\Delta_G=\sum_{i=1}^m \Delta_{T_i'},
$$
where the $T_i'$ arise from the decomposition into maximal tree components after deleting pendant clique vertices, again yielding a linear-time optimal algorithm. For $2$-edge-connected cactus graphs of order $n$,
$$
\max \Delta_G=\left\lceil \frac{2n}{5}\right\rceil.
$$
In the random graph $\mathbb{G}(n,p)$, the threshold for triangle-coveredness is $p\sim n^{-2/3}$ [2509.11448].

## 4. Global triangle transversals, packings, and Tuza-type inequalities

The most developed global notion of triangle coverage concerns edge sets meeting every triangle. Tuza’s conjecture asserts
$$
\tau_t(G)\le 2\nu_t(G)
$$
for every graph $G$ [1605.01816]. One extremal direction asks what happens when a graph is hard to make triangle-free. If $G$ has $m$ edges and density parameter $m=\beta n^2$, then dense graphs satisfying
$$
T_t(G)\ge (1-\delta)\frac{m}{2}
$$
must contain a large triangle packing:
$$
v_t(G)\ge m\left(\frac14+c\beta^2\right),
$$
where $c$ is an absolute constant [1009.0353]. This improves the earlier $m(1/4-o(1))$ lower bound that follows from the asymptotic validity of Tuza’s conjecture for dense graphs, and the same paper conjectures an asymptotically optimal packing size of $m(1/3-o(1))$. The argument extends to larger cliques and odd cycles [1009.0353].

For irreducible graphs, [1605.01816] provides polynomial-time sufficient conditions for Tuza’s conjecture. If any one of
$$
\frac{\nu_t(G)}{|\mathscr T_G|}\ge \frac13,\qquad
\frac{\nu_t(G)}{|E|}\ge \frac14,\qquad
\frac{|E|}{|\mathscr T_G|}\ge 2
$$
holds, then a triangle cover of size at most $2\nu_t(G)$ can be found in polynomial time. The proof passes through the triangle hypergraph and uses feedback sets in linear $3$-uniform hypergraphs; in the second condition, a large bipartite subgraph supplies the cover directly [1605.01816].

Exact equality between packing and covering also occurs in specific structured families. In any **bilaterally-complete tripartite graph**, the maximum number of pairwise edge-disjoint triangles equals the minimum number of edges meeting all triangles:
$$
TA(G)=VA(G).
$$
The proof combines Menger’s Theorem with König’s Line Colouring Theorem and generalizes the corresponding result for complete tripartite graphs due to Lakshmanan et al. [2307.08824]. A different structural route appears in the theory of triangle graphs: if the triangle graph ${\cal T}(G)$ is perfect, then Tuza’s conjecture holds for $G$ [1410.8807].

## 5. Triangle clique covers

Clique-cover variants ask not for edges or vertices that hit every triangle, but for cliques that contain every triangle. Formally, a **$K_t$ clique cover** is a set of cliques such that every $K_t$ of $G$ is contained in one of them, and the minimum size is $\theta_{K_t}(G)$ [1709.01590]. For $t=3$, this is the **triangle clique cover number** $\theta_\triangle(G)$.

The sharp extremal theorem is an exact triangle analogue of the Erdős–Goodman–Pósa theorem for edge clique covers. For every $n$-vertex graph $G$,
$$
\theta_\triangle(G)\le k_3(T(n,3))
$$
with equality if and only if $G=T(n,3)$, the balanced complete tripartite Turán graph [1709.01590]. Since
$$
k_3(T(n,3))=
\left\lfloor \frac n3\right\rfloor
\left\lfloor \frac{n+1}3\right\rfloor
\left\lfloor \frac{n+2}3\right\rfloor,
$$
this also yields the explicit bound
$$
\mathcal{CC}_3(G)\le
\left\lfloor \frac n3\right\rfloor
\left\lfloor \frac{n+1}3\right\rfloor
\left\lfloor \frac{n+2}3\right\rfloor,
$$
again with equality only for $T(n,3)$ [2506.10478].

Algorithmically, the triangle clique cover problem is NP-hard in general; more generally, for every fixed $t\ge 1$, deciding whether $\theta_{K_t}(G)\le k$ is NP-complete [1709.01590]. On the positive side, the weighted $K_t$ clique cover problem is solvable on semichordal graphs by extending the Scheinerman–Trenk framework [1709.01590]. The broader Turán-type conjecture that $T_{n,t}$ maximizes the $t$-clique cover number was confirmed for $t=4$ using inductive frameworks, greedy partition method, local adjustments, and clique-counting lemmas by Erdős and by Moon and Moser [2506.10478].

The clique-cover perspective is sometimes described informally as “triangle-covered,” but it is conceptually different from both local notions above: the object being covered is the family of triangles themselves, not the vertices or edges of the host graph.

## 6. Vertex-incidence thresholds and related structures

A related extremal problem asks for the edge density that forces vertex participation in triangles. In [1901.09560], the **triangle-degree** of a vertex is the number of triangles containing it, and the function $\tau(\rho)$ measures the asymptotically smallest possible maximum scaled triangle-degree in an $n$-vertex graph of edge density at least $\rho$. The paper gives explicit piecewise upper bounds for $\tau(\rho)$, conjectures these bounds are tight for all $\rho\in[0,1]$, proves the conjecture for tripartite graphs, and uses flag algebra computations to obtain nearly sharp lower bounds on $\rho\in[1/2,2/3]$ [1901.09560]. The associated covering threshold is the smallest $\rho$ such that $\tau(\rho)\le 1-\rho$, and the conjectured sharp value is
$$
\rho_\star=\frac{19}{27}\approx 0.7037.
$$
For tripartite graphs, if $e(G)>n^2/4$, then
$$
t_{\max}(G)\ge
\begin{cases}
\frac32\left(e(G)-\frac{n^2}{4}\right) & \text{if }\frac{e(G)}{n^2}<\frac{3}{10},\\[1ex]
e(G)-\frac{2}{9}n^2 & \text{if }\frac{3}{10}\le \frac{e(G)}{n^2}\le \frac13.
\end{cases}
$$
These bounds are sharp in the tripartite setting [1901.09560].

The phrase *triangle covering number* is also ambiguous on the transversal side. In [2005.07224], $\tau_3(G)$ denotes the minimum number of **vertices** that hit all triangles. For large $n$ and $s>t\ge 1$, an $n$-vertex graph with $\lfloor n^2/4\rfloor+t$ edges and $\tau_3(G)=s$ satisfies a sharp lower bound
$$
N_3(G)\ge s\cdot n^-_{s,t}-m_{s,t},
$$
with equality only for the constructions $BM_{s,t}(n)$ or $BS_{s,t}(n)$ except for a few small exceptional cases [2005.07224]. This extends the Erdős–Rademacher line of results beyond the classical regime $s\le t$.

Several adjacent constructions should not be conflated with triangle-coveredness itself. The **triangle graph** ${\cal T}(G)$ has one vertex for each triangle of $G$, with adjacency defined by shared edges; its cycle, tree, chordal, and perfect cases admit forbidden-subgraph characterizations [1410.8807]. A **triangle-forest** is a graph with no cycles of length more than three, and every planar graph can be partitioned into two induced triangle-forests; this was already proved by Carsten Thomassen in 1995 [2401.15394]. In algorithmic triangle counting, a **cover-edge set** is a subset of edges containing at least one edge from every triangle; BFS level structure shows that the set of horizontal edges forms such a cover-edge set, enabling sequential, shared-memory, and distributed triangle-counting algorithms [2403.02997]. These notions are structurally adjacent because they organize triangles globally, but they solve different problems.

The modern literature therefore treats “triangle-covered graph” less as a single invariant than as a family of covering paradigms. The edge-local and vertex-local versions lead to different extremal constructions and different completion problems; transversal formulations connect to Tuza’s conjecture and dense graph packing; clique-cover variants recover Turán-type extremal bounds; and vertex-incidence thresholds bring in triangle-degree, flag algebras, and generalized Erdős–Rademacher theory.

Source: https://www.emergentmind.com/topics/triangle-covered-graph