Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Triangle-factors in pseudorandom graphs (1805.09710v1)

Published 24 May 2018 in math.CO

Abstract: We show that if the second eigenvalue $\lambda$ of a $d$-regular graph $G$ on $n \in 3 \mathbb{Z}$ vertices is at most $\varepsilon d2/(n \log n)$, for a small constant $\varepsilon > 0$, then $G$ contains a triangle-factor. The bound on $\lambda$ is at most an $O(\log n)$ factor away from the best possible one: Krivelevich, Sudakov and Szab\'o, extending a construction of Alon, showed that for every function $d = d(n)$ such that $\Omega(n{2/3}) \le d \le n$ and infinitely many $n \in \mathbb{N}$ there exists a $d$-regular triangle-free graph $G$ with $\Theta(n)$ vertices and $\lambda = \Omega(d2 / n)$.

Summary

We haven't generated a summary for this paper yet.