Theorems of Erdős-Ko-Rado type in geometrical settings
From MaRDI portal
Publication:2438531
DOI10.1007/s11425-013-4676-zzbMath1282.05025OpenAlexW2038943618MaRDI QIDQ2438531
Publication date: 5 March 2014
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-013-4676-z
Association schemes, strongly regular graphs (05E30) Extremal set theory (05D05) Combinatorial aspects of finite geometries (05B25) Erd?s problems and related topics of discrete geometry (52C10) Combinatorial structures in finite projective spaces (51E20) Polar geometry, symplectic spaces, orthogonal spaces (51A50)
Related Items (5)
Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space ⋮ Hilton-Milner results in projective and affine spaces ⋮ Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring ⋮ The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs ⋮ An Erdős-Ko-Rado theorem for finite classical polar spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(q\)-analogues and stability theorems
- An Erdős-Ko-Rado theorem for the derangement graph of PGL(\(2,q\)) acting on the projective line
- On the chromatic number of \(q\)-Kneser graphs
- The exact bound in the Erdős-Ko-Rado theorem
- Setwise intersecting families of permutations
- Colouring lines in projective space
- Intersecting families in the alternating group and direct product of symmetric groups
- Eigenvalue bounds for independent sets
- Finite generalized quadrangles
- A Hilton-Milner theorem for vector spaces
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- The Erdős-Ko-Rado theorem for vector spaces
- An extension of the Erdoes, Ko, Rado theorem to t-designs
- A new family of distance-regular graphs and the \(\{ 0,1,2 \}\)-cliques in dual polar graphs
- Intersection theorems for systems of finite vector spaces
- On Sperner families satisfying an additional condition
- Association schemes and t-designs in regular semilattices
- On the maximum number of permutations with given maximal or minimal distance
- Width and dual width of subsets in polynomial association schemes
- Stable sets of maximal size in Kneser-type graphs
- Shadows and intersections in vector spaces
- On the maximum size of Erdős-Ko-Rado sets in \(H(2d+1, q^2)\)
- 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 polar 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
- Erdős-Ko-Rado theorems for uniform set-partition systems
- A proof of the Cameron-Ku conjecture
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Some Erdös–Ko–Rado Theorems for Chevalley Groups
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes
- Intersecting families of permutations
- An Erdős-Ko-Rado theorem for multisets
- Intersecting families of permutations
This page was built for publication: Theorems of Erdős-Ko-Rado type in geometrical settings