首页/论文/2007.04478

arXiv 2007.044782020-07-08math.CO

Closing the Random Graph Gap in Tuza's Conjecture Through the Online Triangle Packing Process

Patrick Bennett, Ryan Cushman, Andrzej Dudek

英文摘要：

A long-standing conjecture of Zsolt Tuza asserts that the triangle covering number $τ(G)$ is at most twice the triangle packing number $ν(G)$, where the triangle packing number $ν(G)$ is the maximum size of a set of edge-disjoint triangles in $G$ and the triangle covering number $τ(G)$ is the minimal size of a set of edges intersecting all triangles. In this paper, we prove that Tuza's conjecture holds in the Erdős-Rényi random graph $G(n,m)$ for all range of $m$, closing the gap in what was previously known. (Recently, this result was also independently proved by Jeff Kahn and Jinyoung Park.) We employ a random greedy process called the online triangle packing process to produce a triangle packing in $G(n,m)$ and analyze this process by using the differential equations method.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Large triangle packings and Tuza's conjecture in sparse random graphs

The triangle packing number $ν(G)$ of a graph $G$ is the maximum size of a set of edge-disjoint triangles in $G$. Tuza conjectured that in any graph $G$ there exists a set of at most $2ν(G)$ edges intersecting every triangle in $G$. We show that Tuza's conjecture holds in the random graph $G=G(n,m)$, when $m \le 0.2403n^{3/2}$ or $m\ge 2.1243n^{3/2}$. This is done by analyzing a greedy algorithm for finding large triangle packings in random graphs.

2020-02-04math.CO

随机几何图中的几乎完美打包与Tuza猜想

Almost-perfect packings and Tuza's conjecture in the random geometric graph

Western Michigan University（西密歇根大学）；University of Tennessee, Knoxville（田纳西大学诺克斯维尔分校）；University of Nebraska-Lincoln（内布拉斯加大学林肯分校）

研究随机几何图中Tuza猜想成立的条件，并证明对于一大类密度该猜想成立；同时研究用固定图F的边不交副本覆盖几乎所有边的问题，对无限族F证明了几乎完美打包的存在性。

2026-06-08cs.DMmath.CO

Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles

Given a simple graph $G=(V,E)$, a subset of $E$ is called a triangle cover if it intersects each triangle of $G$. Let $ν_t(G)$ and $τ_t(G)$ denote the maximum number of pairwise edge-disjoint triangles in $G$ and the minimum cardinality of a triangle cover of $G$, respectively. Tuza conjectured in 1981 that $τ_t(G)/ν_t(G)\le2$ holds for every graph $G$. In this paper, using a hypergraph approach, we design polynomial-time combinatorial algorithms for finding small triangle covers. These algorithms imply new sufficient conditions for Tuza's conjecture on covering and packing triangles. More pre…

2016-05-24cs.GRmath.CO

Favaron's Theorem, k-dependence, and Tuza's Conjecture

A vertex set $D$ in a graph $G$ is $k$-dependent if $G[D]$ has maximum degree at most $k-1$, and $k$-dominating if every vertex outside $D$ has at least $k$ neighbors in $D$. Favaron proved that if $D$ is a $k$-dependent set maximizing the quantity $k|D| - |E(G[D])|$, then $D$ is $k$-dominating. We extend this result, showing that such sets satisfy a stronger structural property, and we find a surprising connection between Favaron's theorem and a conjecture of Tuza regarding packing and covering of triangles.

2015-08-12math.CO

Packing and covering directed triangles asymptotically

A well-known conjecture of Tuza asserts that if a graph has at most $t$ pairwise edge-disjoint triangles, then it can be made triangle-free by removing at most $2t$ edges. If true, the factor 2 would be best possible. In the directed setting, also asked by Tuza, the analogous statement has recently been proven, however, the factor 2 is not optimal. In this paper, we show that if an $n$-vertex directed graph has at most $t$ pairwise arc-disjoint directed triangles, then there exists a set of at most $1.8t+o(n^2)$ arcs that meets all directed triangles. We complement our result by presenting two…

2021-09-15math.CO

Tuza's Conjecture is Asymptotically Tight for Dense Graphs

An old conjecture of Zs. Tuza says that for any graph $G$, the ratio of the minimum size, $τ_3(G)$, of a set of edges meeting all triangles to the maximum size, $ν_3(G)$, of an edge-disjoint triangle packing is at most 2. Here, disproving a conjecture of R. Yuster, we show that for any fixed, positive $α$ there are arbitrarily large graphs $G$ of positive density satisfying $τ_3(G)>(1-o(1))|G|/2$ and $ν_3(G)<(1+α)|G|/4$.

