The binomial random graph is a bad inducer

Vishesh Jain, Marcus Michelen, Fan Wei

For a finite graph $F$ and a value $p\in [0,1]$, let $I(F,p)$ denote the largest $y$ for which there is a sequence of graphs of edge density approaching $p$ so that the induced $F…