Width and dual width of subsets in polynomial association schemes
From MaRDI portal
Publication:1395814
DOI10.1016/S0097-3165(03)00006-2zbMath1018.05108MaRDI QIDQ1395814
William J. Martin, Andries E. Brouwer, Chris D. Godsil, Jack H. Koolen
Publication date: 1 July 2003
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Related Items
The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities, Boolean degree 1 functions on some classical association schemes, Tight distance-regular graphs with respect to subsets, Intriguing sets of vertices of regular graphs, Imprimitive cometric association schemes: constructions and analysis, Optimal and extremal graphical designs on regular graphs associated with classical parameters, A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices, Theorems of Erdős-Ko-Rado type in polar spaces, Theorems of Erdős-Ko-Rado type in geometrical settings, New parameters of subsets in polynomial association schemes, The Erdős-Ko-Rado theorem for twisted Grassmann graphs, Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency, Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs, A bilinear form relating two Leonard systems, Distance-regular graphs and the \(q\)-tetrahedron algebra, Almost 2-homogeneous graphs and completely regular quadrangles, On the Cheeger constant for distance-regular graphs, Distance-regular graphs of \(q\)-Racah type and the \(q\)-tetrahedron algebra, Commutative association schemes, Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs, Hypercube and tetrahedron algebra
Cites Work