Anti-Ramsey coloring for matchings in complete bipartite graphs

被引：10

作者：

Jin, Zemin ^{[1
]}

Zang, Yuping ^{[1
]}

机构：

[1] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2017年 / 33卷 / 01期

关键词：

Anti-Ramsey number; Matching; Rainbow; EDGE-COLORINGS; RAINBOW NUMBERS;

D O I：

10.1007/s10878-015-9926-2

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The anti-Ramsey number AR(G, H) is defined to be the maximum number of colors in an edge coloring of G which doesn't contain any rainbow subgraphs isomorphic to H. It is clear that there is an AR(K-m,K- n, kK(2))-edge-coloring of K-m,K- n that doesn't contain any rainbow kk(2) . In this paper, we show the uniqueness of this kind of AR(K-m,K- n, kK(2))-edge-coloring of .

引用

页码：1 / 12

页数：12

共 18 条

[1] ON A CONJECTURE OF ERDOS, SIMONOVITS, AND SOS CONCERNING ANTI-RAMSEY THEOREMS
ALON, N
[J]. JOURNAL OF GRAPH THEORY, 1983, 7 (01) : 91 - 94
[2] Bipartite anti-Ramsey numbers of cycles
Axenovich, M
Jiang, T
Kündgen, A
[J]. JOURNAL OF GRAPH THEORY, 2004, 47 (01) : 9 - 28
[3] Erdos P., 1973, Colloq. Math. Soc. Janos. Bolyai, Vol. 10, V10, P657
[4] Rainbow Generalizations of Ramsey Theory: A Survey
Fujita, Shinya
Magnant, Colton
Ozeki, Kenta
[J]. GRAPHS AND COMBINATORICS, 2010, 26 (01) : 1 - 30
[5] Edge-colorings of complete graphs that avoid polychromatic trees
Jiang, T
West, DB
[J]. DISCRETE MATHEMATICS, 2004, 274 (1-3) : 137 - 145
[6] On the Erdos-Simonovits-Sos conjecture about the anti-Ramsey number of a cycle
Jiang, T
West, DB
[J]. COMBINATORICS PROBABILITY & COMPUTING, 2003, 12 (5-6) : 585 - 598
[7] Edge-colorings with no large polychromatic stars
Jiang, T
[J]. GRAPHS AND COMBINATORICS, 2002, 18 (02) : 303 - 308
[8] Anti-Ramsey numbers of subdivided graphs
Jiang, T
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2002, 85 (02) : 361 - 366
[9] Jin ZM, 2013, ARS COMBINATORIA, V111, P75
[10] Jin ZM, 2009, ELECTRON J COMB, V16

← 1 2 →