Triangle-Covered Problem Overview

• Triangle-covered problem is defined as ensuring every vertex in a graph belongs to a triangle, often via minimal edge additions (Δ-completion) and extremal bounds.
• The topic extends to various formulations including triangle edge, directed triangle, clique covers, and hypergraph coverings, each with distinct complexity and applications.
• Algorithmic approaches range from Set Cover reductions and greedy approximations to exact linear-time solutions, impacting graph modification and geometric covering strategies.

Searching arXiv for recent and foundational papers on “triangle-covered” and related triangle covering formulations. In the arXiv literature, “triangle-covered problem” does not denote a single canonical problem. In the most direct graph-theoretic sense, a graph $G$ is triangle-covered if every vertex of $G$ belongs to at least one triangle, and the associated optimization problem asks for a minimum set of non-edges whose addition makes $G$ triangle-covered (Madani et al., 14 Sep 2025). Closely related usages concern covering all triangles by edges, arcs, or cliques; forcing every vertex of a $3$-uniform hypergraph to lie in a prescribed triangle-like configuration; and planar translation-covering problems in which triangles themselves are the covering objects (McDonald et al., 2018, Chen et al., 2016, Gu et al., 2023, Balitskiy et al., 12 Mar 2026). This suggests a family of triangle-centered covering problems rather than a single formalism.

1. Scope of the term

The literature separates several non-equivalent notions according to what is being covered and what serves as a cover. In graph modification, the target property is local vertex participation in a triangle. In covering-and-packing theory, the target is the family of all triangles, which must be hit by edges, arcs, or cliques. In hypergraph covering thresholds, every vertex must lie in a copy of a fixed $3$-uniform “triangle.” In planar geometry, one seeks small convex regions or few homothetic unit triangles that cover all admissible triangles or arcs.

Formulation	Defining condition	Representative paper
Triangle-covered graph	every vertex of $G$ belongs to at least one triangle	(Madani et al., 14 Sep 2025)
Triangle edge cover	a subset of $E(G)$ intersects each triangle of $G$	(Chen et al., 2016)
Directed triangle cover	a set of arcs meets all directed triangles in a directed multigraph	(McDonald et al., 2018)
Triangle clique cover	a set of cliques covers all copies of $K_3$ in $G$	(Dau et al., 2017)
$G$0-covering in $G$1-graphs	every vertex lies in a copy of $G$2	(Gu et al., 2023, Tang et al., 2022)
Planar triangle covering	translated or homothetic triangles cover prescribed shapes or curves	(Boyer, 5 May 2026, Balitskiy et al., 12 Mar 2026, Wichiramala et al., 12 Jun 2026)

This multiplicity of meanings is structurally important. In some settings “triangle-covered” is a target graph property; in others it is a hitting-set problem; in still others it is an extremal threshold question.

2. Triangle-covered graphs as an edge-addition problem

For a connected graph $G$3, a subset

$G$4

is a $G$5-completion set if $G$6 is triangle-covered, and $G$7 denotes the size of a minimum $G$8-completion set. The corresponding decision problem is: given a graph $G$9 and an integer $G$0, does $G$1 have a $G$2-completion set of size at most $G$3? The paper also uses the term unsaturated vertex for a vertex that does not belong to any triangle (Madani et al., 14 Sep 2025).

The structural theory begins with extremal connected triangle-covered graphs. If

$G$4

and

$G$5

then every connected triangle-covered graph $G$6 of order $G$7 satisfies

$G$8

Equivalently,

$G$9

The bound is tight for every $3$0, and for $3$1 the extremal connected graphs are exactly the graphs in the family $3$2, obtained from small bags arranged in a tree-like decomposition (Madani et al., 14 Sep 2025).

The central algorithmic lemma states that when every component has at least three vertices, there exists a minimum $3$3-completion set $3$4 such that for every added edge $3$5,

$3$6

equivalently $3$7. In optimal solutions, every added edge may therefore be assumed to close a length-$3$8 path into a triangle. This yields an exact reduction to Set Cover: if $3$9 is the set of unsaturated vertices and $3$0 ranges over non-edges with $3$1, one defines

$3$2

and then $3$3 equals the minimum set cover size of $3$4. Consequently, greedy Set Cover gives a polynomial-time $3$5-approximation algorithm for graphs of order $3$6 whose components all have at least three vertices (Madani et al., 14 Sep 2025).

