Closing Gaps in Problems related to Hamilton Cycles in Random Graphs and Hypergraphs

Electronic Journal Of Combinatorics

Asaf Ferber¹ 

关键词: Random graphs;    hypergraphs;    Hamilton cycles;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graph and hypergraphs. In particular, we firstly show that for $k\geq 3$, if $pn^{

【 授权许可】

Others