Investigating posets via their maximal chains

DOI10.1007/s11083-019-09506-2zbMath1481.06005OpenAlexW2981498581WikidataQ127025206 ScholiaQ127025206MaRDI QIDQ781532

Seyed Hadi Afzali Borujeni, Nathan Bowler

Publication date: 17 July 2020

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-019-09506-2

zbMATH Keywords

maximal chainsSperner's theoremLYM inequality

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Related Items (1)

On the transitivity coefficients for minimal posets with nonpositive quadratic Tits form

Cites Work

• Convex hulls of more-part Sperner families
• A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains
• Logarithmic order of free distributive lattice
• On generalized graphs
• A short proof of Sperner's lemma
• SPERNER FAMILIES, s‐SYSTEMS, AND A THEOREM OF MESHALKIN†
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• On a lemma of Littlewood and Offord
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Investigating posets via their maximal chains