The complexity landscape is negative in general. The triangle-covered problem is $3$7-complete, remains $3$8-complete on connected bipartite graphs, and admits no polynomial-time constant-factor approximation unless $3$9. At the same time, several classes admit exact analysis. For trees,

$G$0

and

$G$1

There is a linear-time exact algorithm for trees, and for chordal graphs one has

$G$2

after decomposition into the tree components $G$3, giving an $G$4-time algorithm. For random graphs $G$5, the threshold for being triangle-covered occurs at $G$6 (Madani et al., 14 Sep 2025).

3. Covering all triangles in graphs and directed graphs

A different classical problem does not aim to make every vertex lie in a triangle; instead it asks for a minimum edge set meeting every triangle. For a simple graph $G$7, a triangle cover is a subset $G$8 that intersects every triangle of $G$9. The minimum size of such a set is $E(G)$0, and the maximum number of pairwise edge-disjoint triangles is $E(G)$1. Tuza’s conjecture asserts

$E(G)$2

One polynomial-time sufficient-condition theorem states that if $E(G)$3 is irreducible and at least one of

$E(G)$4

holds, then a triangle cover of size at most $E(G)$5 can be found in polynomial time (Chen et al., 2016).

The same paper translates triangle covering to transversals in the triangle hypergraph

$E(G)$6

where vertices are graph edges and hyperedges are triangles. In this translation,

$E(G)$7

Its main hypergraph tool is a feedback-vertex-set bound for linear $E(G)$8-uniform hypergraphs,

$E(G)$9

together with exact solvability on acyclic hypergraphs. The point of the reduction is that many triangle-covering arguments become cycle-breaking arguments in linear $G$0-uniform hypergraphs (Chen et al., 2016).

The directed analogue replaces edges by arcs and ordinary triangles by directed $G$1-cycles. For a directed multigraph $G$2, the directed triangle packing number $G$3 is the maximum size of a family of pairwise arc-disjoint directed triangles, and the directed triangle covering number $G$4 is the minimum size of a set of arcs $G$5 such that $G$6 has no directed triangle. The main theorem proves that if $G$7 has at least one directed triangle, then

$G$8

Equivalently, if $G$9 has at most $K_3$0 pairwise arc-disjoint directed triangles, then there exists a set of fewer than $K_3$1 arcs meeting all directed triangles, except in the trivial case $K_3$2. The proof is an induction on $K_3$3 using an auxiliary network and Menger’s theorem. The paper also formulates the stronger conjecture

$K_3$4

motivated by the rotational $K_3$5-tournament $K_3$6, for which

$K_3$7

(McDonald et al., 2018).

A broader hypergraph generalization due to Aharoni and Zerbib asks for a minimum family of $K_3$8-subsets meeting every $K_3$9-edge by inclusion. For $G$0, the paper proves

$G$1

giving a factor $G$2 approximation via LP rounding. This is not the classical graph triangle-cover problem itself, but it is an algorithmic generalization motivated by it (Guruswami et al., 2020).

An algorithmic variant of triangle covering by edges appears in exact triangle counting. A cover-edge set is an edge set $G$3 such that every triangle contains at least one edge in $G$4. If $G$5 denotes BFS levels, then the horizontal edges

$G$6

form a valid cover-edge set. Every triangle contains either one or three horizontal edges. This permits exact triangle counting by intersecting neighborhoods only over $G$7, rather than over all edges (Bader et al., 2022).

4. Hypergraph covering thresholds for generalized and linear triangles

In $G$8-uniform hypergraphs, an $G$9-covering means that every vertex lies in a copy of $G$00. For $G$01,

$G$02

Thus $G$03 is the minimum $G$04-degree condition forcing an $G$05-covering (Gu et al., 2023, Tang et al., 2022).

For the $G$06-uniform generalized triangle

$G$07

the exact codegree threshold is

$G$08

For the degree threshold,

$G$09

so

$G$10

The same paper distinguishes the three positions in which a vertex can lie in a copy of $G$11, denoted $G$12, and proves stronger sufficient minimum-degree conditions for forcing these specific positions (Gu et al., 2023).

For the $G$13-uniform linear triangle

$G$14

the exact codegree threshold collapses to

$G$15

The asymptotic degree threshold is

$G$16

hence

$G$17

The proof uses link-graph forbidden-configuration arguments for the exact codegree statement and a refined counting analysis for the degree statement (Tang et al., 2022).

