3 problems

Let $F$ be an $r$-uniform hypergraph. When the limit exists, define its relative Turán exponent by … where the supremum is over all $r$-graphs $H$ with maximum degree at most…

Let $F$ and $H$ be graphs, let $H$ have maximum degree $\Delta$, and let $\operatorname{ex}(H,F)$ denote the maximum number of edges in an $F$-free subgraph of $H$. Relative Turán…

Let $F$ and $H$ be graphs, and let $H$ have minimum degree $d4c$ and maximum degree $\Delta$. A spanning subgraph is $F$-free if it contains no copy of $F$. Foucaud–Krivelevich–Per…