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.

Background

The paper defines g(r,n) and g′(r,n) as the largest guaranteed rainbow matching size among n matchings of size n in r-partite and unrestricted r-uniform hypergraphs, respectively. It defines h(r,n) and h′(r,n) as the smallest matching size guaranteeing a rainbow matching of size n in the corresponding two settings.

The preceding results give nontrivial bounds for these parameters when r≥3. Conjecture 3.1 proposes that all four parameters have asymptotic density one relative to n for every fixed uniformity r.

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.

— A note on improved bounds for hypergraph rainbow matching problems  (2501.03216 - Bowtell et al., 6 Jan 2025) in Conjecture 3.1, Section 3, page 10

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.

— On MMS allocations with few items  (2610.06125 - Feige, 5 Oct 2026) in Appendix, Section Rainbow matchings in hypergraphs, Question qu:arbitrary

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.

— On MMS allocations with few items  (2610.06125 - Feige, 5 Oct 2026) in Appendix, Section Rainbow matchings in hypergraphs, Question qu:goods

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.

— On MMS allocations with few items  (2610.06125 - Feige, 5 Oct 2026) in Appendix, Section Rainbow matchings in hypergraphs, Question qu:chores