Three layer \(Q _{2}\)-free families in the Boolean lattice
From MaRDI portal
Publication:2376901
DOI10.1007/s11083-012-9263-3zbMath1282.06008arXiv1108.4373OpenAlexW1972409259MaRDI QIDQ2376901
Publication date: 26 June 2013
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.4373
Related Items (6)
Exact forbidden subposet results using chain decompositions of the cycle ⋮ An upper bound on the size of diamond-free families of sets ⋮ Diamond-free subsets in the linear lattices ⋮ Turán problems on non-uniform hypergraphs ⋮ Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube ⋮ Abelian groups yield many large families for the diamond problem
Cites Work
- Unnamed Item
- Diamond-free families
- \(Q _{2}\)-free families in the Boolean lattice
- Strong versions of Sperner's theorem
- An extremal problem with excluded subposet in the Boolean lattice
- The partition method for poset-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\)
- On Families of Subsets With a Forbidden Subposet
- On a lemma of Littlewood and Offord
This page was built for publication: Three layer \(Q _{2}\)-free families in the Boolean lattice