3 problems

Let $H$ and $G$ be graphs, let $t(H,G)$ denote the homomorphism density of $H$ in $G$, and call an $n$-vertex graph $G$ $(\rho,d)$-nearly-regular when all but at most $\rho n$ vert…

Let $H$ and $G$ be graphs, let $t(H,G)$ denote the homomorphism density of $H$ in $G$, and call an $n$-vertex graph $G$ $(\rho,d)$-dense when every subset $X$ of at least $\rho n$…

Kohayakawa–Nagle–Rödl–Schacht forcing conjecture. If $H$ is not a forest, then $H$ is KNRS-forcing.