Sciweavers

IPL
1998
95views more  IPL 1998»
13 years 4 months ago
Coloring Random Graphs
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
Michael Krivelevich, Benny Sudakov