Sayaka Olsen

Learn More
We consider a hypergraph generalization of a conjecture of Burr and Erd˝ os 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(More)
  • 1