On some extremal and probabilistic questions for tree posets

DOI10.37236/12344arXiv2308.14863OpenAlexW4391258822WikidataQ129329993 ScholiaQ129329993MaRDI QIDQ6117424

Balázs Patkós, Andrew Treglown

Publication date: 19 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Hasse diagramSperner's theorem

Mathematics Subject Classification ID

Partial orders, general (06A06) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A random version of Sperner's theorem
• Diamond-free families
• Maximum antichains in random subsets of a finite set
• Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains
• The partition method for poset-free families
• Set families with a forbidden subposet
• Supersaturation, counting, and randomness in forbidden subposet problems
• Maximum-size antichains in random set-systems
• On Families of Subsets With a Forbidden Subposet
• 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
• On Dedekind's Problem: The Number of Monotone Boolean Functions

This page was built for publication: On some extremal and probabilistic questions for tree posets