Author:
Coja-Oghlan Amin,Krivelevich Michael,Vilenchik Dan
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Achlioptas, D., Friedgut, E.: A sharp threshold for k-colorability. Random Struct. Algorithms 14(1), 63–70 (1999)
2. Achlioptas, D., Molloy, M.: Almost all graphs with 2.522n edges are not 3-colorable. Elec. Jour. Of Comb. 6(1), R29 (1999)
3. Achlioptas, D., Moore, C.: Almost all graphs with average degree 4 are 3-colorable. In: STOC ’02, pp. 199–208 (2002)
4. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. on Comput. 26(6), 1733–1748 (1997)
5. Ben-Sasson, E., Bilu, Y., Gutfreund, D.: Finding a randomly planted assignment in a random 3CNF. Manuscript (2002)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献