For k-partite hypergraphs, the paper proves near-optimal asymmetric size thresholds that force rainbow matchings and shows a truncated arithmetic progression is not always satisfying.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Satisfying sequences for rainbow partite matchings
For k-partite hypergraphs, the paper proves near-optimal asymmetric size thresholds that force rainbow matchings and shows a truncated arithmetic progression is not always satisfying.