Asymmetric Ramsey Properties不对称拉姆齐性质.ppt

Asymmetric Ramsey Propertiesof Random Graphs involving Cliques Reto Sp?hel Joint work with Martin Marciniszyn, Jozef Skokan, and Angelika Steger Ramsey Theory Folklore Among every party of at least six people, there are at least three, either all or none of whom know each other Equivalently: Every edge-coloring of the complete graph on six vertices with two colors contains a triangle. Question: How many people must attend the party so that the assertion holds for ` 3 people? Are these numbers finite? Ramsey Theory Extensions: Color graphs other than cliques (e.g., random graphs). Avoid some fixed graph F other than K`. Avoid graph F1 in blue and F2 in red (asymmetric case). Allow more colors. Random Graphs Binomial model Gn,p n vertices include each edge with probability p, independently of all other edges We study the limiting probabilitythat the random graph Gn,p satisfies a given property P, where p = p(n). It turns out that many properties have thresholds functions p0(n) such that Ramsey properties Problem: For any fixed graph F, integer k, and edge probability p = p(n), determine Observation: The family of graphs satisfying R(F, k) is monotone increasing. ? The property R(F, k) has a threshold (Bollobás, Thomason, 1987). Threshold for Ramsey properties Intuition: above the threshold, there are more copies of F in Gn,p than edges. This forces the copies of F to overlap substantially and makes coloring difficult. Order of magnitude of threshold does not depend on k (!) Threshold for Ramsey properties It is conjectured that the constants b and B can be replaced by b0(1§ ?) for some b · b0 · B (“sharp threshold”). verified for trees (Friedgut, Krivelevich, 2000) andF = K3, k = 2 (Friedgut et al., 2006, 100+ pages!) [sort of: it remains open whether b0 = b0 (n) is a constant!] Asymmetric Ramsey properties What happens is if we want to avoid different graphs Fi in different colors i, 1· i · k ? We focus on the case with two colors. Threshold for asym