Equitable coloring of random graphs

DOI10.1002/RSA.20264MaRDI QIDQ3055766zbMATH OpenOpenAlexFDO

Authors Michael Krivelevich, Balázs Patkós

Publication date 9 November 2010

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20264

zbMATH Keywords

equitable coloringgraph coloringrandom graphs

Mathematics Subject Classification ID

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

Recommendations

• Sharp concentration of the equitable chromatic number of dense random graphs
• On the chromatic number of random graphs
• Equitable coloring parameters of certain graph classes
• Some new results on equitable coloring parameters of graphs
• On certain parameters of equitable coloring of graphs

Cites work

• A list analogue of equitable coloring
• Equitable colorings of outerplanar graphs
• Expose-and-merge exploration and the chromatic number of a random graph
• scientific article; zbMATH DE number 2079370 (Why is no real title available?)
• scientific article; zbMATH DE number 1833421 (Why is no real title available?)
• Large deviations for sums of partly dependent random variables
• List coloring of random and pseudo-random graphs
• On Equitable Coloring of d-Degenerate Graphs
• On the probability of independent sets in random graphs
• Spanning subgraphs of random graphs
• The chromatic number of random graphs
• The chromatic number of random graphs
• The infamous upper tail

Cited in

(9)

• Virtually fibering random right-angled Coxeter groups -- extended abstract
• scientific article; zbMATH DE number 1688362 (Why is no real title available?)
• Sharp concentration of the equitable chromatic number of dense random graphs
• Strong games played on random graphs
• Some new results on equitable coloring parameters of graphs
• scientific article; zbMATH DE number 6452992 (Why is no real title available?)
• On certain parameters of equitable coloring of graphs
• Coloring random graphs online without creating monochromatic subgraphs
• Weakly saturated subgraphs of random graphs

This page was built for publication: Equitable coloring of random graphs

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