2 problems

Fix $k\ge 2$. Let $\delta>\delta_0>0$ and let $n$ be sufficiently large. For a graph $G$, write $D_2(G)$ for the maximum number of edges in a bipartite subgraph of $G$, and call a…

For a fixed integer $k\geq 2$, let $\delta>0$ be sufficiently small. For any $\delta>0$ and sufficiently large $n$, let $G$ be a $C_{2k+1}$-free graph on $n$ vertices with … Let…