Pseudorandom clique-free graphs

Anurag Bishnoi wrote a post about a recently finished preprint on pseudorandom clique-free graphs written by me, Anurag, and Valentina Pepe. We (slightly) improve a construction by Alon and Krivelevich from 1997.

Leave a Reply

Your email address will not be published. Required fields are marked *

Mathematics

Previous article

Constructing Cospectral Graphs
History

Next article

Emmy Noether’s Habilitation