Supersaturation, counting, and randomness in forbidden subposet problems
From MaRDI portal
Publication:6604693
DOI10.1007/978-3-030-83823-2_30MaRDI QIDQ6604693FDOQ6604693
Authors: Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer 
Publication date: 13 September 2024
Cites Work
- Title not available (Why is that?)
- On Dedekind's Problem: The Number of Monotone Boolean Functions
- Maximum-size antichains in random set-systems
- On a lemma of Littlewood and Offord
- A random version of Sperner's theorem
- On a combinatorial conjecture of Erdös
- Set families with a forbidden subposet
- Title not available (Why is that?)
- On families of subsets with a forbidden subposet
- Sperner's theorem and a problem of Erdős, Katona and Kleitman
- Supersaturation in the Boolean lattice
- Induced and non-induced forbidden subposet problems
- Subsets of posets minimising the number of chains
- Ein Satz über Untermengen einer endlichen Menge.
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)
