An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms (Q1106215)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms |
scientific article; zbMATH DE number 4061244
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms |
scientific article; zbMATH DE number 4061244 |
Statements
An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms (English)
0 references
1987
0 references
An analogue of the Erdős-Ko-Rado theorem is proved for the distance- regular graphs \(H_ q(k,n)\) with \(k\times n\) matrices over GF(q) as vertex set and two matrices A and B adjacent if the rank of A-B is 1, where \(n\geq k+1\) and \((n,q)\neq (k+1,2)\). As an easy corollary, we prove that \(H_ q(k,n)\) has no perfect e-codes, \(e\geq 1\).
0 references
Erdős-Ko-Rado theorem
0 references
distance-regular graphs
0 references
