Families in posets minimizing the number of comparable pairs

DOI10.1002/jgt.22604zbMath1525.05183arXiv1703.05427OpenAlexW3037411436MaRDI QIDQ6134650

Adam Zsolt Wagner, József Balogh, Sarka Petrickova

Publication date: 22 August 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.05427

zbMATH Keywords

posetBoolean latticeSperner's theoremKleitman's theoremcomparable pair

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (1)

Supersaturation in posets and applications involving the container method

Cites Work

• Unnamed Item
• Unnamed Item
• Comparable pairs in families of sets
• Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains
• Supersaturation in posets and applications involving the container method
• A Unimodality Result in the Enumeration of Subgroups of a Finite Abelian Group
• Subsets of posets minimising the number of chains
• Supersaturation in the Boolean lattice
• Sperner's Theorem and a Problem of Erdős, Katona and Kleitman

This page was built for publication: Families in posets minimizing the number of comparable pairs