A construction for clique-free pseudorandom graphs

Anurag Bishnoi; Ferdinand Ihringer; Valentina Pepe

A construction for clique-free pseudorandom graphs

Combinatorics 2020-01-10 v3

Authors: Anurag Bishnoi , Ferdinand Ihringer , Valentina Pepe

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)})$ .

Keywords

random graphs graph theory

Cite

@article{arxiv.1905.04677,
  title  = {A construction for clique-free pseudorandom graphs},
  author = {Anurag Bishnoi and Ferdinand Ihringer and Valentina Pepe},
  journal= {arXiv preprint arXiv:1905.04677},
  year   = {2020}
}

Comments

minor edits; accepted for publication by Combinatorica

Related papers

View all related →