Sciweavers

APPROX
2006
Springer
91views Algorithms» more  APPROX 2006»
14 years 3 months ago
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques
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...
Martin Marciniszyn, Jozef Skokan, Reto Spöhel...