This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We prove that there is an absolute constant C > 0 so that for every natural n there exists a trianglefree regular graph with no independent set of size at least C n log n.