GALLAI-RAMSEY NUMBERS FOR RAINBOW TREES AND MONOCHROMATIC COMPLETE BIPARTITE GRAPHS

被引：0

作者：

Li, Luyi ^{[1
]}

Li, Xueliang ^{[1
,2
,3
]}

Mao, Yaping

Si, Yuan ^{[1
]}

机构：

[1] Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China

[2] Qinghai Normal Univ, Acad Plateau Sci & Sustainabil, Xining 810008, Qinghai, Peoples R China

[3] Stat Qinghai Normal Univ, Sch Math, Xining 810008, Qinghai, Peoples R China

来源：

DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2024年

关键词：

Ramsey theory; Gallai-Ramsey number; complete bipartite graph;

D O I：

10.7151/dmgt.2555

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Given two non-empty graphs G, H and a positive integer k , the GallaiRamsey number gr(k)(G k ( G : H ) is defined as the minimum positive integer N such that for all n > N , every k-edge-colored K- n contains either a rainbow subgraph G or a monochromatic subgraph H . In this paper, we get some exact values or bounds of gr(k)(K-1,K-3 : H ), gr(k)(P-5 : H ), and gr(k) ( P- 4 (+) : H ) for k >= 3, where H is a complete bipartite graph.

引用

页数：22