2015-10-20math.CO

更多相关论文收起更多论文

Maximal $k$-Edge-Colorable Subgraphs, Vizing's Theorem, and Tuza's Conjecture

We prove that if $M$ is a maximal $k$-edge-colorable subgraph of a multigraph $G$ and if $F = \{v \in V(G) : d_M(v) \leq k-μ(v)\}$, then $d_F(v) \leq d_M(v)$ for all $v \in F$. (When $G$ is a simple graph, the set $F$ is just the set of vertices having degree less than $k$ in $M$.) This implies Vizing's Theorem as well as a special case of Tuza's Conjecture on packing and covering of triangles. A more detailed version of our result also implies Vizing's Adjacency Lemma for simple graphs.

2017-03-06math.CO

Packing and covering directed triangles

We prove that if a directed multigraph $D$ has at most $t$ pairwise arc-disjoint directed triangles, then there exists a set of less than $2t$ arcs in $D$ which meets all directed triangles in $D$, except in the trivial case $t=0$. This answers affirmatively a question of Tuza from 1990.

2019-03-07math.CO

Tuza猜想低于2.8的界

A Bound Below 2.8 for Tuza's Conjecture

Shenzhen MSU-BIT University（深圳莫斯科国立技术大学）

本文改进了Tuza猜想的界，通过红蓝着色和交换论证证明$\tau(G)\le (165/59)\nu(G)$，优于Haxell的$66/23$。

2026-09-15math.CO

Packing triangles in weighted graphs

Tuza conjectured that for every graph $G$, the maximum size $ν$ of a set of edge-disjoint triangles and minimum size $τ$ of a set of edges meeting all triangles satisfy $τ\leq 2ν$. We consider an edge-weighted version of this conjecture, which amounts to packing and covering triangles in multigraphs. Several known results about the original problem are shown to be true in this context, and some are improved. In particular, we answer a question of Krivelevich who proved that $τ\leq 2ν^*$ (where $ν^*$ is the fractional version of $ν$), and asked if this is tight. We prove that $τ\leq 2ν^*-\frac{…

2015-05-25math.CO

最大度至多为7的图的Tuza猜想

Tuza's conjecture for graphs of maximum degree at most seven

Independent researcher

该研究证明最大度至多为7的图满足Tuza猜想，通过改进Puleo的可归约集框架，结合机器验证的局部证书完成极小7-正则反例的分析，明确了猜想常数的最优性。

2026-08-10math.CO

Dense graphs with a large triangle cover have a large triangle packing

It is well known that a graph with $m$ edges can be made triangle-free by removing (slightly less than) $m/2$ edges. On the other hand, there are many classes of graphs which are hard to make triangle-free in the sense that it is necessary to remove roughly $m/2$ edges in order to eliminate all triangles. It is proved that dense graphs that are hard to make triangle-free, have a large packing of pairwise edge-disjoint triangles. In particular, they have more than $m(1/4+cβ^2)$ pairwise edge-disjoint triangles where $β$ is the density of the graph and $c$ is an absolute constant. This improves …

2010-09-02math.CO

Multi-transversals for Triangles and the Tuza's Conjecture

In this paper, we study a primal and dual relationship about triangles: For any graph $G$, let $ν(G)$ be the maximum number of edge-disjoint triangles in $G$, and $τ(G)$ be the minimum subset $F$ of edges such that $G \setminus F$ is triangle-free. It is easy to see that $ν(G) \leq τ(G) \leq 3 ν(G)$, and in fact, this rather obvious inequality holds for a much more general primal-dual relation between $k$-hyper matching and covering in hypergraphs. Tuza conjectured in $1981$ that $τ(G) \leq 2 ν(G)$, and this question has received attention from various groups of researchers in discrete mathema…

2021-02-03cs.DMcs.DSmath.CO

连通次立方图和立方图中支配-填充比的新下界

New lower bounds on domination--packing ratios in connected subcubic and cubic graphs

University of Seoul（首尔大学）

该研究针对连通次立方图和立方图，构造显式二元分支族，证明其支配数与填充数之比的下界分别为13/6和17/8，反驳了\textit{γ(G)≤2ρ(G)+1}对连通立方图的适用性。

2026-08-18math.CO

随机图的最优哈密顿覆盖与线性荫度

Optimal Hamilton covers and linear arboricity for random graphs

本文证明了当 $p\geq C\log n/n$ 时，可用恰好 $\lceilΔ(G)/2\rceil$ 个哈密顿圈覆盖随机图 $G(n,p)$，在圈数和边概率阈值上均达最优，解决了该领域的长期遗留问题。

2023-10-17math.CO