A sequence of triangle-free pseudorandom graphs

TL;DR

This paper presents an alternative method for constructing a sequence of highly pseudorandom triangle-free graphs with higher edge density than expected in random graphs, expanding the toolkit for graph theory research.

Contribution

It introduces a new construction technique for triangle-free pseudorandom graphs that surpasses previous density limitations.

Findings

Constructed a new sequence of triangle-free pseudorandom graphs

Achieved higher edge density than in comparable random graphs

Provided an alternative to Alon's original construction

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.