REVIEW
A construction for clique-free pseudorandom graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A construction for clique-free pseudorandom graphs
classification
math.CO
keywords
graphspseudorandomconstructiondensityedgefreehighlytheta
read the original abstract
A construction of Alon and Krivelevich gives highly pseudorandom $K_k$-free graphs on $n$ vertices with edge density equal to $\Theta(n^{-1/(k -2)})$. In this short note we improve their result by constructing an infinite family of highly pseudorandom $K_k$-free graphs with a higher edge density of $\Theta(n^{-1/(k - 1)})$.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.