Metraipolis › archive › dc_0c65dc684bc2

Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs — arXiv:2609.37290

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37290
License (as archived)
CC0-1.0
Archived
2026-10-07T18:33:39.179Z
SHA-256 of the archived text
469793956db63944824084ed4adf2df5ace38208e9dd302cad4c1fc5258a2af2
Stable URL of this page
https://metraipolis.com/documento/dc_0c65dc684bc2

How to cite

Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs — arXiv:2609.37290 — arXiv (en), https://arxiv.org/abs/2609.37290 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0c65dc684bc2 (Metraipolis archive dc_0c65dc684bc2, sha256 469793956db63944824084ed4adf2df5ace38208e9dd302cad4c1fc5258a2af2)
BibTeX
@misc{dc0c65dc684bc2,
  title = {Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs — arXiv:2609.37290},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37290},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0c65dc684bc2; sha256 469793956db63944824084ed4adf2df5ace38208e9dd302cad4c1fc5258a2af2},
  year = {2026}
}

Archived text

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

A balanced $k$-partite $k$-graph is a $k$-uniform hypergraph whose vertex set is partitioned into $k$ classes of the same size and whose edges meet every class in exactly one vertex. Lo and Markström (2014) determined the minimum vertex-degree threshold for perfect matchings when $k=3$, and Lu, Wang and Yuan recently determined it when $k=4$. We prove the corresponding exact result for every fixed $k\ge5$ and all sufficiently large class sizes. The close case follows from the general theorem of Lu, Wang and Yuan. For the non-closed case, we extend their stability result from the 3-partite setting to arbitrary partite uniformity, using the probability-tail rigidity theorem of Cao, Liu and Zhang, thereby replacing the earlier weighted lemma.

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