The covering lemma and q-analogues of extremal set theory problems
From MaRDI portal
Publication:6094181
DOI10.26493/1855-3974.2677.b7farXiv1905.06994WikidataQ125023252 ScholiaQ125023252MaRDI QIDQ6094181
Publication date: 13 September 2023
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.06994
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diamond-free subsets in the linear lattices
- Avoiding brooms, forks, and butterflies in the linear lattices
- Generalized forbidden subposet problems
- Intersecting Sperner families and their convex hulls
- Profile vectors in the lattice of subspaces
- Extremal hypergraph problems and convex hulls
- An upper bound on the size of diamond-free families of sets
- Graphs with the Erdős-Ko-Rado property
- Forbidding rank-preserving copies of a poset
- On the number of containments in \(P\)-free families
- On forbidden poset problems in the linear lattice
- Set families with a forbidden subposet
- Profile polytopes of some classes of families
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Largest family without \(A \cup B \subseteq C \cap D\)
- Logarithmic order of free distributive lattice
- Progress on poset-free families of subsets
- Extremal Finite Set Theory
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Families of Subsets With a Forbidden Subposet
- l-Chain Profile Vectors
- The method of double chains for largest families with excluded subposets
- A short proof of Sperner's lemma
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: The covering lemma and q-analogues of extremal set theory problems
