On the Ramsey Number of Sparse 3-Graphs

We consider a hypergraph generalization of a conjecture of Burr and Erdős concerning the Ramsey number of graphs with bounded degree. It was shown by Chvátal, Rödl, Trotter, and Szemerédi [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 |V(G)|. We derive the analogous result for 3-uniform hypergraphs.

[1]  S. Burr.  ON THE MAGNITUDE OF GENERALIZED RAMSEY NUMBERS FOR GRAPHS , 1973 .

[2]  Vojtech Rödl,et al.  The Ramsey number of a graph with bounded maximum degree , 1983, J. Comb. Theory, Ser. B.

[3]  Richard H. Schelp,et al.  Graphs with Linearly Bounded Ramsey Numbers , 1993, J. Comb. Theory, Ser. B.

[4]  Noga Alon.  Subdivided graphs have linear ramsey numbers , 1994, J. Graph Theory.

[5]  M. Simonovits,et al.  Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .

[6]  Nancy Eaton.  Ramsey numbers for sparse graphs , 1998, Discret. Math..

[7]  Vojtech Rödl,et al.  The asymptotic number of triple systems not containing a fixed one , 2001, Discret. Math..

[8]  Vojtech Rödl,et al.  On graphs with small Ramsey numbers , 2001, J. Graph Theory.

[9]  Vojtech Rödl,et al.  Extremal problems on set systems , 2002, Random Struct. Algorithms.

[10]  Vojtech Rödl,et al.  On Graphs With Small Ramsey Numbers, II , 2004, Comb..

[11]  Terence Tao.  A variant of the hypergraph removal lemma , 2006, J. Comb. Theory, Ser. A.

[12]  Vojtech Rödl,et al.  The Ramsey number for hypergraph cycles I , 2006, J. Comb. Theory, Ser. A.

[13]  Vojtech Rödl,et al.  The counting lemma for regular k‐uniform hypergraphs , 2006, Random Struct. Algorithms.

[14]  Vojtech Rödl,et al.  On Ramsey numbers of uniform hypergraphs with given maximum degree , 2006, J. Comb. Theory A.

[15]  RodlVojtech,et al.  Regular Partitions of Hypergraphs , 2007 .

[16]  Vojtech Rödl,et al.  Regular Partitions of Hypergraphs: Regularity Lemmas , 2007, Combinatorics, Probability and Computing.

[17]  Daniela Kühn,et al.  3-Uniform hypergraphs of bounded degree have linear Ramsey numbers , 2008, J. Comb. Theory, Ser. B.