One-Point Concentration of the Clique and Chromatic Numbers of the Random Cayley Graph on $\mathbb{F}_2^n$

DOI10.1137/16M1062107zbMath1361.05063arXiv1510.05991MaRDI QIDQ2957689

Rudi Mrazović

Publication date: 27 January 2017

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

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

zbMATH Keywords

Cayley graphschromatic numberclique number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other combinatorial number theory (11B75) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Hypergraph containers
• The concentration of the chromatic number of random graphs
• Counting sets with small sumset and applications
• Counting sets with small sumset, and the clique number of random Cayley graphs
• The chromatic number of random Cayley graphs
• A Szemerédi-type regularity lemma in abelian groups, with applications
• Abschätzung der asymptotischen Dichte von Summenmengen
• On Sums of Generating Sets in ℤ₂ⁿ
• Cliques in random graphs
• How Sharp is the Concentration of the Chromatic Number?

This page was built for publication: One-Point Concentration of the Clique and Chromatic Numbers of the Random Cayley Graph on $\mathbb{F}_2^n$