2 problems

Let $C_4$ denote the cycle of length four, and let $\operatorname{ex}^{-1}(k,H)$ denote the inverse Turán number of $H$, namely the maximum number of edges in a graph whose every…

Let $t$ be a positive integer, let $P_{2t}$ denote the path of length $2t$, and let $\operatorname{ex}^{-1}(k,H)$ denote the inverse Turán number of $H$, namely the maximum number…