On Families of Subsets With a Forbidden Subposet
From MaRDI portal
Publication:3552501
DOI10.1017/S096354830999037XzbMath1215.05082arXiv0807.3702OpenAlexW2120695274MaRDI QIDQ3552501
Publication date: 22 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.3702
Related Items (35)
Forbidden induced subposets of given height ⋮ Three layer \(Q _{2}\)-free families in the Boolean lattice ⋮ Set Families With a Forbidden Induced Subposet ⋮ Schröder partitions, Schröder tableaux and weak poset patterns ⋮ Supersaturation, counting, and randomness in forbidden subposet problems ⋮ Sperner type theorems with excluded subposets ⋮ Incomparable copies of a poset in the Boolean lattice. ⋮ Uniform chain decompositions and applications ⋮ Forbidden subposet problems with size restrictions ⋮ Poset Ramsey numbers: large Boolean lattice versus a fixed poset ⋮ The covering lemma and q-analogues of extremal set theory problems ⋮ On some extremal and probabilistic questions for tree posets ⋮ An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications ⋮ 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 ⋮ Diamond-free families ⋮ Turán problems on non-uniform hypergraphs ⋮ On crown-free families of subsets ⋮ Set families with forbidden subposets ⋮ Boolean algebras and Lubell functions ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ Induced and non-induced forbidden subposet problems ⋮ Forbidden subposet problems for traces of set families ⋮ Forbidding rank-preserving copies of a poset ⋮ Ramsey numbers for partially-ordered sets ⋮ Some Motzkin-Straus type results for non-uniform hypergraphs ⋮ A simple proof for a forbidden subposet problem ⋮ Induced and non-induced poset saturation problems ⋮ Forbidden subposet problems in the grid ⋮ \(Q _{2}\)-free families in the Boolean lattice ⋮ 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\)
- A note on an inequality involving the normal distribution
- Correlation inequalities on some partially ordered sets
- An extremal problem with excluded subposet in the Boolean lattice
- 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 a lemma of Littlewood and Offord
- On the structure of linear graphs
This page was built for publication: On Families of Subsets With a Forbidden Subposet