135
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
116
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...
121
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =