Abstract
We prove that there is an absolute constant C>0 so that for every natural n there exists a triangle-free regular graph with no independent set of size at least C√nlog n.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 244-249 |
| Number of pages | 6 |
| Journal | Journal of Graph Theory |
| Volume | 64 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jul 2010 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Geometry and Topology
Keywords
- Ramsey theory
- Regular graphs