The generalized Füredi conjecture holds for finite linear lattices

DOI10.1016/J.DISC.2005.09.022zbMATH Open1105.05070OpenAlexW2046926085WikidataQ123343643 ScholiaQ123343643MaRDI QIDQ856864FDOQ856864

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

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

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)

Cites Work

• A course in combinatorics.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sufficient Conditions for a Symmetric Chain Order
• Partitioning the Boolean lattice into chains of large minimum size
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size

Cited In (6)

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

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)