Dense triangle-free $(n, d, λ)$-graphs for all orders

In 1994, Alon construct a triangle-free $(n,d,λ)$-graph with $d = Ω(n^{2/3})$ and $λ= O(d^{1/2})$ for an exponentially increasing sequence of integers $n$. Using his ingenious construction, we deduce that there exist triangle-free $(n,d,λ)$-graphs with $d = Ω(n^{2/3})$ and $λ= O( (d \log n)^{1/2} )$ for all sufficiently large $n$.

No reviews yet.

No comments yet.