A note on improved bounds for hypergraph rainbow matching problems

TL;DR

This paper improves bounds on the size of rainbow matchings in hypergraphs, extending understanding of the problem inspired by the Ryser-Brualdi-Stein Conjecture, especially for hypergraphs with more than two parts.

Contribution

It provides new lower bounds for non-partite hypergraphs and upper bounds for $r$-partite hypergraphs, showing these bounds grow with the size of the hypergraph.

Findings

Improved lower bounds on $g'(r,n)$ for all $r \\geq 4$.

Enhanced upper bounds on $g(r,n)$ for all $r \\geq 3$ with large $n$.

Demonstrated that for $r \\geq 3$, $g(r,n)$ and $g'(r,n)$ are significantly less than $n$ as $n$ grows.

Abstract

A natural question, inspired by the famous Ryser-Brualdi-Stein Conjecture, is to determine the largest positive integer $g(r,n)$ such that every collection of $n$ matchings, each of size $n$, in an $r$-partite $r$-uniform hypergraph contains a rainbow matching of size $g(r,n)$. The parameter $g'(r,n)$ is defined identically with the exception that the host hypergraph is not required to be $r$-partite. In this note, we improve the best known lower bounds on $g'(r,n)$ for all $r \geq 4$ and the upper bounds on $g(r,n)$ for all $r \geq 3$, provided $n$ is sufficiently large. More precisely, we show that if $r\ge3$ then $$\frac{2n}{r+1}-\Theta_r(1)\le g'(r,n)\le g(r,n)\le n-\Theta_r(n^{1-\frac{1}{r}}).$$ Interestingly, while it has been conjectured that $g(2,n)=g'(2,n)=n-1$, our results show that if $r\ge3$ then $g(r,n)$ and $g'(r,n)$ are bounded away from $n$ by a function which grows in $n$. We also prove analogous bounds for the related problem where we are interested in the smallest size $s$ for which any collection of $n$ matchings of size $s$ in an ($r$-partite) $r$-uniform hypergraph contains a rainbow matching of size $n$.