论文信息 - Threshold functions for asymmetric Ramsey properties involving cycles

Threshold functions for asymmetric Ramsey properties involving cycles

We consider the binomial random graphGn,p and determine a sharp threshold function for the edge-Ramsey property Gn,p → (C1 , . . . , Cr ) for all `1, . . . , `r, where C denotes the cycle of length `. As deterministic consequences of our results, we prove the existence of sparse graphs having the above Ramsey property as well as the existence of infinitely many critical graphs with respect to the property above. AMS subject classification code (1991): 05C55, 05C80, 05C38

Yoshiharu Kohayakawa | Bernd Kreuter | Y. Kohayakawa | Bernd Kreuter

[1] B. Kreuter,et al. Threshold functions for asymmetric Ramsey properties with respect to vertex colorings , 1996, Random Struct. Algorithms.

[2] T. Lu. ON K4-FREE SUBGRAPHS OF RANDOM GRAPHS , 1997 .

[3] Yoshiharu Kohayakawa,et al. Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles , 1995, J. Comb. Theory, Ser. B.

[4] Vojtech Rödl,et al. Random Graphs with Monochromatic Triangles in Every Edge Coloring , 1994, Random Struct. Algorithms.

[5] E. Szemerédi. Regular Partitions of Graphs , 1975 .

[6] Andrzej Rucinski,et al. Ramsey properties of random graphs , 1992, J. Comb. Theory, Ser. B.

[7] V. Rödl,et al. Arithmetic progressions of length three in subsets of a random set , 1996 .

[8] Béla Bollobás,et al. Random Graphs , 1985 .

[9] V. Rödl,et al. Threshold functions for Ramsey properties , 1995 .

[10] Tomasz Luczak. On Ramsey Minimal Graphs , 1994, Electron. J. Comb..

[11] Y. Kohayakawa,et al. Turán's extremal problem in random graphs: Forbidding odd cycles , 1996, Comb..

[12] Y. Kohayakawa. The Regularity Lemma of Szemerédi for Sparse Graphs , 1993 .

[13] Yoshiharu Kohayakawa,et al. An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth , 1998, Comb..

[14] Svante Janson,et al. Poisson Approximation for Large Deviations , 1990, Random Struct. Algorithms.