Skip to main content
Log in

A Sparse Colorful Polytopal KKM Theorem

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

Recently Soberón (Proc. Am. Math. Soc. Ser. B 9, 404–414 (2022)) proved a far-reaching generalization of the colorful KKM Theorem due to Gale (Int. J. Game Theory 13(1), 61–64 (1984)): let \(n\ge k\), and assume that a family of closed sets \((A^i_j\,|\,i\in [n],\,j\in [k])\) has the property that for every \(I\in \left( {\begin{array}{c}[n]\\ n-k+1\end{array}}\right) \), the family \(\bigl (\bigcup _{i\in I}A^i_1,\dots ,\bigcup _{i\in I}A^i_k\bigr )\) is a KKM cover of the \((k-1)\)-dimensional simplex \(\Delta ^{k-1}\); then there is an injection \(\pi :[k] \rightarrow [n]\) such that \(\bigcap _{j=1}^k A_j^{\pi (j)}\ne \emptyset \). We prove a polytopal generalization of this result, answering a question of Soberón in the same note. We also discuss applications of our theorem to fair division of multiple cakes, d-interval piercing, and a generalization of the colorful Carathéodory theorem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  1. Aharoni, R., Berger, E., Briggs, J., Segal-Halevi, E., Zerbib, S.: Fractionally balanced hypergraphs and rainbow KKM theorems. Combinatorica (2022). https://doi.org/10.1007/s00493-021-4808-y

    Article  MathSciNet  Google Scholar 

  2. Aharoni, R., Kaiser, T., Zerbib, Sh.: Fractional covers and matchings in families of weighted \(d\)-intervals. Combinatorica 37(4), 555–572 (2017)

    Article  MathSciNet  Google Scholar 

  3. Bárány, I.: A generalization of Carathéodory’s theorem. Discrete Math. 40(2–3), 141–152 (1982)

    Article  MathSciNet  Google Scholar 

  4. Frick, F., Zerbib, Sh.: Colorful coverings of polytopes and piercing numbers of colorful \(d\)-intervals. Combinatorica 39(3), 627–637 (2019)

    Article  MathSciNet  Google Scholar 

  5. Füredi, Z.: Maximum degree and fractional matchings in uniform hypergraphs. Combinatorica 1(2), 155–162 (1981)

    Article  MathSciNet  Google Scholar 

  6. Gale, D.: Equilibrium in a discrete exchange economy with money. Int. J. Game Theory 13(1), 61–64 (1984)

    Article  MathSciNet  Google Scholar 

  7. Holmsen, A.F.: The intersection of a matroid and an oriented matroid. Adv. Math. 290, 1–14 (2016)

    Article  MathSciNet  Google Scholar 

  8. Kaiser, T.: Transversals of \(d\)-intervals. Discrete Comput. Geom. 18(2), 195–203 (1997)

    Article  MathSciNet  Google Scholar 

  9. Knaster, B., Kuratowski, C., Mazurkiewicz, S.: Ein Beweis des Fixpunktsatzes für \(n\)-dimensionale Simplexe. Fundamenta Math. 14, 132–137 (1929)

    Article  Google Scholar 

  10. Komiya, H.: A simple proof of K-K-M-S theorem. Econom. Theory 4(3), 463–466 (1994)

    Article  MathSciNet  Google Scholar 

  11. Matoušek, J.: Lower bounds on the transversal numbers of \(d\)-intervals. Discrete Comput. Geom. 26(3), 283–287 (2001)

    Article  MathSciNet  Google Scholar 

  12. Nyman, K., Su, F.E., Zerbib, Sh.: Fair division with multiple pieces. Discrete Appl. Math. 283, 115–122 (2020)

    Article  MathSciNet  Google Scholar 

  13. Shapley, L.S.: On balanced games without side payments. In: Mathematical Programming (Madison 1972). Math. Res. Center Publ., vol. 30, pp. 261–290. Academic Press, New York (1973)

  14. Shih, M.-H., Lee, S.N.: Combinatorial formulae for multiple set-valued labellings. Math. Ann. 296(1), 35–61 (1993)

    Article  MathSciNet  Google Scholar 

  15. Soberón, P.: Robust Tverberg and colourful Carathéodory results via random choice. Combin. Probab. Comput. 27(3), 427–440 (2018)

    Article  MathSciNet  Google Scholar 

  16. Soberón, P.: Fair distributions for more participants than allocations. Proc. Am. Math. Soc. Ser. B 9, 404–414 (2022)

    Article  MathSciNet  Google Scholar 

  17. Sperner, E.: Neuer Beweis für die Invarianz der Dimensionszahl und des Gebietes. Abh. Math. Sem. Univ. Hamburg 6(1), 265–272 (1928)

    Article  MathSciNet  Google Scholar 

  18. Stromquist, W.: How to cut a cake fairly. Am. Math. Mon. 87(8), 640–644 (1980)

    Article  MathSciNet  Google Scholar 

  19. Tardos, G.: Transversals of \(2\)-intervals, a topological approach. Combinatorica 15(1), 123–134 (1995)

    Article  MathSciNet  Google Scholar 

  20. Woodall, D.R.: Dividing a cake fairly. J. Math. Anal. Appl. 78(1), 233–247 (1980)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Daniel McGinnis.

Additional information

Editor in Charge: Kenneth Clarkson

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

S. Zerbib was supported by NSF Grant DMS-1953929.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

McGinnis, D., Zerbib, S. A Sparse Colorful Polytopal KKM Theorem. Discrete Comput Geom 71, 945–959 (2024). https://doi.org/10.1007/s00454-022-00464-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-022-00464-y

Navigation