Add to ORKGSperner lemma type theorems are proved for nonoriented primoids and pseudomanifolds. A rank function of a primoid is defined. Applications of these theorems to the geometric simplex are given. Also Knaster-Kuratowski-Mazurkiewicz type theorems on covering of the geometric simplex are presented
AbstractA combinatorial criterion for polynomial growth of partially ordered sets which are not simp...
In this paper, we present a combinatorial theorem on a bounded polyhedron for an unrestricted intege...
Abstract. We present a beautiful interplay between combinatorial topology and homological algebra fo...
A solid combinatorial theory is presented. The generalized Sperner lemma for chains is derived from ...
AbstractDuring the last 50 years several combinatorial theorems have been proved which have provided...
AbstractA brief proof is given of a generalization of Sperner's lemma to certain finite partially or...
In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal ...
AbstractIn this paper we present a self-contained combinatorial proof of the lower bound theorem for...
The Sperner and Tucker lemmas are combinatorial analogous of the Brouwer and Borsuk- Ulam theorems w...
We show that theorems of Lovász [4] and Lindström [3] are direct consequences of earlier, non-matroi...
We answer the following question: Let P and Q be graded posets having some property and let ffi be s...
A combinatorial result is proved which generalizes a theorem of Ky Fan on simplicial maps from a pse...
AbstractTwo cubical versions of Sperner's lemma, due to Kuhn and Fan, are proved constructively with...
The main result in this thesis is the generalisation of Bergman's diamond lemma for ring theory to p...
Abstract. We discuss Sperner’s Lemma in the form of two differ-ent proofs. Connections can be made t...
AbstractA combinatorial criterion for polynomial growth of partially ordered sets which are not simp...
In this paper, we present a combinatorial theorem on a bounded polyhedron for an unrestricted intege...
Abstract. We present a beautiful interplay between combinatorial topology and homological algebra fo...
A solid combinatorial theory is presented. The generalized Sperner lemma for chains is derived from ...
AbstractDuring the last 50 years several combinatorial theorems have been proved which have provided...
AbstractA brief proof is given of a generalization of Sperner's lemma to certain finite partially or...
In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal ...
AbstractIn this paper we present a self-contained combinatorial proof of the lower bound theorem for...
The Sperner and Tucker lemmas are combinatorial analogous of the Brouwer and Borsuk- Ulam theorems w...
We show that theorems of Lovász [4] and Lindström [3] are direct consequences of earlier, non-matroi...
We answer the following question: Let P and Q be graded posets having some property and let ffi be s...
A combinatorial result is proved which generalizes a theorem of Ky Fan on simplicial maps from a pse...
AbstractTwo cubical versions of Sperner's lemma, due to Kuhn and Fan, are proved constructively with...
The main result in this thesis is the generalisation of Bergman's diamond lemma for ring theory to p...
Abstract. We discuss Sperner’s Lemma in the form of two differ-ent proofs. Connections can be made t...
AbstractA combinatorial criterion for polynomial growth of partially ordered sets which are not simp...
In this paper, we present a combinatorial theorem on a bounded polyhedron for an unrestricted intege...
Abstract. We present a beautiful interplay between combinatorial topology and homological algebra fo...