Sharp bounds for rainbow matchings in hypergraphs

DOI10.1112/JLMS.70252MaRDI QIDQ6936231zbMATH OpenFDO

Authors Cosmin Pohoata, Lisa Sauermann, Dmitrii Zakharov

Publication date 1 September 2025

Published in Journal of the London Mathematical Society. Second Series (Search for Journal in Brave)

zbMATH Keywords

\(r\)-uniform hypergraphadditive Latin transversals

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

This page was built for publication: Sharp bounds for rainbow matchings in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6936231)