DOIAbstract
AbstractA brief proof is given of a generalization of Sperner's lemma to certain finite partially ordered sets
AbstractA brief proof is given of a generalization of Sperner's lemma to certain finite partially ordered sets
AbstractKatona has proven a generalization of Sperner's theorem concerning the maximum size of a col...
The well known Sperner lemma states that in a simplicial subdivision of a simplex with a properly la...
Sperner lemma type theorems are proved for nonoriented primoids and pseudomanifolds. A rank function...
AbstractA brief proof is given of a generalization of Sperner's lemma to certain finite partially or...
AbstractBy introducing an inner product on the linear space of real valued functions on a finite par...
AbstractMotivated by the problem of estimating the age (in generations) of a population that evolves...
AbstractSufficient conditions are established for the product of two ranked partially ordered sets t...
A solid combinatorial theory is presented. The generalized Sperner lemma for chains is derived from ...
Gives the basic definitions and theorems of similar partially ordered sets; studies finite partially...
Sperner's lemma is a ccombinatorial variant of Brouwer's fixed point theorem. In this paper we prese...
If P is a partially ordered set, a k-family of P is a subset which contains no chains of length k + ...
summary:We prove an extension of the well-known combinatorial-topological lemma of E. Sperner to the...
We introduce and prove Sperner’s lemma, the well known combinatorial analogue of the Brouwer fixed p...
available for noncommercial, educational purposes, provided that this copyright statement appears on...
We provide a novel proof of Sperner’s Lemma that is intuitive and elementary if certain simple prope...
AbstractKatona has proven a generalization of Sperner's theorem concerning the maximum size of a col...
The well known Sperner lemma states that in a simplicial subdivision of a simplex with a properly la...
Sperner lemma type theorems are proved for nonoriented primoids and pseudomanifolds. A rank function...
AbstractA brief proof is given of a generalization of Sperner's lemma to certain finite partially or...
AbstractBy introducing an inner product on the linear space of real valued functions on a finite par...
AbstractMotivated by the problem of estimating the age (in generations) of a population that evolves...
AbstractSufficient conditions are established for the product of two ranked partially ordered sets t...
A solid combinatorial theory is presented. The generalized Sperner lemma for chains is derived from ...
Gives the basic definitions and theorems of similar partially ordered sets; studies finite partially...
Sperner's lemma is a ccombinatorial variant of Brouwer's fixed point theorem. In this paper we prese...
If P is a partially ordered set, a k-family of P is a subset which contains no chains of length k + ...
summary:We prove an extension of the well-known combinatorial-topological lemma of E. Sperner to the...
We introduce and prove Sperner’s lemma, the well known combinatorial analogue of the Brouwer fixed p...
available for noncommercial, educational purposes, provided that this copyright statement appears on...
We provide a novel proof of Sperner’s Lemma that is intuitive and elementary if certain simple prope...
AbstractKatona has proven a generalization of Sperner's theorem concerning the maximum size of a col...
The well known Sperner lemma states that in a simplicial subdivision of a simplex with a properly la...
Sperner lemma type theorems are proved for nonoriented primoids and pseudomanifolds. A rank function...
Add to ORKG