Exact forbidden subposet results using chain decompositions of the cycle
From MaRDI portal
Publication:907216
zbMath1329.05293arXiv1411.0415MaRDI QIDQ907216
Abhishek Methuku, Casey Tompkins
Publication date: 25 January 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.0415
Related Items
Largest family without a pair of posets on consecutive levels of the Boolean lattice, Poset Ramsey numbers: large Boolean lattice versus a fixed poset, An upper bound on the size of diamond-free families of sets, Families of subsets without a given poset in double chains and Boolean lattices, Forbidding rank-preserving copies of a poset, On forbidden poset problems in the linear lattice, A simple proof for a forbidden subposet problem, Avoiding brooms, forks, and butterflies in the linear lattices, Generalized forbidden subposet problems
Cites Work
- Unnamed Item
- Diamond-free families
- \(Q _{2}\)-free families in the Boolean lattice
- 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
- On diamond-free subposets of the Boolean lattice
- Induced and non-induced forbidden subposet problems
- Three layer \(Q _{2}\)-free families in the Boolean lattice
- Set families with a forbidden subposet
- No four subsets forming an \(N\)
- On crown-free families of subsets
- Largest families without an \(r\)-fork
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Largest family without \(A \cup B \subseteq C \cap D\)
- Set Families With a Forbidden Induced Subposet
- Probabilities of Independent Choices Being Ordered
- Lower bounds for constant weight codes
- The method of double chains for largest families with excluded subposets
- On a lemma of Littlewood and Offord
