当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
On Aharoni’s rainbow generalization of the Caccetta–Häggkvist conjecture
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-02-06 , DOI: 10.1016/j.disc.2021.112319 Patrick Hompe , Petra Pelikánová , Aneta Pokorná , Sophie Spirkl
中文翻译:
关于Aharoni对Caccetta–Häggkvist猜想的彩虹概括
更新日期:2021-02-07
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-02-06 , DOI: 10.1016/j.disc.2021.112319 Patrick Hompe , Petra Pelikánová , Aneta Pokorná , Sophie Spirkl
For a digraph and , let be the number of out-neighbors of in . The Caccetta–Häggkvist conjecture states that for all , if is a digraph with such that for all , then G contains a directed cycle of length at most . In Aharoni et al. (2019), Aharoni proposes a generalization of this conjecture, that a simple edge-colored graph on vertices with color classes, each of size , has a rainbow cycle of length at most . In this paper, we prove this conjecture if each color class has size .
中文翻译:
关于Aharoni对Caccetta–Häggkvist猜想的彩虹概括
对于有向图 和 ,让 是...的邻居数 在 。卡塞塔-黑格维斯特猜想指出,对于所有人如果 是一个有向图 这样 对全部 ,则G最多包含一个有向的长度循环 。在Aharoni等。(2019),Aharoni提出了这个猜想的推广,即一个简单的边色图 与顶点 颜色类别,每个大小 ,最大长度为彩虹周期 。在本文中,如果每种颜色类别都有大小,我们就证明了这一猜想。