A sequence of triangle-free pseudorandom graphs
Combinatorics
2016-09-21 v2
Abstract
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.
Keywords
Cite
@article{arxiv.1602.03773,
title = {A sequence of triangle-free pseudorandom graphs},
author = {David Conlon},
journal= {arXiv preprint arXiv:1602.03773},
year = {2016}
}
Comments
6 pages