GRAPHS WITHOUT A RAINBOW PATH OF LENGTH 3

被引：0

作者：

Babinski, Sebastian ^{[1
]}

Grzesik, Andrzej ^{[1
]}

机构：

[1] Jagiellonian Univ, Fac Math & Comp Sci, P-30 348 Krakow, Poland

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 2024年 / 38卷 / 01期

关键词：

extremal graph theory; rainbow coloring; Turan-type problems; TURAN PROBLEM; NUMBERS;

D O I：

10.1137/22M1535048

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In 1959, ErdoH \s and Gallai proved the asymptotically optimal bound for the maximum number of edges in graphs not containing a path of a fixed length. Here, we study a rainbow version of their theorem, in which one considers k \geq 1 graphs on a common set of vertices not creating a path having edges from different graphs and asks for the maximum number of edges in each graph. We prove the asymptotically optimal bound in the case of a path on three edges and any k \geq 1.

引用

页码：629 / 644

页数：16

共 50 条

[21] Acyclic coloring of graphs without bichromatic long path
Jianfeng Hou
Shufei Wu
[J]. Frontiers of Mathematics in China, 2015, 10 : 1343 - 1354
[22] Acyclic coloring of graphs without bichromatic long path
Hou, Jianfeng
Wu, Shufei
[J]. FRONTIERS OF MATHEMATICS IN CHINA, 2015, 10 (06) : 1343 - 1354
[23] Planar graphs without cycles of length from 4 to 7 are 3-colorable
Borodin, OV
Glebov, AN
Raspaud, A
Salavatipour, MR
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 93 (02) : 303 - 311
[24] Planar graphs without adjacent cycles of length at most seven are 3-colorable
Borodin, Oleg V.
Montassier, Mickael
Raspaud, Andre
[J]. DISCRETE MATHEMATICS, 2010, 310 (01) : 167 - 173
[25] The 3-colorability of planar graphs without cycles of length 4, 6 and 9
Kang, Yingli
Jin, Ligang
Wang, Yingqian
[J]. DISCRETE MATHEMATICS, 2016, 339 (01) : 299 - 307
[26] Rainbow graphs
Woldar, AJ
[J]. CODES AND DESIGNS, 2002, 10 : 313 - 322
[27] Geometric graphs with no self-intersecting path of length three
Pach, J
Pinchasi, R
Tardos, G
Tóth, G
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 2004, 25 (06) : 793 - 811
[28] Disjoint path covers with path length constraints in restricted hypercube-like graphs
Park, Jung-Heum
Kim, Hee-Chul
Lim, Hyeong-Seok
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 89 : 246 - 269
[29] On relating edges in graphs without cycles of length 4
Levit, Vadim E.
Tankus, David
[J]. JOURNAL OF DISCRETE ALGORITHMS, 2014, 26 : 28 - 33
[30] Maximum bisections of graphs without cycles of length 4
Rao, Mengjiao
Hou, Jianfeng
Zeng, Qinghou
[J]. DISCRETE MATHEMATICS, 2022, 345 (08)

← 1 2 3 4 5 →