OnK4-free subgraphs of random graphs
暂无分享,去创建一个
[1] Yoshiharu Kohayakawa,et al. Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles , 1995, J. Comb. Theory, Ser. B.
[2] Zoltán Füredi,et al. Random Ramsey graphs for the four-cycle , 1994, Discret. Math..
[3] Vojtech Rödl,et al. Large triangle-free subgraphs in graphs withoutK4 , 1986, Graphs Comb..
[4] Yoshiharu Kohayakawa,et al. An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth , 1998, Comb..
[5] V. Rödl,et al. Threshold functions for Ramsey properties , 1995 .
[6] V. Rödl,et al. Arithmetic progressions of length three in subsets of a random set , 1996 .
[7] Y. Kohayakawa,et al. Turán's extremal problem in random graphs: Forbidding odd cycles , 1996, Comb..
[8] Yoshiharu Kohayakawa,et al. The Induced Size-Ramsey Number of Cycles , 1995, Combinatorics, Probability and Computing.
[9] B. Bollobás,et al. Extremal Graph Theory , 2013 .
[10] E. Szemerédi. Regular Partitions of Graphs , 1975 .
[11] Béla Bollobás,et al. Random Graphs , 1985 .
[12] Frank Harary,et al. Graph Theory , 2016 .
[13] Fan Chung Graham. Subgraphs of a hypercube containing no small even cycles , 1992, J. Graph Theory.
[14] Y. Kohayakawa. Szemerédi's regularity lemma for sparse graphs , 1997 .
[15] Svante Janson,et al. Poisson Approximation for Large Deviations , 1990, Random Struct. Algorithms.