Publication date
March 1969
DOI Publisher
Published by Elsevier Inc. ISSN
0021-9800Abstract
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
AbstractLet F be a Sperner family of subsets of {1,…,m}. Bollobás showed that if A ∈ F ⇒ A = {1,…,m}...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
We show that theorems of Lovász [4] and Lindström [3] are direct consequences of earlier, non-matroi...
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...
AbstractIt has been conjectured that the analog of Sperner's theorem on non-comparable subsets of a ...
AbstractConsider any sets x⊆y⊆{1,…,n}. Remove the interval [x,y]={z⊆y|x⊆z} from the Boolean lattice ...
AbstractIf P is a partially ordered set, a k-family of P is a subset which contains no chains of len...
The Boolean lattice has many applications in computer science. The subsets of a Boolean lattice tha...
Let L be a finite geometric lattice of dimension n, and let w(k) denote the number of elements in L ...
AbstractLet |X| = n > 0, |Y| = k > 0, and Y ⊆ X. A family A of subsets of X is a Sperner family of X...
We introduce and prove Sperner’s lemma, the well known combinatorial analogue of the Brouwer fixed p...
In 1967 Herbert Scarf suggested a new proof of Brouwer's fixed point theorem based on a combinatoria...
The LYM property of a finite standard graded poset is one of the central notions in Sperner theory. ...
AbstractLet F be a Sperner family of subsets of {1,…,m}. Bollobás showed that if A ∈ F ⇒ A = {1,…,m}...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
We show that theorems of Lovász [4] and Lindström [3] are direct consequences of earlier, non-matroi...
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...
AbstractIt has been conjectured that the analog of Sperner's theorem on non-comparable subsets of a ...
AbstractConsider any sets x⊆y⊆{1,…,n}. Remove the interval [x,y]={z⊆y|x⊆z} from the Boolean lattice ...
AbstractIf P is a partially ordered set, a k-family of P is a subset which contains no chains of len...
The Boolean lattice has many applications in computer science. The subsets of a Boolean lattice tha...
Let L be a finite geometric lattice of dimension n, and let w(k) denote the number of elements in L ...
AbstractLet |X| = n > 0, |Y| = k > 0, and Y ⊆ X. A family A of subsets of X is a Sperner family of X...
We introduce and prove Sperner’s lemma, the well known combinatorial analogue of the Brouwer fixed p...
In 1967 Herbert Scarf suggested a new proof of Brouwer's fixed point theorem based on a combinatoria...
The LYM property of a finite standard graded poset is one of the central notions in Sperner theory. ...
AbstractLet F be a Sperner family of subsets of {1,…,m}. Bollobás showed that if A ∈ F ⇒ A = {1,…,m}...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
We show that theorems of Lovász [4] and Lindström [3] are direct consequences of earlier, non-matroi...
Add to ORKG