A Sequence of Triangle-Free Pseudorandom Graphs
A construction of Alon yields a sequence of highly pseudorandom triangle-free graphs with edge density significantly higher than one might expect from comparison with random graphs. We give an alternative construction for such graphs.
Additional Information© Cambridge University Press 2016. Published online by Cambridge University Press: 13 September 2016. Research supported by a Royal Society University Research Fellowship and by ERC Starting Grant 676632. I would like to thank the anonymous referee for a number of helpful remarks.
Submitted - 1602.03773.pdf