The generalized Füredi conjecture holds for finite linear lattices

DOI10.1016/j.disc.2005.09.022zbMath1105.05070OpenAlexW2046926085WikidataQ123343643 ScholiaQ123343643MaRDI QIDQ856864

Tim Hsu, Shahriar Shahriari, Mark J. Logan

Publication date: 14 December 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.022

zbMATH Keywords

chain decompositionsLYM propertynormalized matching property

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05) Structure theory of lattices (06B05) Transversal (matching) theory (05D15)

Related Items (3)

On nested chain decompositions of normalized matching posets of rank 3 ⋮ Methods for nesting rank 3 normalized matching rank-unimodal posets ⋮ On a conjecture of Füredi.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning the Boolean lattice into chains of large minimum size
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• Sufficient Conditions for a Symmetric Chain Order

This page was built for publication: The generalized Füredi conjecture holds for finite linear lattices