当前位置:
X-MOL 学术
›
J. Comb. Theory B
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
The multicolour size-Ramsey number of powers of paths
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2020-06-27 , DOI: 10.1016/j.jctb.2020.06.004 Jie Han , Matthew Jenssen , Yoshiharu Kohayakawa , Guilherme Oliveira Mota , Barnaby Roberts
中文翻译:
路径幂的多色大小-拉姆西数
更新日期:2020-06-27
Journal of Combinatorial Theory Series B ( IF 1.2 ) Pub Date : 2020-06-27 , DOI: 10.1016/j.jctb.2020.06.004 Jie Han , Matthew Jenssen , Yoshiharu Kohayakawa , Guilherme Oliveira Mota , Barnaby Roberts
Given a positive integer s, a graph G is s-Ramsey for a graph H, denoted , if every s-colouring of the edges of G contains a monochromatic copy of H. The s-colour size-Ramsey number of a graph H is defined to be . We prove that, for all positive integers k and s, we have , where is the kth power of the n-vertex path .
中文翻译:
路径幂的多色大小-拉姆西数
给定正整数s,对于图H,图G是s-Ramsey,表示为,如果G边缘的每个s色都包含H的单色副本。在S-颜色大小Ramsey数 图H的定义为。我们证明,对于所有正整数k和s,我们都有,在哪里 是n-顶点路径的k次方。