Metraipolis › archive › dc_c29d6655db76

Tuza's Ryser-conjecture claim for four-partite hypergraphs with matching number two — arXiv:2609.14281

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14281
License (as archived)
CC0-1.0
Archived
2026-10-16T01:25:17.058Z
SHA-256 of the archived text
c16bab8af9b3d5736ec08dcb146764cbc411ad34c1eec17c0df8bf114ddda247
Stable URL of this page
https://metraipolis.com/documento/dc_c29d6655db76

How to cite

Tuza's Ryser-conjecture claim for four-partite hypergraphs with matching number two — arXiv:2609.14281 — arXiv (en), https://arxiv.org/abs/2609.14281 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c29d6655db76 (Metraipolis archive dc_c29d6655db76, sha256 c16bab8af9b3d5736ec08dcb146764cbc411ad34c1eec17c0df8bf114ddda247)
BibTeX
@misc{dcc29d6655db76,
  title = {Tuza's Ryser-conjecture claim for four-partite hypergraphs with matching number two — arXiv:2609.14281},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14281},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c29d6655db76; sha256 c16bab8af9b3d5736ec08dcb146764cbc411ad34c1eec17c0df8bf114ddda247},
  year = {2026}
}

Archived text

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

We prove that every $4$-partite $4$-uniform hypergraph $H$ with matching number $\nu(H)=2$ satisfies $\tau(H)\le 6$, where $\tau$ denotes the vertex-cover number. This confirms a claim made by Tuza in his 1979 manuscript but never published with a proof, and closes the case $(r,\nu)=(4,2)$ of Ryser's conjecture. The best previous bound was $\tau\le 7$, an integrality consequence of the theorem of Haxell and Scott (2012). The proof uses Gyárfás's intersecting-case theorem ($\tau\le 3$ for intersecting $4$-partite $4$-uniform families), a short projection lemma (four base-disjoint edges in an intersecting family force a two-element cover), and Kőnig's matching theorem.

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.14281 — 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.206Z 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).