New lower bounds on the size-Ramsey number of a path

被引：4

作者：

Bal, Deepak ^{[1
]}

DeBiasio, Louis ^{[2
]}

机构：

[1] Montclair State Univ, Dept Marthemat, Montclair, NJ 07043 USA

[2] Miami Univ, Dept Math, Oxford, OH 45056 USA

来源：

ELECTRONIC JOURNAL OF COMBINATORICS | 2022年 / 29卷 / 01期

关键词：

GRAPHS; CYCLES;

D O I：

10.37236/9804

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We prove that for all graphs with at most (3.75 - o(1))n edges there exists a 2-coloring of the edges such that every monochromatic path has order less than n. This was previously known to be true for graphs with at most 2.5n - 7.5 edges. We also improve on the best-known lower bounds in the r-color case.

引用

页数：20

共 50 条

[1] Lower bound on the size-Ramsey number of tight paths
Winter, Christian
[J]. JOURNAL OF COMBINATORICS, 2023, 14 (02) : 271 - 279
[2] On the Size-Ramsey Number of Hypergraphs
Dudek, Andrzej
La Fleur, Steven
Mubayi, Dhruv
Rodl, Vojtech
[J]. JOURNAL OF GRAPH THEORY, 2017, 86 (01) : 104 - 121
[3] The vertex size-Ramsey number
Dudek, Andrzej
Lesniak, Linda
[J]. DISCRETE MATHEMATICS, 2016, 339 (06) : 1753 - 1762
[4] THE SIZE-RAMSEY NUMBER OF TREES
HAXELL, PE
KOHAYAKAWA, Y
[J]. ISRAEL JOURNAL OF MATHEMATICS, 1995, 89 (1-3) : 261 - 274
[5] On the size-Ramsey number of grids
Conlon, David
Nenadov, Rajko
Trujic, Milos
[J]. COMBINATORICS PROBABILITY AND COMPUTING, 2023, 32 (06) : 874 - 880
[6] On the Size-Ramsey Number of Cycles
Javadi, R.
Khoeini, F.
Omidi, G. R.
Pokrovskiy, A.
[J]. COMBINATORICS PROBABILITY & COMPUTING, 2019, 28 (06): : 871 - 880
[7] The size-Ramsey number of trees
Dellamonica, Domingos, Jr.
[J]. RANDOM STRUCTURES & ALGORITHMS, 2012, 40 (01) : 49 - 73
[8] ON THE SIZE-RAMSEY NUMBER OF TIGHT PATHS
Lu, Linyuan
Wang, Zhiyu
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (03) : 2172 - 2179
[9] On the size-Ramsey number of grid graphs
Clemens, Dennis
Miralaei, Meysam
Reding, Damian
Schacht, Mathias
Taraz, Anusch
[J]. COMBINATORICS PROBABILITY & COMPUTING, 2021, 30 (05): : 670 - 685
[10] The size-Ramsey number of short subdivisions
Draganic, Nemanja
Krivelevich, Michael
Nenadov, Rajko
[J]. RANDOM STRUCTURES & ALGORITHMS, 2021, 59 (01) : 68 - 78

← 1 2 3 4 5 →