Strong versions of Sperner's theorem
From MaRDI portal
Publication:1239323
DOI10.1016/0097-3165(76)90079-0zbMath0361.05015OpenAlexW2039904522MaRDI QIDQ1239323
Curtis Greene, Daniel J. Kleitman
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(76)90079-0
Related Items (68)
The Schensted Correspondence and Lexicographic Matchings on Multisubset Lattices ⋮ A combinatorial decomposition of simplicial complexes ⋮ Applications of the symmetric chain decomposition of the lattice of divisors ⋮ Decompositions of the Boolean lattice into rank-symmetric chains. ⋮ Three layer \(Q _{2}\)-free families in the Boolean lattice ⋮ Vector colorability ⋮ Between Broadway and the Hudson: A Bijection of Corridor Paths ⋮ The order-interval hypergraph of a finite poset and the König property ⋮ Saturated chains of subsets and a random walk ⋮ Problems on chain partitions ⋮ Shortest path poset of Bruhat intervals ⋮ Nested chain partitions of Hamiltonian filters ⋮ A local injective proof of log-concavity for increasing spanning forests ⋮ Uniform chain decompositions and applications ⋮ The width of downsets ⋮ Symmetries of statistics on lattice paths between two boundaries ⋮ On chain and antichain families of a partially ordered set ⋮ Partial rank symmetry of distributive lattices for fences ⋮ Unnamed Item ⋮ On the central levels problem ⋮ On nested chain decompositions of normalized matching posets of rank 3 ⋮ On the lattice of order ideals of an up-down poset ⋮ Construction of 2-factors in the middle layer of the discrete cube ⋮ Collections of Subsets with the Sperner Property ⋮ The Boolean rainbow Ramsey number of antichains, Boolean posets and chains ⋮ On matroid intersections ⋮ Descent sets on 321-avoiding involutions and hook decompositions of partitions ⋮ On crown-free families of subsets ⋮ Mahonian pairs ⋮ Kneser graphs are Hamiltonian ⋮ Proof of a conjecture on partitions of a Boolean lattice ⋮ Hamiltonian cycles and symmetric chains in Boolean lattices. ⋮ Inclusion matrices and chains ⋮ Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron ⋮ Partitions with constrained ranks and lattice paths ⋮ Extensions of the Erdös-Ko-Rado Theorem ⋮ Matchings and the sum function ⋮ Pattern avoidance in compositions and multiset permutations ⋮ Probabilities of Independent Choices Being Ordered ⋮ The necklace poset is a symmetric chain order ⋮ On switching paths polyhedra ⋮ Some new results on the Littlewood-Offord problem ⋮ Parenthesizations of finite distributive lattices ⋮ A simple upper bound on the number of antichains in \([t^n\)] ⋮ Recursive matching algorithms and linear orders on the subset lattice ⋮ Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice ⋮ On partitions of a partially ordered set ⋮ On a rank-unimodality conjecture of Morier-Genoud and Ovsienko ⋮ On strings containing all subsets as substrings ⋮ On 1-factorizations of bipartite Kneser graphs ⋮ On a rank-unimodality conjecture of Morier-Genoud and Ovsienko ⋮ Methods for nesting rank 3 normalized matching rank-unimodal posets ⋮ On orthogonal symmetric chain decompositions ⋮ Proof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-group ⋮ Extremal problems for sets forming Boolean algebras and complete partite hypergraphs ⋮ On the multilinearity partition of an irreducible character ⋮ Orthogonal Symmetric Chain Decompositions of Hypercubes ⋮ Minimal polynomials for the conjunction of functions on disjoint variables can be very simple ⋮ \(Q _{2}\)-free families in the Boolean lattice ⋮ Minimax relations for the partial q-colorings of a graph ⋮ Gray codes and symmetric chains ⋮ On orthogonal symmetric chain decompositions ⋮ On the existence of symmetric chain decompositions in a quotient of the Boolean lattice ⋮ Symmetric chain decompositions of quotients by wreath products. ⋮ On a conjecture of Füredi. ⋮ Bijections for pairs of non-crossing lattice paths and walks in the plane ⋮ Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains ⋮ Partitioning the Boolean lattice into chains of large minimum size
Cites Work
This page was built for publication: Strong versions of Sperner's theorem
