Turán problems in pseudorandom graphs

Xizhi Liu, Dhruv Mubayi, David Munhá Correia

Given a graph $F$, we consider the problem of determining the densest possible pseudorandom graph that contains no copy of $F$. We provide an embedding procedure that improves a ge…