An improvement of the general bound on the largest family of subsets avoiding a subposet
From MaRDI portal
Publication:523149
DOI10.1007/s11083-016-9390-3zbMath1404.06003arXiv1408.5783OpenAlexW1682909341MaRDI QIDQ523149
Abhishek Methuku, Dániel Grósz, Casey Tompkins
Publication date: 20 April 2017
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.5783
Related Items (9)
Forbidden induced subposets of given height ⋮ Largest family without a pair of posets on consecutive levels of the Boolean lattice ⋮ 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 ⋮ Families of subsets without a given poset in double chains and Boolean lattices ⋮ Ramsey numbers for partially-ordered sets ⋮ On forbidden poset problems in the linear lattice
Cites Work
- Unnamed Item
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Diamond-free families
- Induced and non-induced forbidden subposet problems
- Poset-free families and Lubell-boundedness
- Set families with a forbidden subposet
- No four subsets forming an \(N\)
- On crown-free families of subsets
- A note on the largest size of families of sets with a forbidden poset
- Largest families without an \(r\)-fork
- Largest family without \(A \cup B \subseteq C \cap D\)
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- The method of double chains for largest families with excluded subposets
- Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
- A Dual of Dilworth's Decomposition Theorem
- On a lemma of Littlewood and Offord
This page was built for publication: An improvement of the general bound on the largest family of subsets avoiding a subposet
