Intersection theorems under dimension constraints
From MaRDI portal
Publication:2368655
DOI10.1016/j.jcta.2005.04.009zbMath1115.05089OpenAlexW2090860698MaRDI QIDQ2368655
Levon H. Khachatrian, Harout Aydinian
Publication date: 28 April 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2005.04.009
Related Items (2)
Intersection patterns of linear subspaces with the hypercube ⋮ Forbidden \((0,1)\)-vectors in hyperplanes of \(\mathbb R^n\): the unrestricted case
Cites Work
- Unnamed Item
- Katona's intersection theorem: four proofs
- The complete intersection theorem for systems of finite sets
- The exact bound in the Erdős-Ko-Rado theorem
- Beyond the Erdős-Ko-Rado theorem
- Contributions to the geometry of Hamming spaces
- The diametric theorem in Hamming spaces---optimal anticodes
- The intersection theorem for direct products
- Extremal problems under dimension constraints.
- Maximum number of constant weight vertices of the unit \(n\)-cube contained in a \(k\)-dimensional subspace
- The complete nontrivial-intersection theorem for systems of finite sets
- An Erdös-Ko-Rado theorem for direct products
- Erdös–Ko–Rado Theorem—22 Years Later
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of finite sets
- On a combinatorial conjecture of Erdös
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On intersecting families of finite sets
This page was built for publication: Intersection theorems under dimension constraints