On the Ramsey Number of Sparse 3-Graphs

@article{Nagle2008OnTR,
  title={On the Ramsey Number of Sparse 3-Graphs},
  author={Brendan Nagle and Sayaka Olsen and Vojtech R{\"o}dl and Mathias Schacht},
  journal={Graphs and Combinatorics},
  year={2008},
  volume={24},
  pages={205-228}
}
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 3uniform hypergraphs.