Asymptotic full-rainbow-matching conjecture for hypergraphs
Establish that, for every fixed integer r≥2, each of the four parameters g(r,n), g′(r,n), h(r,n), and h′(r,n) is asymptotic to n; equivalently, prove that the ratio of each parameter to n converges to 1 as n tends to infinity.
References
Conjecture 3.1. Let r ≥ 2 be fixed. Then for each x ∈ {g(r, n), g′ (r, n), h(r, n), h′ (r, n)}, limn→∞ x n = 1.
For a given $n$, what is the largest value of $m$ for which the following holds? Every hypergraph $H$ on $m$ vertices that has at least $n$ perfect matchings, each in a different color, has a perfect rainbow matching.
For a given $n$, what is the largest value of $m$ for which the following holds? Every hypergraph $H$ on $m$ vertices that has at least $n$ perfect $n$-matchings, each in a different color, has a rainbow $n$-matching.
For a given $n$, what is the largest value of $m$ for which the following holds? Every hypergraph $H$ on $m$ vertices that has at least $n$ perfect $n$-matchings, each in a different color, has a rainbow cover.