Supersaturation, counting, and randomness in forbidden subposet problems

DOI10.1007/978-3-030-83823-2_30MaRDI QIDQ6604693zbMATH OpenFDO

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

Publication date 13 September 2024

zbMATH Keywords

extremal set theorysupersaturationforbidden subposet problem

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites work

• scientific article; zbMATH DE number 3845613 (Why is no real title available?)
• scientific article; zbMATH DE number 3825713 (Why is no real title available?)
• A random version of Sperner's theorem
• Ein Satz über Untermengen einer endlichen Menge.
• Induced and non-induced forbidden subposet problems
• Maximum-size antichains in random set-systems
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• On a combinatorial conjecture of Erdös
• On a lemma of Littlewood and Offord
• On families of subsets with a forbidden subposet
• Set families with a forbidden subposet
• Sperner's theorem and a problem of Erdős, Katona and Kleitman
• Subsets of posets minimising the number of chains
• Supersaturation in the Boolean lattice

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604693)