• Mathematics, Computer Science
  • Published in Random Struct. Algorithms 2007
  • DOI:10.1002/rsa.20260

Ramsey numbers of sparse hypergraphs

@article{Conlon2007RamseyNO,
  title={Ramsey numbers of sparse hypergraphs},
  author={David Conlon and Jacob Fox and Benny Sudakov},
  journal={Random Struct. Algorithms},
  year={2007},
  volume={35},
  pages={1-14}
}
We give a short proof that any k-uniform hypergraph H on n vertices with bounded degree \Delta has Ramsey number at most c(\Delta, k)n, for an appropriate constant c(\Delta, k). This result was recently proved by several authors, but those proofs are all based on applications of the hypergraph regularity method. Here we give a much simpler, self-contained proof which uses new techniques developed recently by the authors together with an argument of Kostochka and R\"odl. Moreover, our method… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 32 REFERENCES

Ruciński: On graphs with linear Ramsey numbers

R. L. Graham, A. V. Rödl
  • J. Graph Theory
  • 2000
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Graham: On partition theorems for finite graphs, Infinite and Finite Sets (Colloq., Keszthely, 1973: dedicated to P

R.L.P. Erdős
  • Erdős on his 60th birthday),
  • 1975
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Rödl : On Ramsey numbers of uniform hypergraphs with given maximum degree

V. A. V. Kostochka
  • J . Combin . Theory Ser . A
  • 2006

Schacht : The counting lemma for kuniform hypergraphs ,

S. Olsen, V. Rödl, B. Nagle, M.
  • Random Struct . Algorithms
  • 2006