On the Chromatic Number of Random Cayley Graphs

DOI10.1017/S0963548316000304zbMath1371.05083arXiv1308.1872OpenAlexW1682158437MaRDI QIDQ5366943

Ben Green

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.1872

zbMATH Keywords

asymptotically sharp chromatic numbers

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Inverse problems of additive number theory, including sumsets (11P70)

Related Items

On the subgraphs of Cayley sum graphs ⋮ Distinguishing chromatic number of random Cayley graphs ⋮ A Cheeger type inequality in finite Cayley sum graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Can visibility graphs be represented compactly?
• Counting sets with small sumset and applications
• List coloring of random and pseudo-random graphs
• Counting sets with small sumset, and the clique number of random Cayley graphs
• The chromatic number of random Cayley graphs
• The chromatic number of random graphs

This page was built for publication: On the Chromatic Number of Random Cayley Graphs