The generalized Füredi conjecture holds for finite linear lattices

DOI10.1016/J.DISC.2005.09.022MaRDI QIDQ856864zbMATH OpenOpenAlexWikidataFDO

Authors Tim Hsu, Mark J. Logan, Shahriar Shahriari

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

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

Recommendations

• On a conjecture of Füredi.
• Decompositions of the Boolean lattice into rank-symmetric chains.
• Chain decompositions of normalized matching posets of rank 2
• Partitioning the Boolean lattice into chains of large minimum size
• scientific article; zbMATH DE number 3851159

Cites work

• scientific article; zbMATH DE number 1016362 (Why is no real title available?)
• scientific article; zbMATH DE number 1792287 (Why is no real title available?)
• A course in combinatorics.
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• Partitioning the Boolean lattice into chains of large minimum size
• Sufficient Conditions for a Symmetric Chain Order

Cited in

(6)

• On a rank-unimodality conjecture of Morier-Genoud and Ovsienko
• Chain decompositions of normalized matching posets of rank 2
• Methods for nesting rank 3 normalized matching rank-unimodal posets
• On a rank-unimodality conjecture of Morier-Genoud and Ovsienko
• On a conjecture of Füredi.
• On nested chain decompositions of normalized matching posets of rank 3

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856864)