Independent sets in association schemes
From MaRDI portal
Publication:858143
DOI10.1007/s00493-006-0024-zzbMath1121.05085arXivmath/0311535OpenAlexW2099528956MaRDI QIDQ858143
Michael W. Newman, Chris D. Godsil
Publication date: 8 January 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0311535
Association schemes, strongly regular graphs (05E30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (14)
The eigenvalue method for cross \(t\)-intersecting families ⋮ Universal completability, least eigenvalue frameworks, and vector colorings ⋮ An Erdős-Ko-Rado theorem for finite buildings of type \(F_4\) ⋮ An Erdős-Ko-Rado result for sets of pairwise non-opposite lines in finite classical polar spaces ⋮ On \(q\)-analogues and stability theorems ⋮ Theorems of Erdős-Ko-Rado type in polar spaces ⋮ Shadows and intersections in vector spaces ⋮ Multiplicity-free permutation representations of the symmetric group. ⋮ Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring ⋮ A cross-intersection theorem for vector spaces based on semidefinite programming ⋮ Remarks on polarity designs ⋮ On the chromatic number of \(q\)-Kneser graphs ⋮ A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations ⋮ Colouring lines in projective space
This page was built for publication: Independent sets in association schemes
