Equitable coloring of random graphs

DOI10.1002/rsa.20264zbMath1205.05093MaRDI QIDQ3055766

Balázs Patkós, Michael Krivelevich

Publication date: 9 November 2010

Published in: Random Structures and Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

graph coloring; random graphs; equitable coloring

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C15: Coloring of graphs and hypergraphs

Related Items

Sharp concentration of the equitable chromatic number of dense random graphs, Coloring random graphs online without creating monochromatic subgraphs, Weakly saturated subgraphs of random graphs, Strong games played on random graphs, Virtually fibering random right-angled Coxeter groups -- extended abstract

Cites Work

• Unnamed Item
• Unnamed Item
• Expose-and-merge exploration and the chromatic number of a random graph
• Spanning subgraphs of random graphs
• Equitable colorings of outerplanar graphs
• List coloring of random and pseudo-random graphs
• A list analogue of equitable coloring
• The infamous upper tail
• Large deviations for sums of partly dependent random variables
• On the probability of independent sets in random graphs
• On Equitable Coloring of d-Degenerate Graphs
• The chromatic number of random graphs
• The chromatic number of random graphs