The chromatic number and rank of the complements of the Kasami graphs

DOI10.1016/j.disc.2006.03.076zbMath1108.05044OpenAlexW2047785497MaRDI QIDQ861803

Aidan Roy, Gordon F. Royle

Publication date: 2 February 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.076

zbMATH Keywords

distance-regular graphdeterministic communication complexityrank-coloring conjecture

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
• Communication complexity and combinatorial lattice theory
• Association schemes related to Kasami codes and Kerdock sets
• Eigenvalues and perfect matchings
• Chromatic number and the 2-rank of a graph
• Codes, graphs, and schemes from nonlinear functions
• A counterexample to the rank-coloring conjecture

This page was built for publication: The chromatic number and rank of the complements of the Kasami graphs