Gallai-Ramsey Numbers for Monochromatic Triangles or 4-Cycles

被引：4

作者：

Wu, Haibo ^{[1
]}

Magnant, Colton ^{[2
]}

机构：

[1] Northwestern Polytech Univ, Sch Sci, Xian, Shaanxi, Peoples R China

[2] Clayton State Univ, Dept Math, Morrow, GA 30260 USA

来源：

GRAPHS AND COMBINATORICS | 2018年 / 34卷 / 06期

关键词：

COMPLETE GRAPHS; EDGE-COLORINGS; RAINBOW;

D O I：

10.1007/s00373-018-1977-6

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Gallai-Ramsey numbers often consider edge-colorings of complete graphs in which there are no rainbow triangles. Within such colored complete graphs, the goal is to look for specified monochromatic subgraphs. We consider an "off diagonal" case of this concept by looking for either a monochromatic K-3 in one of some set of colors or a monochromatic C-4 in one of some other set of colors.

引用

页码：1315 / 1324

页数：10

共 20 条

[1] Edge-colorings avoiding rainbow and monochromatic subgraphs [J].

Axenovich, Maria ;

Iverson, Perry .

DISCRETE MATHEMATICS, 2008, 308 (20) :4710-4723

[2]

Bush LE, 1953, AM MATH MONTHLY, V60, P539, DOI 10.1080/00029890.1953.11988348

[3]

Cameron K, 1997, J GRAPH THEOR, V26, P9, DOI 10.1002/(SICI)1097-0118(199709)26:1<9::AID-JGT2>3.3.CO

[4]

2-3

[5] EDGE-COLORED COMPLETE GRAPHS WITH PRECISELY COLORED SUBGRAPHS [J].

CHUNG, FRK ;

GRAHAM, RL .

COMBINATORICA, 1983, 3 (3-4) :315-324

[6] GENERALIZED RAMSEY THEORY FOR GRAPHS .2. SMALL DIAGONAL NUMBERS [J].

CHVATAL, V ;

HARARY, F .

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1972, 32 (02) :389-+

[7]

Faudree R. J., 1974, Discrete Mathematics, V8, P313, DOI 10.1016/0012-365X(74)90151-4

[8]

Faudree RJ, 2010, AUSTRALAS J COMB, V46, P269

[9]

Fujita S., 2014, Theory Appl. Graphs

[10] Gallai-Ramsey numbers for cycles [J].

Fujita, Shinya ;

Magnant, Colton .

DISCRETE MATHEMATICS, 2011, 311 (13) :1247-1254

← 1 2 →