Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles
暂无分享,去创建一个
[1] Vojtech Rödl,et al. Random Graphs with Monochromatic Triangles in Every Edge Coloring , 1994, Random Struct. Algorithms.
[2] Frank Harary,et al. Graph Theory , 2016 .
[3] Yoshiharu Kohayakawa,et al. The Induced Size-Ramsey Number of Cycles , 1995, Combinatorics, Probability and Computing.
[4] V. Rödl,et al. Threshold functions for Ramsey properties , 1995 .
[5] Zoltán Füredi,et al. Random Ramsey graphs for the four-cycle , 1994, Discret. Math..
[6] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[7] Miklós Simonovits,et al. Extremal subgraphs of random graphs , 1990, J. Graph Theory.
[8] Vojtech Rödl,et al. Large triangle-free subgraphs in graphs withoutK4 , 1986, Graphs Comb..