Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number
From MaRDI portal
Publication:3146985
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)
Related Items
Maximizing H‐Colorings of a Regular Graph, On the Chromatic Number of Random Graphs with a Fixed Degree Sequence, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, Adjacency matrices of random digraphs: singularity and anti-concentration, On the chromatic number of random regular graphs, On the chromatic number of random \(d\)-regular graphs, Random regular graphs of non-constant degree: concentration of the chromatic number, Sandwiching random graphs: universality between random graph models, Lower bounds on the chromatic number of random graphs