A d-partite hypergraph is called fractionally balanced if there exists a non-negative, not identically zero, function on its edge set that has constant degrees in each vertex side. Using a topological version of Hall’s theorem we prove lower bounds on the matching number of such hypergraphs. These bounds yield rainbow versions of the KKM theorem for products of simplices, which in turn are used to obtain some results on multiple-cake division, and on rainbow matchings in families of d-intervals.
Bibliographical noteFunding Information:
R. Aharoni was Supported by the Israel Science Foundation (ISF) grant no. 2023464 and the Discount Bank Chair at the Technion. This paper is part of a project that has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement no. 823748. This work was supported by the Russian Federation Government in the framework of MegaGrant no. 075-15-2019-1926 when Ron Aharoni worked on Sections 6 through 8 of the paper.
Erel Segal-Halevi was supported by the Israel Science Foundation (grant no. 712/20).
R. Aharoni, E. Berger and S. Zerbib are supported by BSF grant no. 2016077. Acknowledgements
Shira Zerbib was supported by NSF grant DMS-1953929.
© 2022, János Bolyai Mathematical Society and Springer-Verlag.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics