Satisfying sequences for rainbow partite matchings
math.CO, cs.DM
Submitted: 2025-02-05
Updated: 2026-10-30
License: http://creativecommons.org/licenses/by/4.0/
The gist: Let F 1,, F s [n] k be a collection of s families.
Terminology
Abstract
Let F 1,, F s [n] k be a collection of s families. In this paper, we address the following question: for which sequences f 1,, f s do the conditions F i>f i imply that the families contain a rainbow matching, that is, there are pairwise disjoint F 1 in F 1,, F s in F s ? We call such sequences satisfying. Kiselev and the first author showed that f 1 = = f s=(s-1)n k-1 is satisfying for s>470, verifying the conjecture by Aharoni and Howard. This is the best possible if we insist that the families are of the same size. However, it turns out that much more can be said about asymmetric restrictions. In this paper, we investigate this question in several regimes and in particular answer the questions asked by Kiselev and Kupavskii. We use a variety of methods, including concentration and anticoncentration results, spread approximations, and the Combinatorial Nullstellenzatz.
Sources
- Improved bounds for the sunflower lemma
- An almost complete $t$-intersection theorem for permutations
- Linear dependencies, polynomial factors in the Duke--Erd\H os forbidden sunflower problem
- Spread approximations for forbidden intersections problems
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality