Diamond-free families
From MaRDI portal
Publication:654889
DOI10.1016/j.jcta.2011.09.002zbMath1235.05144arXiv1010.5311OpenAlexW2168216008MaRDI QIDQ654889
Jerrold R. Griggs, Linyuan Lu, Wei-Tian Li
Publication date: 23 December 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.5311
Related Items
Intersecting \(P\)-free families ⋮ Forbidden induced subposets of given height ⋮ Three layer \(Q _{2}\)-free families in the Boolean lattice ⋮ Supersaturation, counting, and randomness in forbidden subposet problems ⋮ On Generalized Turán Results in Height Two Posets ⋮ Minimum weight flat antichains of subsets ⋮ Sperner type theorems with excluded subposets ⋮ Incomparable copies of a poset in the Boolean lattice. ⋮ Packing posets in the Boolean lattice. ⋮ Forbidden subposet problems with size restrictions ⋮ A LYM inequality for induced posets ⋮ On some extremal and probabilistic questions for tree posets ⋮ Exact forbidden subposet results using chain decompositions of the cycle ⋮ An upper bound on the size of diamond-free families of sets ⋮ Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems ⋮ The partition method for poset-free families ⋮ Diamond-free subsets in the linear lattices ⋮ Turán problems on non-uniform hypergraphs ⋮ On crown-free families of subsets ⋮ A note on the largest size of families of sets with a forbidden poset ⋮ Set families with forbidden subposets ⋮ Boolean algebras and Lubell functions ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ 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 ⋮ Ramsey numbers for partially-ordered sets ⋮ A simple proof for a forbidden subposet problem ⋮ Avoiding brooms, forks, and butterflies in the linear lattices ⋮ Generalized forbidden subposet problems ⋮ Rainbow Ramsey problems for the Boolean lattice ⋮ Poset-free families and Lubell-boundedness ⋮ Abelian groups yield many large families for the diamond problem
Cites Work
- Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)
- An extremal problem with excluded subposet in the Boolean lattice
- 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\)
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
- On Families of Subsets With a Forbidden Subposet
- A short proof of Sperner's lemma
- On a lemma of Littlewood and Offord
- Unnamed Item
- Unnamed Item
- Unnamed Item
