The Erdős-Ko-Rado theorem for vector spaces
From MaRDI portal
Publication:1086589
DOI10.1016/0097-3165(86)90063-4zbMATH Open0609.05055DBLPjournals/jct/FranklW86OpenAlexW2088742261WikidataQ56213502 ScholiaQ56213502MaRDI QIDQ1086589FDOQ1086589
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)
Cites Work
Cited In (92)
- On finite simple groups and Kneser graphs.
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
- On \(q\)-analogues and stability theorems
- On the chromatic number of \(q\)-Kneser graphs
- Sets of elements that pairwise generate a linear group
- Erdős-Ko-Rado theorems in certain semilattices
- The chromatic number of the \(q\)-Kneser graph for large \(q\)
- The Erdős-Ko-Rado theorem for finite affine spaces
- Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, Q)\)
- Projection inequalities for antichains
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- An Erdős-Ko-Rado theorem for finite buildings of type \(F_4\)
- Bounds on sets with few distances
- Shadows and intersections in vector spaces
- An analogue of the Erdős-Ko-Rado theorem for weak compositions
- Intersecting antichains and shadows in linear lattices
- Colouring lines in projective space
- Cross-intersecting families and primitivity of symmetric systems
- Profile vectors in the lattice of subspaces
- The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces
- Theorems of Erdős-Ko-Rado type in geometrical settings
- The Manickam-Miklós-Singhi conjectures for sets and vector spaces
- First distribution invariants and EKR theorems
- Title not available (Why is that?)
- The maximum size of a partial spread in a finite projective space
- The Hilton-Milner theorem for finite affine spaces
- The Erdős-Ko-Rado theorem for twisted Grassmann graphs
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
- A note on the Manickam-Miklós-Singhi conjecture for vector spaces
- On \(r\)-cross \(t\)-intersecting families for weak compositions
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- Nontrivial t-Intersecting Families for Vector Spaces
- A coloring problem for intersecting vector spaces
- A Deza-Frankl type theorem for set partitions
- Rank-Metric Codes and Their Applications
- Remarks on polarity designs
- A cross-intersection theorem for vector spaces based on semidefinite programming
- Title not available (Why is that?)
- Erdős-Ko-Rado theorems for set partitions with certain block size
- Non \(t\)-intersecting families of linear spaces over \(GF(q)\)
- 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
- Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
- Suboptimal \(s\)-union families and \(s\)-union antichains for vector spaces
- A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices
- A non-trivial intersection theorem for permutations with fixed number of cycles
- On some properties of vector space based graphs
- An EKR-theorem for finite buildings of type \(D_{\ell }\)
- On complete multipartite derangement graphs
- Galois geometries and coding theory
- Cross \(t\)-intersecting integer sequences from weighted Erdős-Ko-Rado
- Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs
- Codes and anticodes in the Grassman graph
- \(r\)-cross \(t\)-intersecting families for vector spaces
- The Hilton-Milner theorem for the distance-regular graphs of bilinear forms
- 3-setwise intersecting families of the symmetric group
- The eigenvalue method for cross \(t\)-intersecting families
- Equidistant codes in the Grassmannian
- Invitation to intersection problems for finite sets
- Strongly intersecting integer partitions
- Commutative association schemes
- A note on Huang-Zhao theorem on intersecting families with large minimum degree
- Conditions for the existence of spreads in projective Hjelmslev spaces
- Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces
- The Erdős-Ko-Rado theorem for singular linear spaces
- Hilton-Milner results in projective and affine spaces
- On maximum intersecting sets in direct and wreath product of groups
- A Kruskal-Katona-type theorem for graphs: \(q\)-Kneser graphs
- Anzahl theorems in geometry oft-singular classical groups and their applications
- Induced forests in some distance-regular graphs
- All 2-transitive groups have the EKR-module property
- The Hilton-Milner theorem for attenuated spaces
- On the intersection density of the symmetric group acting on uniform subsets of small size
- Colourings without monochromatic disjoint pairs
- Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space
- Remarks on the Erdős matching conjecture for vector spaces
- Erdős-Ko-Rado sets of flags of finite sets
- Erdős-Ko-Rado theorem for vector spaces over residue class rings
- An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings
- An Erdős-Ko-Rado result for sets of pairwise non-opposite lines in finite classical polar spaces
- A continuous analogue of Erdős' \(k\)-Sperner theorem
- Erdős-Ko-Rado theorem for matrices over residue class rings
- The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces
- The maximum sum of sizes of non-empty cross \(t\)-intersecting families
- On non-optimally expanding sets in Grassmann graphs
- Non-trivial \(t\)-intersecting families for symplectic polar spaces
- A \(t\)-intersecting Hilton-Milner theorem for vector spaces
- Intersection theorems for triangles
- On the chromatic number of two generalized Kneser graphs
- On the EKR-module property
- Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
- An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings
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)