On a conjecture on the Sperner property
A finite partially ordered set P has the Sperner property if the maximum cardinality of antichains in P equals the maximum cardinality of sets of elements in P with the same rank. \textit{Ko-Wei Lih} [J. Comb. Theory, Ser. A 29, 182-185 (1980; Zbl 0446.05002)] proved that if P is the set of all subsets of an n-element set with set inclusion as order relation, and F is an order filter in P generated by a collection of elements in P with the same rank \(t=1\), then F has the Sperner property; he conjectured also that the same holds for \(t>1\). Here it is shown by counterexamples that this conjecture is false if \(t\geq 4\) and that it is right if \(t=2\) or \(t=3\) in some special cases.
- On Lih's conjecture concerning Spernerity
- Nested chain partitions of Hamiltonian filters
- The numbers of dependent \(k\)-sets in a graph are log concave
- Tight bounds for Katona's shadow intersection theorem
- scientific article; zbMATH DE number 3851159 (Why is no real title available?)
- scientific article; zbMATH DE number 3877243 (Why is no real title available?)
- scientific article; zbMATH DE number 4213994 (Why is no real title available?)
- scientific article; zbMATH DE number 3920476 (Why is no real title available?)
- scientific article; zbMATH DE number 4066896 (Why is no real title available?)
- scientific article; zbMATH DE number 1382572 (Why is no real title available?)
- scientific article; zbMATH DE number 1235078 (Why is no real title available?)
- An improvement on a Spernerity proof of Horrocks
This page was built for publication: On a conjecture on the Sperner property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264161)
