We prove the following conjecture of Atanassov (Studia Sci. Math. Hungar.32 (1996), 71–74). Let T be a triangulation of a d-dimensional polytope P with n vertices v1, v2,…,vn. Label the vertices of T by 1,2,…,n in such a way that a vertex of T belonging to the interior of a face F of P can only be labelled by j if vj is on F. Then there are at least n−d full dimensional simplices of T, each labelled with d+1 different labels. We provide two proofs of this result: a non-constructive proof introducing the notion of a pebble set of a polytope, and a constructive proof using a path-following argument. Our non-constructive proof has interesting relations to minimal simplicial covers of convex polyhedra and their chamber complexes, as in Alekseye...
summary:We prove an extension of the well-known combinatorial-topological lemma of E. Sperner to the...
AbstractThe classic Sperner lemma states that in a simplicial subdivision of a simplex in Rn and a l...
We study -vertex -dimensional polytopes with at most one nonsimplex facet with, say, vertices, calle...
AbstractWe prove the following conjecture of Atanassov (Studia Sci. Math. Hungar.32 (1996), 71–74). ...
AbstractIn 2002, De Loera, Peterson and Su proved the following conjecture of Atanassov: let T be a ...
We introduce and prove Sperner’s lemma, the well known combinatorial analogue of the Brouwer fixed p...
AbstractIn 1989, Robert W. Freund published an article about generalizations of the Sperner lemma fo...
International audienceIn 1989, Robert W. Freund published an article about generalizations of the Sp...
The well known Sperner lemma states that in a simplicial subdivision of a simplex with a properly la...
We consider a generalization of Sperner\u27s lemma for triangulations of m-discs whose vertices are ...
In this paper, we present a combinatorial theorem on a bounded polyhedron for an unrestricted intege...
We formulate general boundary conditions for a labelling of vertices of a triangulation of a polyhed...
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
Given a polytope P in R^d and a subset U of its vertices, is there a triangulation of P using d-simp...
International audienceSimultaneously generalizing both neighborly and neighborly cubical polytopes, ...
summary:We prove an extension of the well-known combinatorial-topological lemma of E. Sperner to the...
AbstractThe classic Sperner lemma states that in a simplicial subdivision of a simplex in Rn and a l...
We study -vertex -dimensional polytopes with at most one nonsimplex facet with, say, vertices, calle...
AbstractWe prove the following conjecture of Atanassov (Studia Sci. Math. Hungar.32 (1996), 71–74). ...
AbstractIn 2002, De Loera, Peterson and Su proved the following conjecture of Atanassov: let T be a ...
We introduce and prove Sperner’s lemma, the well known combinatorial analogue of the Brouwer fixed p...
AbstractIn 1989, Robert W. Freund published an article about generalizations of the Sperner lemma fo...
International audienceIn 1989, Robert W. Freund published an article about generalizations of the Sp...
The well known Sperner lemma states that in a simplicial subdivision of a simplex with a properly la...
We consider a generalization of Sperner\u27s lemma for triangulations of m-discs whose vertices are ...
In this paper, we present a combinatorial theorem on a bounded polyhedron for an unrestricted intege...
We formulate general boundary conditions for a labelling of vertices of a triangulation of a polyhed...
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
Given a polytope P in R^d and a subset U of its vertices, is there a triangulation of P using d-simp...
International audienceSimultaneously generalizing both neighborly and neighborly cubical polytopes, ...
summary:We prove an extension of the well-known combinatorial-topological lemma of E. Sperner to the...
AbstractThe classic Sperner lemma states that in a simplicial subdivision of a simplex in Rn and a l...
We study -vertex -dimensional polytopes with at most one nonsimplex facet with, say, vertices, calle...