An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth
暂无分享,去创建一个
[1] C. T. Benson. Minimal Regular Graphs of Girths Eight and Twelve , 1966, Canadian Journal of Mathematics.
[2] M. Simonovits,et al. Cycles of even length in graphs , 1974 .
[3] B. Bollobás,et al. Extremal Graph Theory , 2013 .
[4] Miklós Simonovits,et al. Compactness results in extremal graph theory , 1982, Comb..
[5] János Komlós,et al. Extremal Uncrowded Hypergraphs , 1982, J. Comb. Theory, Ser. A.
[6] Daniel J. Kleitman,et al. On the number of graphs without 4-cycles , 1982, Discret. Math..
[7] Béla Bollobás,et al. Random Graphs , 1985 .
[8] Zoltán Füredi,et al. Exact solution of some Turán-type problems , 1987, J. Comb. Theory, Ser. A.
[9] Miklós Simonovits,et al. Extremal subgraphs of random graphs , 1990, J. Graph Theory.
[10] Rephael Wenger,et al. Extremal graphs with no C4's, C6's, or C10's , 1991, J. Comb. Theory, Ser. B.
[11] Zoltán Füredi,et al. Random Ramsey graphs for the four-cycle , 1994, Discret. Math..
[12] Vojtech Rödl,et al. On Uncrowded Hypergraphs , 1995, Random Struct. Algorithms.
[13] Yoshiharu Kohayakawa,et al. Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles , 1995, J. Comb. Theory, Ser. B.
[14] Y. Kohayakawa,et al. Turán's extremal problem in random graphs: Forbidding odd cycles , 1996, Comb..
[15] B. Kreuter,et al. Threshold functions for asymmetric Ramsey properties with respect to vertex colorings , 1996, Random Struct. Algorithms.
[16] T. Lu. ON K4-FREE SUBGRAPHS OF RANDOM GRAPHS , 1997 .