pith. sign in

arxiv: 1511.02427 · v3 · pith:O24AWLP7new · submitted 2015-11-08 · 🧮 math.GR · math.CO

On the chromatic number of structured Cayley graphs

classification 🧮 math.GR math.CO
keywords graphschromaticnumberboundcayleyfinitewillalgebraic
0
0 comments X
read the original 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 $n\times n$ matrices over finite fields. Using Weil's bound for Kloosterman sums we will also prove an analogous result for $\mathrm{SL}_2$ over finite rings.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.