Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Abbreviations
- n :
-
Num. of agents
- d :
-
Num. of cakes / intervals
- n t :
-
Num. of pieces of cake t
- \({\cal P}\) :
-
\( = \prod _{t = 1}^d{\Delta _{{n_t} - 1}}\) set of d-cake partitions
- P t :
-
partition of cake t; Pt ∈ △nt−1
- C t :
-
cake t / interval t (t ∈ [d])
- BM :
-
Matching in frac. balanced hyp.
- AD:
-
Admissible cake-division
- i :
-
Index of an agent; i ∈ [n].
- t :
-
Index of a cake / interval; t ∈ [d].
- j t :
-
Piece-index in cake t; jt ∈ [nt].
- \({\cal J}\) :
-
\( = \prod _{t = 1}^d\left[ {{n_t}} \right]\) set of piece-index vectors
- P :
-
partition of d cakes; \(P \in {\cal P}\)
- \(I_j^t\left( P \right)\) :
-
Interval j in partition P of cake t
- IM:
-
Matching in interval hyp.
References
M. Adamaszek and J. A. Barmak: On a lower bound for the connectivity of the independence complex of a graph, Discrete Math. 311 (2011), 2566–2569.
R. Aharoni and E. Berger: The intersection of a matroid and a simplicial complex, Transactions of the American Mathematical Society 358 (2006), 4895–4917.
R. Aharoni, E. Berger and R. Ziv: Independent systems of representatives in weighted graphs, Combinatorica 27 (2007), 253–267.
R. Aharoni, T. Kaiser and S. Zerbib: Fractional covers and matchings in families of weighted d-intervals, Combinatorica 37 (2017), 555–572.
N. Alon and K. A. Berman: Regular hypergraphs, Gordan’s lemma, Steinitz’ lemma and invariant theory, J. Combin. Theory, Ser. A 43 (1986), 91–97.
J. Cloutier, K. L. Nyman and F. E. Su: Two-player envy-free multi-cake division, Mathematical Social Sciences 59 (2010), 26–37.
A. A. Drisko: Transversals in row-latin rectangles, J. Combin. Theory, Ser. A 84 (1998), 181–195.
F. Frick and S. Zerbib: Colorful coverings of polytopes and piercing numbers of colorful d-intervals, Combinatorica 39 (2019), 627–637.
Z. Füredi: Maximum degree and fractional matchings in uniform hypergraphs, Combinatorica 1 (1981), 155–162.
D. Gale: Equilibrium in a discrete exchange economy with money, Internat. J. Game Theory 13 (1984), 61–64.
A. Hatcher: Algebraic topology, Cambridge University Press, 2001.
T. Kaiser: Transversals of d-intervals, Discrete Comput. Geom. 18 (1997), 195–203.
G. Kalai and R. Meshulam: A topological colorful helly theorem, Advances in Mathematics 191 (2005), 305–311.
D. Kőnig: Gráfok és alkalmazásuk a determinánsok és a halmazok elméletére (in Hungarian), Mathematikai és Természettudomdnyi Értesíő 34 (1916), 104–119.
B. Knaster, K. Kuratowski and S. Mazurkiewicz: Ein beweis des fixpunktsatzes fr n-dimensionale simplexe (in German), Fundamenta Mathematicae 14 (1929), 132137.
H. Komiya: A simple proof of K-K-M-S theorem, Econom. Theory 4 (1994), 463–466.
G. van der Laan, D. Talman and Z. Yang: Intersection theorems on polytopes, Math. Program. (Ser. A) 84 (1999) 25–38.
G. van der Laan, D. Talman and Z. Yang: Existence of balanced simplices on polytopes, J. Combin. Theory, Ser. A 96 (2001), 288–302.
N. Lebert, F. Meunier and Q. Carbonneaux: Envy-free two-player m-cake and three-player two-cake divisions, Operations Research Letters 41 (2013), 607–610.
R. Meshulam: Domination numbers and homology, J. Combin. Theory, Ser. A 102 (2003), 321–330.
F. Meunier and F. E. Su: Multilabeled versions of Sperner’s and Fan’s lemmas and applications, SIAM Journal on Applied Algebra and Geometry 3 (2019), 391–411.
K. Nyman, F. E. Su and S. Zerbib: Fair division with multiple pieces, Discrete Applied Mathematics 283 (2020), 115–122.
W. Stromquist: How to cut a cake fairly, American Mathematical Monthly 87 (1980), 640–644.
F. E. Su: Rental harmony: Sperner’s lemma in fair division, American Mathematical Monthly 106 (1999), 930–942.
G. Tardos: Transversals of 2-intervals, a topological approach, Combinatorica 15 (1995), 123–134.
D. R. Woodall: Dividing a cake fairly, Journal of Mathematical Analysis and Applications 78 (1980), 233–247.
Acknowledgements
We are grateful to Frédéric Meunier and Dmitry Fa-likman for helpful and instructive discussions. We also thank users Trebor, Tortar and Piquito from math stackexchange7 for their technical help. We are grateful to the anonymous referees of Combinatorica for their detailed comments on the initial version of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional 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).
Shira Zerbib was supported by NSF grant DMS-1953929.
R. Aharoni, E. Berger and S. Zerbib are supported by BSF grant no. 2016077.
Rights and permissions
About this article
Cite this article
Aharoni, R., Berger, E., Briggs, J. et al. Fractionally Balanced Hypergraphs and Rainbow KKM Theorems. Combinatorica 42 (Suppl 1), 913–951 (2022). https://doi.org/10.1007/s00493-021-4808-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-021-4808-y