当前位置:
X-MOL 学术
›
SIAM J. Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
A Rainbow Dirac's Theorem
SIAM Journal on Discrete Mathematics ( IF 0.9 ) Pub Date : 2020-07-30 , DOI: 10.1137/18m1218881 Matthew Coulson , Guillem Perarnau
SIAM Journal on Discrete Mathematics ( IF 0.9 ) Pub Date : 2020-07-30 , DOI: 10.1137/18m1218881 Matthew Coulson , Guillem Perarnau
SIAM Journal on Discrete Mathematics, Volume 34, Issue 3, Page 1670-1692, January 2020.
A famous theorem of Dirac states that any graph on $n$ vertices with minimum degree at least $n/2$ has a Hamilton cycle. Such graphs are called Dirac graphs. Strengthening this result, we show the existence of rainbow Hamilton cycles in $\mu n$-bounded colorings of Dirac graphs for sufficiently small $\mu >0$.
中文翻译:
彩虹狄拉克定理
SIAM离散数学杂志,第34卷,第3期,第1670-1692页,2020年1月
。狄拉克(Dirac)一个著名的定理指出,最小度至少为$ n / 2 $的$ n $个顶点上的任何图都有一个汉密尔顿循环。这样的图称为狄拉克图。加强此结果,我们证明在Dirac图的$ \ mu n $边界着色中存在彩虹汉密尔顿循环,对于足够小的$ \ mu> 0 $。
更新日期:2020-07-31
A famous theorem of Dirac states that any graph on $n$ vertices with minimum degree at least $n/2$ has a Hamilton cycle. Such graphs are called Dirac graphs. Strengthening this result, we show the existence of rainbow Hamilton cycles in $\mu n$-bounded colorings of Dirac graphs for sufficiently small $\mu >0$.
中文翻译:
彩虹狄拉克定理
SIAM离散数学杂志,第34卷,第3期,第1670-1692页,2020年1月
。狄拉克(Dirac)一个著名的定理指出,最小度至少为$ n / 2 $的$ n $个顶点上的任何图都有一个汉密尔顿循环。这样的图称为狄拉克图。加强此结果,我们证明在Dirac图的$ \ mu n $边界着色中存在彩虹汉密尔顿循环,对于足够小的$ \ mu> 0 $。