The Erdős-Ko-Rado theorem for vector spaces
From MaRDI portal
Publication:1086589
DOI10.1016/0097-3165(86)90063-4zbMath0609.05055OpenAlexW2088742261WikidataQ56213502 ScholiaQ56213502MaRDI QIDQ1086589
Richard M. Wilson, Peter Frankl
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(86)90063-4
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items
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 ⋮ The Hilton-Milner theorem for finite affine spaces ⋮ First distribution invariants and EKR theorems ⋮ Erdős-Ko-Rado sets of flags of finite sets ⋮ The maximum size of a partial spread in a finite projective space ⋮ An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings ⋮ An EKR-theorem for finite buildings of type \(D_{\ell }\) ⋮ Intersection theorems for triangles ⋮ The eigenvalue method for cross \(t\)-intersecting families ⋮ Remarks on the Erdős matching conjecture for vector spaces ⋮ Non-trivial \(t\)-intersecting families for symplectic polar spaces ⋮ Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs ⋮ An analogue of the Erdős-Ko-Rado theorem for weak compositions ⋮ An Erdős-Ko-Rado theorem for finite buildings of type \(F_4\) ⋮ Nontrivial t-Intersecting Families for Vector Spaces ⋮ An Erdős-Ko-Rado result for sets of pairwise non-opposite lines in finite classical polar spaces ⋮ 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 ⋮ Cross-intersecting families and primitivity of symmetric systems ⋮ On some properties of vector space based graphs ⋮ An Erdős-Ko-Rado theorem for permutations with fixed number of cycles ⋮ A \(t\)-intersecting Hilton-Milner theorem for vector spaces ⋮ On \(q\)-analogues and stability theorems ⋮ A note on the Manickam-Miklós-Singhi conjecture for vector spaces ⋮ A non-trivial intersection theorem for permutations with fixed number of cycles ⋮ Hilton-Milner results in projective and affine spaces ⋮ Sets of elements that pairwise generate a linear group ⋮ Induced forests in some distance-regular graphs ⋮ A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices ⋮ A Kruskal-Katona-type theorem for graphs: \(q\)-Kneser graphs ⋮ The Erdős-Ko-Rado theorem for finite affine spaces ⋮ On the intersection density of the symmetric group acting on uniform subsets of small size ⋮ Projection inequalities for antichains ⋮ Bounds on sets with few distances ⋮ Galois geometries and coding theory ⋮ Theorems of Erdős-Ko-Rado type in geometrical settings ⋮ Erdős-Ko-Rado theorems in certain semilattices ⋮ Shadows and intersections in vector spaces ⋮ The Erdős-Ko-Rado theorem for singular linear spaces ⋮ The Manickam-Miklós-Singhi conjectures for sets and vector spaces ⋮ The Erdős-Ko-Rado theorem for twisted Grassmann graphs ⋮ Non \(t\)-intersecting families of linear spaces over \(GF(q)\) ⋮ 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 ⋮ Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces ⋮ Conditions for the existence of spreads in projective Hjelmslev spaces ⋮ The Hilton-Milner theorem for the distance-regular graphs of bilinear forms ⋮ Colourings without monochromatic disjoint pairs ⋮ A note on Huang-Zhao theorem on intersecting families with large minimum degree ⋮ A cross-intersection theorem for vector spaces based on semidefinite programming ⋮ Remarks on polarity designs ⋮ The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces ⋮ On the chromatic number of \(q\)-Kneser graphs ⋮ All 2-transitive groups have the EKR-module property ⋮ The Hilton-Milner theorem for attenuated spaces ⋮ On finite simple groups and Kneser graphs. ⋮ Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices ⋮ Anzahl theorems in geometry oft-singular classical groups and their applications ⋮ Intersecting antichains and shadows in linear lattices ⋮ Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs ⋮ Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, Q)\) ⋮ 3-setwise intersecting families of the symmetric group ⋮ 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 ⋮ A continuous analogue of Erdős' \(k\)-Sperner theorem ⋮ The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces ⋮ A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations ⋮ A coloring problem for intersecting vector spaces ⋮ Invitation to intersection problems for finite sets ⋮ Strongly intersecting integer partitions ⋮ On non-optimally expanding sets in Grassmann graphs ⋮ Erdős-Ko-Rado theorems for set partitions with certain block size ⋮ Erdős-Ko-Rado theorem for matrices over residue class rings ⋮ On the chromatic number of two generalized Kneser graphs ⋮ Commutative association schemes ⋮ Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado ⋮ Profile vectors in the lattice of subspaces ⋮ Unnamed Item ⋮ \(r\)-cross \(t\)-intersecting families for vector spaces ⋮ On \(r\)-cross \(t\)-intersecting families for weak compositions ⋮ A Deza-Frankl type theorem for set partitions ⋮ On complete multipartite derangement graphs ⋮ Rank-Metric Codes and Their Applications ⋮ Equidistant codes in the Grassmannian ⋮ Codes and anticodes in the Grassman graph ⋮ Colouring lines in projective space
Cites Work
