A Construction for Clique-Free Pseudorandom Graphs

Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe

Research output: Contribution to journalArticle

79 Downloads (Pure)


A construction of Alon and Krivelevich gives highly pseudorandom Kk-free graphs on n vertices with edge density equal to Θ(n−1=(k−2)). In this short note we improve their result by constructing an infinite family of highly pseudorandom Kk-free graphs with a higher edge density of Θ(n−1=(k−1)).

Original languageEnglish
Pages (from-to)307-314
Issue number3
Publication statusPublished - 1 Jun 2020

Fingerprint Dive into the research topics of 'A Construction for Clique-Free Pseudorandom Graphs'. Together they form a unique fingerprint.

Cite this