English

A note on regular Ramsey graphs

Combinatorics 2010-08-12 v2 Discrete Mathematics

Abstract

We prove that there is an absolute constant C>0C>0 so that for every natural nn there exists a triangle-free \emph{regular} graph with no independent set of size at least CnlognC\sqrt{n\log n}.

Keywords

Cite

@article{arxiv.0812.2386,
  title  = {A note on regular Ramsey graphs},
  author = {Noga Alon and Sonny Ben-Shimon and Michael Krivelevich},
  journal= {arXiv preprint arXiv:0812.2386},
  year   = {2010}
}

Comments

5 pages

R2 v1 2026-06-21T11:51:23.749Z