Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number

DOI10.1017/S0963548302005254zbMath0997.05089WikidataQ57401528 ScholiaQ57401528MaRDI QIDQ3146985

Oliver Riordan, Colin Cooper, Bruce A. Reed, Alan M. Frieze

Publication date: 12 November 2002

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

zbMATH Keywords

independence numberchromatic numberregular graphrandom graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items

Sandwiching random graphs: universality between random graph models, Adjacency matrices of random digraphs: singularity and anti-concentration, Lower bounds on the chromatic number of random graphs, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, On the chromatic number of random regular graphs, Maximizing H‐Colorings of a Regular Graph, On the Chromatic Number of Random Graphs with a Fixed Degree Sequence, On the chromatic number of random \(d\)-regular graphs, Random regular graphs of non-constant degree: concentration of the chromatic number