Combinatorial lemmas for polyhedrons I

DOI10.7151/DMGT.1336zbMATH Open1135.52002OpenAlexW4248355223WikidataQ124813046 ScholiaQ124813046MaRDI QIDQ5437227FDOQ5437227

Adam Idzik, Konstanty Junosza-Szaniawski

Publication date: 18 January 2008

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

Full work available at URL: https://semanticscholar.org/paper/6f2c1a386e9ae9efde31f2d4e4059370eaafb207

zbMATH Keywords

simplicial complextriangulationconvex polytopeSperner's lemmalabellingbalanced simplex

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)

Cited In (5)

• Combinatorial Lemmas for Polyhedrons
• Existence of balanced simplices on polytopes.
• Title not available (Why is that?)
• Projectivities in simplicial complexes and colorings of simple polytopes
• Generalizing the Poincaré-Miranda theorem: the avoiding cones condition

   Recommendations

• Existence of balanced simplices on polytopes. 👍 👎
• Combinatorial Lemmas for Polyhedrons 👍 👎
• ORIENTABILITY OF PSEUDOMANIFOLD AND GENERALIZATIONS OF SPERNER'S LEMMA 👍 👎
• Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron 👍 👎
• Combinatorial lemmas for nonoriented pseudomanifolds 👍 👎

This page was built for publication: Combinatorial lemmas for polyhedrons I

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