Forbidden subposet problems with size restrictions
From MaRDI portal
Publication:1689034
DOI10.1016/j.jcta.2017.10.005zbMath1377.05191arXiv1608.06646OpenAlexW2963766369MaRDI QIDQ1689034
Publication date: 12 January 2018
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.06646
Related Items (2)
Forbidding rank-preserving copies of a poset ⋮ Avoiding brooms, forks, and butterflies in the linear lattices
Cites Work
- An improvement of the general bound on the largest family of subsets avoiding a subposet
- Diamond-free families
- An upper bound on the size of diamond-free families of sets
- The partition method for poset-free families
- Induced and non-induced forbidden subposet problems
- Poset-free families and Lubell-boundedness
- Set families with a forbidden subposet
- 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\)
- Set Families With a Forbidden Induced Subposet
- On Families of Subsets With a Forbidden Subposet
- The method of double chains for largest families with excluded subposets
- Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
- A short proof of Sperner's lemma
- Unnamed Item
- Unnamed Item
This page was built for publication: Forbidden subposet problems with size restrictions
