Hamilton Cycles in Sparse Robustly Expanding Digraphs

Electronic Journal Of Combinatorics

Allan Lo¹ 

关键词: Digraph;    Robust expanders;    Hamilton cycles;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The notion of robust expansion has played a central role in the solution of several conjectures involving the packing of Hamilton cycles in graphs and directed graphs. These and other results usually rely on the fact that every robustly expanding (di)grap

【 授权许可】

Others