This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
 J. A. Bondy and P. Erdős (1973) Ramsey numbers for cycles in graphs. J. Combin. Theory Ser. B 14 46–54.
 O. Cooley , N. Fountoulakis , D. Kühn and D. Osthus (2008) 3-uniform hypergraphs of bounded degree have linear Ramsey numbers. J. Combin. Theory Ser. B 98 484–505.
 R. Faudree and R. Schelp (1974) All Ramsey numbers for cycles in graphs. Discrete Math. 8 313–329.
 A. Figaj and T. Łuczak (2007) The Ramsey number for a triple of long even cycles. J. Combin. Theory Ser. B 97 584–596.
 P. Frankl and V. Rödl (2002) Extremal problems on set systems. Random Struct. Algorithms 20 131–164.
 P. Haxell , T. Łuczak , Y. Peng , V. Rödl , A. Ruciński , M. Simonovits and J. Skokan (2006) The Ramsey number for hypergraph cycles I. J. Combin. Theory Ser. A 113 67–83.
 T. Łuczak (1999) R(Cn, Cn, Cn) ≤ (4 + o(1))n. J. Combin. Theory Ser. B 75 174–187.
 B. Nagle , S. Olsen , V. Rödl and M. Schacht (2008) On the Ramsey number of sparse 3-graphs. Graphs Combin. 24 205–228.
 J. Polcyn , V. Rödl , A. Ruciński and E. Szemerédi (2006) Short paths in quasi-random triple systems with sparse underlying graphs. J. Combin. Theory Ser. B 96 584–607.
 V. Rödl , A. Ruciński and E. Szemerédi (2006) A Dirac-type theorem for 3-uniform hypergraphs. Combin. Probab. Comput. 15 253–279.
 V. Rosta (1973) On a Ramsey-type problem of J. A. Bondy and P. Erdős, I and II. J. Combin. Theory Ser. B 15 94–104, 105–120.