On the Ramsey number of sparse 3-graphs

被引：17

作者：

Nagle, Brendan ^{[2
]}

Olsen, Sayaka ^{[3
]}

Roedl, Vojtech ^{[4
]}

Schacht, Mathias ^{[1
]}

机构：

[1] Humboldt Univ, Inst Informat, D-10099 Berlin, Germany

[2] Univ S Florida, Dept Math, Tampa, FL 33620 USA

[3] Univ Nevada, Dept Math & Stat, Reno, NV 89557 USA

[4] Emory Univ, Dept Math & Comp Sci, Atlanta, GA 30322 USA

来源：

GRAPHS AND COMBINATORICS | 2008年 / 24卷 / 03期

基金：

美国国家科学基金会;

关键词：

Ramsey theory; hypergraphs; Burr-Erdos conjecture;

D O I：

10.1007/s00373-008-0784-x

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We consider a hypergraph generalization of a conjecture of Burr and Erdos concerning the Ramsey number of graphs with bounded degree. It was shown by Chvatal, Rodl, Trotter, and Szemeredi [The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory Ser. B 34 (1983), no. 3, 239-243] that the Ramsey number R(G) of a graph G of bounded maximum degree is linear in vertical bar V(G)vertical bar. We derive the analogous result for 3-uniform hypergraphs.

引用

页码：205 / 228

页数：24

共 50 条

[1] On the Ramsey Number of Sparse 3-Graphs
Brendan Nagle
Sayaka Olsen
Vojtěch Rödl
Mathias Schacht
Graphs and Combinatorics, 2008, 24 : 205 - 228
[2] On globally sparse Ramsey graphs
Muetze, Torsten
Peter, Ueli
DISCRETE MATHEMATICS, 2013, 313 (22) : 2626 - 2637
[3] On the Largest Graph-Lagrangian of 3-Graphs with Fixed Number of Edges
Sun, Yanping
Tang, Qingsong
Zhao, Cheng
Peng, Yuejian
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2014, 163 (01) : 57 - 79
[4] A structural result for 3-graphs
Frankl, P.
DISCRETE MATHEMATICS, 2017, 340 (05) : 1039 - 1041
[5] A PROBLEM OF ERDOS AND SOS ON 3-GRAPHS
Glebov, Roman
Kral, Daniel
Volec, Jan
ISRAEL JOURNAL OF MATHEMATICS, 2016, 211 (01) : 349 - 366
[6] Ramsey numbers for multiple copies of sparse graphs
Sulser, Aurelio
Trujic, Milos
JOURNAL OF GRAPH THEORY, 2024, 106 (04) : 843 - 870
[7] New Turan densities for 3-graphs
Baber, Rahil
Talbot, John
ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (02)
[8] THE CODEGREE THRESHOLD FOR 3-GRAPHS WITH INDEPENDENT NEIGHBORHOODS
Falgas-Ravry, Victor
Marchant, Edward
Pikhurko, Oleg
Vaughan, Emil R.
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (03) : 1504 - 1539
[9] The Turan number of sparse spanning graphs
Alon, Noga
Yuster, Raphael
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2013, 103 (03) : 337 - 343
[10] A NOTE ON A TURAN-TYPE EXTREMAL QUESTION ON 3-GRAPHS
Szecsi, Vajk
STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2014, 51 (01) : 24 - 26

← 1 2 3 4 5 →