The structure of Sperner k-families
From MaRDI portal
Publication:5966939
DOI10.1016/0097-3165(76)90077-7zbMath0361.05016OpenAlexW2021115540WikidataQ56679825 ScholiaQ56679825MaRDI QIDQ5966939
Daniel J. Kleitman, Curtis Greene
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)90077-7
Related Items
Unichain coverings in partial orders with the nested saturation property, Scheduling jobs with fixed start and end times, Note on maximal split-stable subgraphs, Motivations and history of some of my conjectures, Families of chains of a poset and Sperner properties, The maximum k-colorable subgraph problem for chordal graphs, Switchdec polyhedra, Problems on chain partitions, Algorithmic aspects of the generalized clique-transversal problem on chordal graphs, Chain lengths in the dominance lattice, On box-perfect graphs, A short proof of the existence of k-saturated partitions of partially ordered sets, Tableau evacuation and webs, Critical graphs for chromatic difference sequences, Excluded-minor characterizations of antimatroids arisen from posets and graph searches., Product partial orders with the Sperner property, A structure theory for ordered sets, Berge's conjecture on directed path partitions -- a survey, On the lattice of order ideals of an up-down poset, Analogues of Milner's theorem for families without long chains and of vector spaces, Matrix-ball construction of affine Robinson-Schensted correspondence, Coflow polyhedra, The 0-1 inverse maximum stable set problem, On Greene-Kleitman's theorem for general digraphs, The max-flow min-cut property of two-dimensional affine convex geometries, Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs, Finite posets and Ferrers shapes, An extension of Schensted's theorem, On the size of maximal chains and the number of pairwise disjoint maximal antichains, On the size of maximal antichains and the number of pairwise disjoint maximal chains, Two easy duality theorems for product partial orders, Another proof of Dilworth's decomposition theorem, Research problems, A min-max relation for the partial q-colourings of a graph. II: Box perfection, Greene-Kleitman invariants for Sulzgruber insertion, Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers, The Sperner property for posets: A probabilistic approach, Approximating minimum cocolorings., Homomorphisms of 3-chromatic graphs, The chromatic difference sequence of the Cartesian product of graphs, Some sequences associated with combinatorial structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An application of Dilworth's lattice of maximal antichains
- Graphs and matching theorems
- Transversal theory. An account of some aspects of combinatorial mathematics
- Maximal sized antichains in partial orders
- A decomposition theorem for partially ordered sets
- Transversals and matroid partition
- On a lemma of Littlewood and Offord
