Sciweavers

APPROX
2006
Springer

Threshold Functions for Asymmetric Ramsey Properties Involving Cliques

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 every Fi is the path P3 on 3 vertices, then we are looking for a proper k-edge-coloring of G, i.e., a coloring of the edges of G with no pair of edges of the same color incident to the same vertex. R
Martin Marciniszyn, Jozef Skokan, Reto Spöhel
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where APPROX
Authors Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger
Comments (0)