A note on regular Ramsey graphs
classification
🧮 math.CO
cs.DM
keywords
regularthereabsoluteconstantempheveryexistsgraph
read the original abstract
We prove that there is an absolute constant $C>0$ so that for every natural $n$ there exists a triangle-free \emph{regular} graph with no independent set of size at least $C\sqrt{n\log n}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.