OpenAlex ·
Optimally pseudorandom $K_4$-free graphs
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.32461
- Original
- Read it at the publisher
- Topics
Abstract
We show that optimally pseudorandom $K_4$-free graphs of order $n$ and degree $d = Θ(n^{4/5})$ exist by constructing a graph in the split Cayley hexagon, matching the known upper bound. This resolves the first open case for $K_k$-free graphs after $k=3$ for which Alon gave a tight construction in 1994. This has a variety of implications for $K_4$-free pseudorandom graphs. Furthermore, it implies an explicit lower bound on the Ramsey number of $r(4, t) \geq t^{1.\overline{6} - o(1)}$, improving the previous record by Kostochka, Pudlák, and Rödl of $r(4, t) \geq t^{1.6-o(1)}$.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
More than 83.69% of the zeros of the Riemann zeta function are distinct
Sharp $L^p$ estimates for the strong spherical maximal operator
Full termination of MMP for klt pairs with big boundaries
Counterexamples to the inhomogeneous Duffin-Schaeffer conjecture for a residual set of shifts
A generalized Terao Conjecture for line arrangements
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.