Multilabeled Versions of Sperner's and Fan's Lemmas and Applications
From MaRDI portal
Publication:5234532
Abstract: We propose a general technique related to the polytopal Sperner lemma for proving old and new multilabeled versions of Sperner's lemma. A notable application of this technique yields a cake-cutting theorem where the number of players and the number of pieces can be independently chosen. We also prove multilabeled versions of Fan's lemma, a combinatorial analogue of the Borsuk-Ulam theorem, and exhibit applications to fair division and graph coloring.
Recommendations
- scientific article; zbMATH DE number 5639861
- On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
- scientific article; zbMATH DE number 4066896
- scientific article; zbMATH DE number 4111577
- Generalizations of Tucker-Fan-Shashkin lemmas
- A polytopal generalization of Sperner's lemma
- A generalization of Fiedler's lemma and some applications
- A New Version of the Multivalued Fatou Lemma
- Multiplicity one theorems, \(S\)-version
- Farkas' lemma and multilinear forms
Cites work
- scientific article; zbMATH DE number 3102257 (Why is no real title available?)
- A Borsuk-Ulam equivalent that directly implies Sperner's lemma
- A Moment Problem in L 1 Approximation
- A constructive proof of Ky Fan's generalization of Tucker's lemma
- A constructive proof of a permutation-based generalization of Sperner's lemma
- A counting lemma and multiple combinatorial Stokes' theorem
- A generalization of Tucker's combinatorial lemma with topological applications
- A polytopal generalization of Sperner's lemma
- Achieving rental harmony with a secretive roommate
- Bisection of Circle Colorings
- Colorful subhypergraphs in uniform hypergraphs
- Colourful theorems and indices of homomorphism complexes
- Combinatorial necklace splitting
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- Dividing a cake fairly
- Equilibrium in a discrete exchange economy with money
- Equivalent Formulations of the Borsuk-Ulam Theorem
- Fair division and generalizations of Sperner- and KKM-type results
- How to Cut a Cake Fairly
- Kneser's conjecture, chromatic number, and homotopy
- Local chromatic number, Ky Fan's theorem, and circular colorings
- Necklace bisection with one cut less than needed
- Oriented matroids and Ky Fan's theorem
- Rental Harmony: Sperner's Lemma in Fair Division
- STRENGTHENING OF SPERNER'S LEMMA APPLIED TO HOMOLOGY THEORY
- Splitting multidimensional necklaces
- Splitting necklaces
- Strengthening topological colorful results for graphs
- The Borsuk-Ulam Theorem and Bisection of Necklaces
Cited in
(16)- A tree Sperner lemma
- scientific article; zbMATH DE number 5878223 (Why is no real title available?)
- Envy-free division in the presence of a dragon
- Discrete geometry. Abstracts from the workshop held September 20--26, 2020 (hybrid meeting)
- Fair division and generalizations of Sperner- and KKM-type results
- Sperner labellings: A combinatorial approach
- Generalized rental harmony
- scientific article; zbMATH DE number 4066896 (Why is no real title available?)
- Envy-free division of multi-layered cakes
- Sperner's colorings and optimal partitioning of the simplex
- How to cut a cake fairly: a generalization to groups
- A Borsuk-Ulam equivalent that directly implies Sperner's lemma
- A sparse colorful polytopal KKM theorem
- Rental Harmony: Sperner's Lemma in Fair Division
- Fair distributions for more participants than allocations
- scientific article; zbMATH DE number 5639861 (Why is no real title available?)
This page was built for publication: Multilabeled Versions of Sperner's and Fan's Lemmas and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5234532)
