Metraipolis › archive › dc_9abccca7328d

A Bound Below 2.8 for Tuza's Conjecture — arXiv:2609.13831

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.13831
License (as archived)
CC0-1.0
Archived
2026-10-16T01:23:06.552Z
SHA-256 of the archived text
f53836713bb4c82ca34ca5021c04592a6fe8ff24efff0b7e32e2c5ae04432a62
Stable URL of this page
https://metraipolis.com/documento/dc_9abccca7328d

How to cite

A Bound Below 2.8 for Tuza's Conjecture — arXiv:2609.13831 — arXiv (en), https://arxiv.org/abs/2609.13831 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9abccca7328d (Metraipolis archive dc_9abccca7328d, sha256 f53836713bb4c82ca34ca5021c04592a6fe8ff24efff0b7e32e2c5ae04432a62)
BibTeX
@misc{dc9abccca7328d,
  title = {A Bound Below 2.8 for Tuza's Conjecture — arXiv:2609.13831},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13831},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9abccca7328d; sha256 f53836713bb4c82ca34ca5021c04592a6fe8ff24efff0b7e32e2c5ae04432a62},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13831. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $\nu(G)$ be the maximum number of edge-disjoint triangles in a graph $G$ and $\tau(G)$ the minimum number of edges meeting every triangle. Tuza conjectured that $\tau(G)\le 2\nu(G)$. We prove that $\tau(G)\le (165/59)\nu(G)$. The constant $165/59\approx 2.797$ improves the bound $66/23\approx 2.870$ that Haxell proved in 1999. The key observation is that, for a suitable red-blue coloring, the families left over in Haxell's construction contain every triangle with exactly one red edge. Such a family $\mathcal{F}$ admits an exchange that forces certain red edges to lie in a single triangle once the blue edges of a maximum packing are deleted, which gives $\tau(\mathcal{F})\le (8/3)\nu(\mathcal{F})$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.13831 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:39:30.194Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).