Random Graphs with Monochromatic Triangles in Every Edge Coloring
暂无分享,去创建一个
[1] Vojtech Rödl,et al. The Algorithmic Aspects of the Regularity Lemma , 1994, J. Algorithms.
[2] J. Folkman. Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring , 1970 .
[3] Svante Janson,et al. Poisson Approximation for Large Deviations , 1990, Random Struct. Algorithms.
[4] Andrzej Rucinski,et al. Ramsey properties of random graphs , 1992, J. Comb. Theory, Ser. B.
[5] Vojtech Rödl,et al. Sparse ramsey graphs , 1984, Comb..
[6] Vojtech Rödl,et al. Large triangle-free subgraphs in graphs withoutK4 , 1986, Graphs Comb..
[7] Béla Bollobás,et al. Threshold functions , 1987, Comb..