Diamond-free subsets in the linear lattices
From MaRDI portal
Publication:466889
DOI10.1007/s11083-013-9310-8zbMath1301.06011OpenAlexW1979655683MaRDI QIDQ466889
William Frick, Daniel McGuinness, Zachary Barnett, Ghassan Sarkis, Shahriar Shahriari, Dustin Rodrigues, David Breese, Benjamin Fish, Andrew Khatutsky, Claire Ruberman
Publication date: 31 October 2014
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-013-9310-8
Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05) Transversal (matching) theory (05D15)
Related Items (4)
The covering lemma and q-analogues of extremal set theory problems ⋮ Zero-sum flows of the linear lattice. ⋮ Families of subsets without a given poset in double chains and Boolean lattices ⋮ On forbidden poset problems in the linear lattice
Cites Work
- Unnamed Item
- Unnamed Item
- Diamond-free families
- \(Q _{2}\)-free families in the Boolean lattice
- 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
- On diamond-free subposets of the Boolean lattice
- Three layer \(Q _{2}\)-free families in the Boolean lattice
- Set families with a forbidden subposet
- No four subsets forming an \(N\)
- Largest families without an \(r\)-fork
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- Largest family without \(A \cup B \subseteq C \cap D\)
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method)
- On Families of Subsets With a Forbidden Subposet
- On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
- On a lemma of Littlewood and Offord
This page was built for publication: Diamond-free subsets in the linear lattices
