On the chromatic number of structured Cayley graphs
Group Theory
2018-07-09 v3 Combinatorics
Abstract
In this paper, we will study the chromatic number of Cayley graphs of algebraic groups that arise from algebraic constructions. Using Lang-Weil bound and representation theory of finite simple groups of Lie type, we will establish lower bounds on the chromatic number of these graphs. This provides a lower bound for the chromatic number of Cayley graphs of the regular graphs associated to the ring of matrices over finite fields. Using Weil's bound for Kloosterman sums we will also prove an analogous result for over finite rings.
Keywords
Cite
@article{arxiv.1511.02427,
title = {On the chromatic number of structured Cayley graphs},
author = {Mohammad Bardestani and Keivan Mallahi-Karai},
journal= {arXiv preprint arXiv:1511.02427},
year = {2018}
}
Comments
arXiv admin note: text overlap with arXiv:1507.05300