Abelian groups yield many large families for the diamond problem
From MaRDI portal
Publication:2354831
DOI10.1007/S40879-015-0039-3zbMath1316.05118arXiv1309.5638OpenAlexW2014012640MaRDI QIDQ2354831
Éva Czabarka, Aaron Dutle, J. Travis Johnston, László A. Székely
Publication date: 27 July 2015
Published in: European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.5638
Partial orders, general (06A06) Extremal set theory (05D05) Finite abelian groups (20K01) Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sperner type theorems with excluded subposets
- 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\)
- On crown-free families of subsets
- 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\)
- Logarithmic order of free distributive lattice
- On Families of Subsets With a Forbidden Subposet
- Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals
- Two-Part and k-Sperner Families: New Proofs Using Permutations
- On generalized graphs
- A short proof of Sperner's lemma
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- On a lemma of Littlewood and Offord
This page was built for publication: Abelian groups yield many large families for the diamond problem
