Poset-free families and Lubell-boundedness
From MaRDI portal
Publication:2347975
DOI10.1016/j.jcta.2015.03.010zbMath1315.05138arXiv1208.4241MaRDI QIDQ2347975
Wei-Tian Li, Jerrold R. Griggs
Publication date: 10 June 2015
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.4241
Related Items
An improvement of the general bound on the largest family of subsets avoiding a subposet, Families of subsets without a given poset in double chains and Boolean lattices, Forbidden subposet problems with size restrictions, Ramsey numbers for partially-ordered sets, Rainbow Ramsey problems for the Boolean lattice, On crown-free families of subsets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diamond-free families
- On diamond-free subposets of 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
- The method of double chains for largest families with excluded subposets
- A short proof of Sperner's lemma
- On a lemma of Littlewood and Offord