On nested chain decompositions of normalized matching posets of rank 3

DOI10.1007/s11083-010-9164-2zbMath1232.06008MaRDI QIDQ634742

Andreea Cristina Nicolae, Paul Russell Salerno, Shahriar Shahriari, Elinor Gardner Escamilla, Jordan Olliver Tirrell

Publication date: 16 August 2011

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-010-9164-2

zbMATH Keywords

chain decompositions; Griggs nesting conjecture; LYM property; nested posets; normalized matching property; saturated partition

Mathematics Subject Classification ID

06A07: Combinatorics of partially ordered sets

05D05: Extremal set theory

05D15: Transversal (matching) theory

Related Items

On the duality of semiantichains and unichain coverings., Some remarks on nestings in the normalized matching posets of rank 3, News about Semiantichains and Unichain Coverings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on normalized matching
• The generalized Füredi conjecture holds for finite linear lattices
• Methods for nesting rank 3 normalized matching rank-unimodal posets
• Problems on chain partitions
• A short proof of the existence of k-saturated partitions of partially ordered sets
• On chains and Sperner k-families in ranked posets
• On the lattice of order ideals of an up-down poset
• The morphology of partially ordered sets
• Strong versions of Sperner's theorem
• Nested chain partitions of LYM posets
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• Matchings, cutsets, and chain partitions in graded posets
• Logarithmic order of free distributive lattice
• Sufficient Conditions for a Symmetric Chain Order
• Normalized Matching in Direct Products of Partial Orders
• On generalized graphs
• A short proof of Sperner's lemma
• Some Results on Matching in Bipartite Graphs