Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rainbow matchings in $k$-partite hypergraphs

Published 7 Jan 2020 in math.CO and cs.DM | (2001.02181v2)

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

Citations (9)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up