Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs
From MaRDI portal
Publication:1297405
DOI10.1016/S0012-365X(98)00171-XzbMath0924.05066MaRDI QIDQ1297405
Publication date: 2 September 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Association schemes, strongly regular graphs (05E30) Extremal set theory (05D05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (8)
Upper bounds for \(s\)-distance sets and equiangular lines ⋮ A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices ⋮ Bounds on sets with few distances ⋮ 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 ⋮ The Hilton-Milner theorem for attenuated spaces ⋮ Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
Cites Work
- The exact bound in the Erdős-Ko-Rado theorem
- Designs over finite fields
- An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
- t-designs in classical association schemes
- Designs and partial geometries over finite fields
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- An extension of the Erdoes, Ko, Rado theorem to t-designs
- Designs on vector spaces constructed using quadratic forms
- Intersection theorems for systems of finite vector spaces
- Association schemes and t-designs in regular semilattices
- A large set of designs on vector spaces
- On the inequalities of \(t\)-designs over a finite field
- q-analogues of t-designs and their existence
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Some Erdös–Ko–Rado Theorems for Chevalley Groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs
