A note on the largest size of families of sets with a forbidden poset

DOI10.1007/S11083-013-9293-5zbMATH Open1301.06005OpenAlexW2017179488MaRDI QIDQ2454051

Wei-Tian Li, Hong-Bin Chen

Publication date: 12 June 2014

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-013-9293-5

zbMATH Keywords

forbidden subposetsfamilies of subsetsdouble counting

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Cites Work

• Diamond-free families
• Set families with a forbidden subposet
• No four subsets forming an \(N\)
• Largest families without an \(r\)-fork
• Largest family without \(A \cup B \subseteq C \cap D\)
• The method of double chains for largest families with excluded subposets
• On a lemma of Littlewood and Offord

Related Items (11)

Forbidden induced subposets of given height ⋮ A note on the size of \(\mathscr{N}\)-free families ⋮ Forbidden subposet problems with size restrictions ⋮ Poset Ramsey numbers: large Boolean lattice versus a fixed poset ⋮ An upper bound on the size of diamond-free families of sets ⋮ Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems ⋮ Set families with forbidden subposets ⋮ An improvement of the general bound on the largest family of subsets avoiding a subposet ⋮ Induced and non-induced forbidden subposet problems ⋮ Families of subsets without a given poset in double chains and Boolean lattices ⋮ On forbidden poset problems in the linear lattice

This page was built for publication: A note on the largest size of families of sets with a forbidden poset