Holes in Graphs
暂无分享,去创建一个
[1] Paul Erdös,et al. Vertex coverings by monochromatic cycles and trees , 1991, J. Comb. Theory, Ser. B.
[2] W. T. Gowers,et al. Lower bounds of tower type for Szemerédi's uniformity lemma , 1997 .
[3] Yoshiharu Kohayakawa,et al. Near-optimum Universal Graphs for Graphs with Bounded Degrees , 2001, RANDOM-APPROX.
[4] Yoshiharu Kohayakawa,et al. Universality and tolerance , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[5] M. Simonovits,et al. Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .
[6] Vojtech Rödl,et al. On Bipartite Graphs with Linear Ramsey Numbers , 2001, Comb..
[7] Penny E. Haxell,et al. Partitioning Complete Bipartite Graphs by Monochromatic Cycles, , 1997, J. Comb. Theory, Ser. B.
[8] Svante Janson,et al. Random graphs , 2000, ZOR Methods Model. Oper. Res..