The Erdős-Ko-Rado theorem for vector spaces
From MaRDI portal
The classical Erdős-Ko-Rado problem was studied in many aspects: In 1975 W. N. Hsieh proved the first analogue theorem in finite vector spaces. In this case two subspaces are intersecting, if their common part in properly subspace. Let V be an n-dimensional vector space over GF(q) and for integers \(k\geq t>0\) let \(m_ q(n,k,t)\) denote the maximum possible number of subspaces in a t-intersecting family \({\mathcal F}\) of k- dimensional subspaces of V i.e. dim \(F\cap F'\geq t\) holds for all F,F'\(\in {\mathcal F}\). Hshieh proved in 1975 that \(m_ q(n,k,t)=\left[ \begin{matrix} n-t\\ k-t\end{matrix} \right]\) holds for \(n\geq 2k+1\), \(q\geq 3\) and for \(n\geq 2k+2\), \(q=2.\) In the paper under review it is proved: Theorem 1: Suppose \(n\geq 2k-t\); \({\mathcal F}\subset \left[ \begin{matrix} V\\ k\end{matrix} \right]\) is t- intersecting then \[ | {\mathcal F}| \leq \max \{\left[ \begin{matrix} n-t\\ k-t\end{matrix} \right]_ q;\quad \left[ \begin{matrix} 2k-t\\ k\end{matrix} \right]_ q\}. \] The proof method is based on the ideas of the second author.
Recommendations
Cites work
- Erdös–Ko–Rado Theorem—22 Years Later
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 3636041 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of finite vector spaces
- The exact bound in the Erdős-Ko-Rado theorem
Cited in
(only showing first 100 items - show all)- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- Commutative association schemes
- Profile vectors in the lattice of subspaces
- Intersection theorems for vector spaces
- First distribution invariants and EKR theorems
- Non \(t\)-intersecting families of linear spaces over \(GF(q)\)
- Erdős-Ko-Rado-type results over J_q(n,d),H_q(n,d) and their designs
- Codes and anticodes in the Grassman graph
- The Hilton-Milner theorem for finite affine spaces
- An EKR-theorem for finite buildings of type \(D_{\ell }\)
- Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- The chromatic number of the q-Kneser graph for large q
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
- Colourings without monochromatic disjoint pairs
- Shadows and intersections in vector spaces
- All 2-transitive groups have the EKR-module property
- The Hilton-Milner theorem for attenuated spaces
- 3-setwise intersecting families of the symmetric group
- The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces
- On non-optimally expanding sets in Grassmann graphs
- Erdős-Ko-Rado theorem for matrices over residue class rings
- On the chromatic number of two generalized Kneser graphs
- \(r\)-cross \(t\)-intersecting families for vector spaces
- Modular and fractional \(L\)-intersecting families of vector spaces
- Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space
- Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
- On maximum intersecting sets in direct and wreath product of groups
- Erdős-Ko-Rado sets of flags of finite sets
- An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings
- Intersection theorems for triangles
- Projection inequalities for antichains
- Remarks on polarity designs
- The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces
- A continuous analogue of Erdős' \(k\)-Sperner theorem
- Erdős-Ko-Rado theorems for set partitions with certain block size
- On \(r\)-cross \(t\)-intersecting families for weak compositions
- A Deza-Frankl type theorem for set partitions
- Equidistant codes in the Grassmannian
- The Katona theorem for vector spaces
- Intersection theorems under dimension constraints
- The maximum size of a partial spread in a finite projective space
- An Erdős-Ko-Rado theorem for finite buildings of type F₄
- An Erdős-Ko-Rado result for sets of pairwise non-opposite lines in finite classical polar spaces
- Sets of elements that pairwise generate a linear group
- Bounds on sets with few distances
- Theorems of Erdős-Ko-Rado type in geometrical settings
- Erdős-Ko-Rado theorems in certain semilattices
- The Erdős-Ko-Rado theorem for singular linear spaces
- The Erdős-Ko-Rado theorem for twisted Grassmann graphs
- Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
- Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\)
- The maximum sum and the maximum product of sizes of cross-intersecting families
- An Erdős-Ko-Rado theorem for finite classical polar spaces
- Remarks on the Erdős matching conjecture for vector spaces
- Non-trivial t-intersecting families for symplectic polar spaces
- Hilton-Milner results in projective and affine spaces
- On the intersection density of the symmetric group acting on uniform subsets of small size
- Cross t-intersecting integer sequences from weighted Erdős-Ko-Rado
- The Erdős-Ko-Rado theorem for finite affine spaces
- scientific article; zbMATH DE number 4177064 (Why is no real title available?)
- The Erdös-Ko-Rado theorem for finite affine symplectic space
- An analogue to the Erdős-Ko-Rado theorem on q-ary Hamming code
- The eigenvalue method for cross t-intersecting families
- An analogue of the Erdős-Ko-Rado theorem for weak compositions
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
- On q-analogues and stability theorems
- A generalization of the Erdős-Ko-Rado theorem to t-designs in certain semilattices
- scientific article; zbMATH DE number 490854 (Why is no real title available?)
- The Manickam-Miklós-Singhi conjectures for sets and vector spaces
- Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces
- Intersecting Chains in Finite Vector Spaces
- The Hilton-Milner theorem for the distance-regular graphs of bilinear forms
- On complete multipartite derangement graphs
- Nontrivial t-intersecting families for vector spaces
- A note on Huang-Zhao theorem on intersecting families with large minimum degree
- On diversity of certain \(t\)-intersecting families
- A cross-intersection theorem for vector spaces based on semidefinite programming
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- Intersecting antichains and shadows in linear lattices
- Anzahl theorems in geometry of t-singular classical groups and their applications
- Rank-metric codes and their applications
- An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings
- Suboptimal s-union families and s-union antichains for vector spaces
- On some properties of vector space based graphs
- A \(t\)-intersecting Hilton-Milner theorem for vector spaces
- Induced forests in some distance-regular graphs
- A Kruskal-Katona-type theorem for graphs: q-Kneser graphs
- Intersection theorems for \((- 1, 0, 1)\)-vectors
- Cross-intersecting families and primitivity of symmetric systems
- On the EKR-module property
- Erdős-Ko-Rado theorem for vector spaces over residue class rings
- The maximum sum of sizes of non-empty cross t-intersecting families
- Conditions for the existence of spreads in projective Hjelmslev spaces
- Non-trivial t-intersecting families for the distance-regular graphs of bilinear forms
- Maximal non-empty cross s-union families
- On cover-free families of finite vector spaces
- On r-cross t-intersecting families for vector spaces with large product of sizes
- Maximum Erdős-Ko-Rado sets of chambers and their antidesigns in vector-spaces of even dimension
- On the chromatic number of \(q\)-Kneser graphs
This page was built for publication: The Erdős-Ko-Rado theorem for vector spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086589)
