English

Rainbow matchings in $k$-partite hypergraphs

Combinatorics 2020-10-21 v2 Discrete Mathematics

Abstract

In this paper, we prove a conjecture of Aharoni and Howard on the existence of rainbow (transversal) matchings in sufficiently large families F1,,Fs\mathcal F_1,\ldots, \mathcal F_s of tuples in {1,,n}k\{1,\ldots, n\}^k, provided s470.s\ge 470.

Keywords

Cite

@article{arxiv.2001.02181,
  title  = {Rainbow matchings in $k$-partite hypergraphs},
  author = {Sergei Kiselev and Andrey Kupavskii},
  journal= {arXiv preprint arXiv:2001.02181},
  year   = {2020}
}
R2 v1 2026-06-23T13:05:15.296Z