Metraipolis › archive › dc_14783b4cd39e

An improved upper bound for Tuza's conjecture via 2-colorable triangle families — arXiv:2608.23010

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.23010
License (as archived)
CC0-1.0
Archived
2026-10-18T08:33:18.914Z
SHA-256 of the archived text
ddb6fbcae9e1abb04f4b8b620f7674cbd98245c6f9969f2900f8eb5ee1e87bef
Stable URL of this page
https://metraipolis.com/documento/dc_14783b4cd39e

How to cite

An improved upper bound for Tuza's conjecture via 2-colorable triangle families — arXiv:2608.23010 — arXiv (en), https://arxiv.org/abs/2608.23010 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_14783b4cd39e (Metraipolis archive dc_14783b4cd39e, sha256 ddb6fbcae9e1abb04f4b8b620f7674cbd98245c6f9969f2900f8eb5ee1e87bef)
BibTeX
@misc{dc14783b4cd39e,
  title = {An improved upper bound for Tuza's conjecture via 2-colorable triangle families — arXiv:2608.23010},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.23010},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_14783b4cd39e; sha256 ddb6fbcae9e1abb04f4b8b620f7674cbd98245c6f9969f2900f8eb5ee1e87bef},
  year = {2026}
}

Archived text

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

Tuza's conjecture states that for any graph $G$, the minimum size of a triangle transversal $\tau(G)$ is at most twice the maximum size of a set of edge-disjoint triangles $\nu(G)$. In this note, we prove $\tau(G) \leq \frac{63}{22}\nu(G)$, improving the previous bound $\tau(G) \leq \frac{66}{23}\nu(G)$ established by Haxell in 1999. The key observation is that for a "2-colorable" family of triangles $\mathcal{F}$, where each triangle has two blue edges and one red edge, we can obtain $\tau(\mathcal{F})\leq (1+\sqrt{3})\nu(\mathcal{F})$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.23010 — 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-18T08:27:54.452Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).