Combinatorial Lemmas for Polyhedrons

DOI10.7151/DMGT.1264MaRDI QIDQ5316263zbMATH OpenOpenAlexWikidataFDO

Authors Adam Idzik, Konstanty Junosza-Szaniawski

Publication date 12 September 2005

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/50625b44900052e21ca6e8888acf9450e9df1e9d

zbMATH Keywords

simplicial complexKKM coveringSperner lemmapseudomanifoldlabellingprimoid

Mathematics Subject Classification ID

Other designs, configurations (05B30) Fixed-point theorems (47H10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Fixed-point and coincidence theorems (topological aspects) (54H25)

Recommendations

• Existence of balanced simplices on polytopes.
• Combinatorial lemmas for polyhedrons I
• Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
• Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
• Combinatorial lemmas for nonoriented pseudomanifolds

Cited in

(4)

• Combinatorial lemmas for polyhedrons I
• Existence of balanced simplices on polytopes.
• scientific article; zbMATH DE number 6991368 (Why is no real title available?)
• Combinatorial lemmas for oriented complexes

This page was built for publication: Combinatorial Lemmas for Polyhedrons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316263)