Author:
Coja-Oghlan Amin,Krivelevich Michael,Vilenchik Dan
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference26 articles.
1. Achlioptas, D., Friedgut, E.: A sharp threshold for k-colorability. Random Struct. Algorithms 14(1), 63–70 (1999)
2. Achlioptas, D., Moore, C.: Random k-sat: Two moments suffice to cross a sharp threshold. SIAM J. Comput. 36(3), 740–762 (2006)
3. Achlioptas, D., Ricci-Tersenghi, F.: On the solution-space geometry of random constraint satisfaction problems. In: Proc. 38th ACM Symp. on Theory of Computing
4. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput. 26(6), 1733–1748 (1997)
5. Ben-Shimon, S., Krivelevich, M.: Random regular graphs of non-constant degree: edge distribution and applications. Manuscript (2006)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献