Journal article
Authors list: Ihringer, Ferdinand; Metsch, Klaus
Publication year: 2018
Pages: 285-322
Journal: Journal of Combinatorial Theory, Series A
Volume number: 154
ISSN: 0097-3165
eISSN: 1096-0899
Open access status: Bronze
DOI Link: https://doi.org/10.1016/j.jcta.2017.08.018
Publisher: Elsevier
Abstract:
We investigate {0, 1, ..., t}-cliques of generators on dual polar graphs of finite classical polar spaces of rank d. These cliques are also known as Erdos Ko Rado sets in polar spaces of generators with pairwise intersections in at most codimension t. Our main result is that we classify all such cliques of maximum size for t t <=root 8d/5 - 2 if q >= 3, and t <= root 8d/9 - 2 if q = 2. We have the following byproducts.
(a) For q >= 3 we provide estimates of Hoffman's bound on these {0, 1, ..., 4-cliques for all t.
(b) For q >= 3 we determine the largest, second largest, and smallest eigenvalue of the graphs which have the generators of a polar space as vertices and where two generators are adjacent if and only if they meet in codimension at least t + 1. Furthermore, we provide nice explicit formulas for all eigenvalues of these graphs.
(c) We provide upper bounds on the size of the second largest maximal {0, 1, ..., t}-cliques for some t. (C) 2017 Elsevier Inc. All rights reserved.
Citation Styles
Harvard Citation style: Ihringer, F. and Metsch, K. (2018) Large {0, 1, ..., t}-cliques in dual polar graphs, Journal of Combinatorial Theory, Series A, 154, pp. 285-322. https://doi.org/10.1016/j.jcta.2017.08.018
APA Citation style: Ihringer, F., & Metsch, K. (2018). Large {0, 1, ..., t}-cliques in dual polar graphs. Journal of Combinatorial Theory, Series A. 154, 285-322. https://doi.org/10.1016/j.jcta.2017.08.018
Keywords
Distance-regular graph; Erdos-Ko-Rado Theorem; Independent set; INTERSECTION-THEOREMS; KO-RADO THEOREMS; Polar space; SETS