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

DOI10.1017/S0963548302005254MaRDI QIDQ3146985zbMATH OpenDBLPWikidataFDO

Authors Colin Cooper, Oliver Riordan, Alan Frieze, Bruce Reed

Publication date 12 November 2002

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

zbMATH Keywords

random graphchromatic numberindependence numberregular graph

Mathematics Subject Classification ID

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

Recommendations

• Random regular graphs of non-constant degree: concentration of the chromatic number
• scientific article; zbMATH DE number 861409
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• On the chromatic number of random regular graphs
• Random regular graphs of high degree

Cited in

(13)

• Random regular graphs of high degree
• Maximum independent sets on random regular graphs
• Maximizing \(H\)-colorings of a regular graph
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• On the chromatic number of random regular graphs
• Adjacency matrices of random digraphs: singularity and anti-concentration
• On the chromatic number of random \(d\)-regular graphs
• On the independence and chromatic numbers of random regular graphs
• Random regular graphs of non-constant degree: concentration of the chromatic number
• 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
• Lower bounds on the chromatic number of random graphs
• Sandwiching random graphs: universality between random graph models

This page was built for publication: Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3146985)