Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs
Approximate Hamilton Decompositions of Robustly Expanding Regular Digraphs
复制标题
鲁棒扩展正则图的近似哈密尔顿分解
DOI:
10.1137/120880951
复制
发表时间:
2013
影响因子:
0.8
通讯作者:
Osthus D
中科院分区:
文献类型:
--
作者:
Osthus D
We show that every sufficiently large-regular digraphwhich has linear degree and is a robust outexpander has an approximate decomposition into edge-disjoint Hamilton cycles, i.e.,contains a set ofedge-disjoint Hamilton cycles. Hereis a robust outexpander if for every setwhich is not too small and not too large, the “robust” outneighborhood ofis a little larger than. This generalizes a result of Kühn, Osthus, and Treglown on approximate Hamilton decompositions of dense regular oriented graphs. It also generalizes a result of Frieze and Krivelevich on approximate Hamilton decompositions of quasirandom (di)graphs. In turn, our result is used as a tool by Kühn and Osthus to prove that any sufficiently large-regular digraphwhich has linear degree and is a robust outexpander even has a Hamilton decomposition.
影响因子:
1
作者:
A. Frieze;Michael Krivelevich;Po
通讯作者:
Po
DOI:
10.48550/arxiv.0807.1827
发表时间:
2008
期刊:
--
影响因子:
--
作者:
Kühn D
通讯作者:
Kühn D