Combinatorial formulae for multiple set-valued labellings

DOI10.1007/BF01445093zbMath0791.05007MaRDI QIDQ1318097

V. Pereyra

Publication date: 26 April 1994

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/165073

zbMATH Keywords

covering theoremGale theoremmultiple set-valued labellingsposition mapsShapley theoremSperner combinatorial lemma

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Extremal set theory (05D05) Enumerative combinatorics (05A99) General position and transversality (57Q65)

Related Items (3)

Equilibrium in a market game ⋮ A note on the core ⋮ A sparse colorful polytopal KKM theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of Tychonoff's fixed point theorem
• Equilibrium in a discrete exchange economy with money
• A constructive proof of a permutation-based generalization of Sperner's lemma
• A combinatorial Lefschetz fixed-point formula
• STRENGTHENING OF SPERNER'S LEMMA APPLIED TO HOMOLOGY THEORY
• On Representatives of Subsets
• Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation
• On the Sperner lemma
• The Core of an N Person Game

This page was built for publication: Combinatorial formulae for multiple set-valued labellings