On the maximum $F$-free induced subgraphs in $K_t$-free graphs

József Balogh, Ce Chen, Haoran Luo

For graphs $F$ and $H$, let $f_{F,H}(n)$ be the minimum possible size of a maximum $F$-free induced subgraph in an $n$-vertex $H$-free graph. This notion generalizes the Ramsey fun…