On the maximum size of Erdős-Ko-Rado sets in \(H(2d+1, q^2)\) (Q2248643)
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: On the maximum size of Erdős-Ko-Rado sets in H(2d+1, q^2) |
scientific article; zbMATH DE number 6309141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum size of Erdős-Ko-Rado sets in \(H(2d+1, q^2)\) |
scientific article; zbMATH DE number 6309141 |
Statements
On the maximum size of Erdős-Ko-Rado sets in \(H(2d+1, q^2)\) (English)
0 references
27 June 2014
0 references
Erdős-Ko-Rado sets (EKR sets for simply) in finite classical polar spaces are sets of generators that pairwise intersect non trivially. The EKR-sets of maximal size were classified for all finite classical polar spaces not isomorphic to the Hermitian polar space \(H(2d+1,q^2)\), \(d>2\) even, in [\textit{V. Pepe} et al., J. Comb. Theory, Ser. A 118, No. 4, 1291--1312 (2011; Zbl 1231.05267)]. The authors improve, using the theory of association schemes, the known upper bound of EKR sets \(H(2d+1,q^2)\), \(d>2\) even, from approximately \(q^{d^2+d}\) to \(q^{d^2+1}\). Finally, the authors note that the known examples have size much smaller of the bound, concluding that the algebraic approach is not powerful enough to give the correct upper bound.
0 references
Erdős-Ko-Rado theorem
0 references
polar space
0 references
association scheme
0 references
linear programming bound
0 references
0 references
0.88891613
0 references
0.8762245
0 references
0.86900455
0 references
0.86786604
0 references
0.86634433
0 references
0.86634433
0 references
0 references
0.86578697
0 references