Geodesic
Combinatorial lemmas for polyhedrons
Discussiones Mathematicae. Graph Theory, Tome 25 (2005) no. 1-2, pp. 95-102

Voir la notice de l'article provenant de la source Library of Science

We formulate general boundary conditions for a labelling to assure the existence of a balanced n-simplex in a triangulated polyhedron. Furthermore we prove a Knaster-Kuratowski-Mazurkiewicz type theorem for polyhedrons and generalize some theorems of Ichiishi and Idzik. We also formulate a necessary condition for a continuous function defined on a polyhedron to be an onto function.
Keywords: KKM covering, labelling, primoid, pseudomanifold, simplicial complex, Sperner lemma 
@article{DMGT_2005_25_1-2_a10,
     author = {Idzik, Adam and Junosza-Szaniawski, Konstanty},
     title = {Combinatorial lemmas for polyhedrons},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {95--102},
     publisher = {mathdoc},
     volume = {25},
     number = {1-2},
     year = {2005},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2005_25_1-2_a10/}
}
TY  - JOUR
AU  - Idzik, Adam
AU  - Junosza-Szaniawski, Konstanty
TI  - Combinatorial lemmas for polyhedrons
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2005
SP  - 95
EP  - 102
VL  - 25
IS  - 1-2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2005_25_1-2_a10/
LA  - en
ID  - DMGT_2005_25_1-2_a10
ER  - 
%0 Journal Article
%A Idzik, Adam
%A Junosza-Szaniawski, Konstanty
%T Combinatorial lemmas for polyhedrons
%J Discussiones Mathematicae. Graph Theory
%D 2005
%P 95-102
%V 25
%N 1-2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2005_25_1-2_a10/
%G en
%F DMGT_2005_25_1-2_a10
Idzik, Adam; Junosza-Szaniawski, Konstanty. Combinatorial lemmas for polyhedrons. Discussiones Mathematicae. Graph Theory, Tome 25 (2005) no. 1-2, pp. 95-102. http://geodesic.mathdoc.fr/item/DMGT_2005_25_1-2_a10/