A related extremal graph problem controls tetrahedron coverings in $G$18-graphs. If $G$19 denotes the asymptotically smallest possible maximum scaled triangle-degree among $G$20-vertex graphs of edge density at least $G$21, then the paper proves an upper-bound construction

$G$22

and conjectures that these bounds are tight. It further shows that this conjecture implies

$G$23

and proves

$G$24

(Falgas--Ravry et al., 2019).

5. Geometric triangle covering in the plane

In geometric set cover, triangles appear as covering objects rather than as target subgraphs. The abstract of “Improved Approximation Algorithms for Geometric Set Cover” states that the paper gives constant-factor approximation algorithms for covering by similar-sized fat triangles in $G$25, and improved approximation guarantees for fat triangles of arbitrary size [0501045].

A different line studies exact thresholds for covering larger triangles by homothetic unit triangles. Let $G$26 denote a triangle with selected side length $G$27, where $G$28. The paper proves that $G$29 can be covered by $G$30 homothetic unit triangles if and only if

$G$31

and by $G$32 homothetic unit triangles if and only if

$G$33

Together with earlier Baek–Lee results, the small-excess picture is:

• $G$34: impossible for every $G$35;
• $G$36: exact threshold $G$37;
• $G$38: exact threshold $G$39;
• $G$40, $G$41: exact parity-dependent thresholds above (Boyer, 5 May 2026).

The paper “Triangle covering problems and the Viterbo inequality in the plane” reformulates a symplectic-capacity question as a planar covering problem. For a convex polygon $G$42, a convex shape $G$43 is a $G$44-cover if every $G$45-normal triangle fits into $G$46. The main reduction proves that for polygonal $G$47,

$G$48

In dimension $G$49, Viterbo’s inequality for lagrangian products becomes

$G$50

so for $G$51-covers it predicts

$G$52

The paper proves this statement when $G$53 is any quadrilateral, and explains the Haim–Kislev–Ostrover counterexample in the regular pentagon case (Balitskiy et al., 12 Mar 2026).

Wetzel’s conjecture belongs to the same translation-covering tradition. The paper “Wetzel’s 30-60-90 Triangle Covers Unit Arcs” proves that a specific $G$54 triangle $G$55 covers every unit arc in the plane. More strongly, the homothetic copy $G$56 still covers every unit arc, and its area

$G$57

is below

$G$58

(Wichiramala et al., 12 Jun 2026).

6. Clique covers, polygon covers, and geometric-triangle recognition

The triangle clique cover problem asks for a set of cliques covering every copy of $G$59. Formally, a set $G$60 of cliques is a $G$61 clique cover of $G$62 if for every triangle $G$63 there is a clique $G$64 with $G$65; the minimum size is $G$66. The paper proves the exact extremal bound

$G$67

for every graph $G$68 on $G$69 vertices, with equality if and only if

$G$70

It also proves that the decision problem $G$71 is NP-complete for every fixed $G$72, hence in particular for $G$73, while giving an exact polynomial-time algorithm for the weighted $G$74 clique cover problem on semichordal graphs (Dau et al., 2017).

A much harder exact covering problem arises for polygons. The decision problem

$G$75

is $G$76-complete. The paper obtains this as a consequence of the $G$77-completeness of Minimum Convex Cover and shows that, for the constructed hard instances, if a cover exists then there also exists one consisting entirely of triangles. It further implies that, assuming the widespread belief that $G$78, the problem is not in $G$79 (Abrahamsen, 2021).

The term “triangle” also appears in representation problems. A simple-triangle graph is the intersection graph of a family of triangles spanned by a point on one horizontal line and an interval on another horizontal line. Recognition reduces to a restricted 2-chain subgraph cover problem on a bipartite graph $G$80 with a forbidden edge set $G$81: find a 2-chain subgraph cover such that one chain subgraph has no edges in $G$82. The paper gives a polynomial-time algorithm with running time

$G$83

thereby yielding a simpler recognition algorithm for simple-triangle graphs (Takaoka, 2016).

Taken together, these variants show that triangle-centered covering problems occupy several different complexity classes. Some admit exact linear-time algorithms on structured graph classes; some have logarithmic approximation algorithms but no constant-factor approximation on general graphs; some are NP-complete; and some are $G$84-complete. A plausible implication is that “triangle-covered problem” is best understood as a cluster of local-density, hitting-set, translation-covering, and geometric-realization problems, linked by the common role of the triangle as the minimal nontrivial $G$85-cycle or $G$86-vertex simplex.