A simple proof for a forbidden subposet problem
From MaRDI portal
Publication:2290360
DOI10.37236/7680zbMath1446.05089OpenAlexW3003154078MaRDI QIDQ2290360
Shanise Walker, Abhishek Methuku, Ryan R. Martin, Andrew J. Uzzell
Publication date: 27 January 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p31
Related Items (3)
Largest family without a pair of posets on consecutive levels of the Boolean lattice ⋮ Forbidding rank-preserving copies of a poset ⋮ On forbidden poset problems in the linear lattice
Cites Work
- Unnamed Item
- Diamond-free families
- Exact forbidden subposet results using chain decompositions of the cycle
- 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
- An upper bound on the size of diamond-free families of sets
- Set families with a forbidden subposet
- Largest families without an \(r\)-fork
- Largest family without \(A \cup B \subseteq C \cap D\)
- Set Families With a Forbidden Induced Subposet
- Progress on poset-free families of subsets
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
- On Families of Subsets With a Forbidden Subposet
- Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
- On a lemma of Littlewood and Offord
This page was built for publication: A simple proof for a forbidden subposet problem
