Supersaturation, counting, and randomness in forbidden subposet problems

DOI10.37236/9715zbMath1459.05324arXiv2007.06854OpenAlexW3043627167MaRDI QIDQ2656893

Balázs Patkós, Dániel T. Nagy, Dániel Gerbner, Máté Vizer

Publication date: 17 March 2021

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

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

zbMATH Keywords

forbidden subposet problemsforbidden inclusion pattern

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (1)

On some extremal and probabilistic questions for tree posets

Cites Work

• Unnamed Item
• Unnamed Item
• A random version of Sperner's theorem
• Supersaturation and stability for forbidden subposet problems.
• Diamond-free families
• Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)
• Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains
• The partition method for poset-free families
• Induced and non-induced forbidden subposet problems
• Set families with a forbidden subposet
• 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
• On a lemma of Littlewood and Offord

This page was built for publication: Supersaturation, counting, and randomness in forbidden subposet problems