Compatible Hamilton cycles in random graphs.

Michael Krivelevich,Choongbum Lee,Benny Sudakov

RANDOM STRUCTURES & ALGORITHMS（2016）

引用 5|浏览9

暂无评分

摘要

A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability p c log n/n, the random graph G(n,p) is asym

查看译文

关键词

random graphs,Hamilton cycles,incomparability systems,rainbow cycles

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要