The partition method for poset-free families
From MaRDI portal
Publication:1956245
DOI10.1007/s10878-012-9476-9zbMath1273.90172OpenAlexW2043342225MaRDI QIDQ1956245
Jerrold R. Griggs, Wei-Tian Li
Publication date: 13 June 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9476-9
Related Items (12)
Intersecting \(P\)-free families ⋮ Three layer \(Q _{2}\)-free families in the Boolean lattice ⋮ Supersaturation, counting, and randomness in forbidden subposet problems ⋮ Forbidden subposet problems with size restrictions ⋮ On some extremal and probabilistic questions for tree posets ⋮ Turán problems on non-uniform hypergraphs ⋮ Boolean algebras and Lubell functions ⋮ Induced and non-induced forbidden subposet problems ⋮ Forbidding rank-preserving copies of a poset ⋮ Ramsey numbers for partially-ordered sets ⋮ Rainbow Ramsey problems for the Boolean lattice ⋮ Poset-free families and Lubell-boundedness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diamond-free families
- 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
- 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
- A short proof of Sperner's lemma
- On a lemma of Littlewood and Offord
This page was built for publication: The partition method for poset-free families
