2 problems

For a graph $G$ and a graph $F$, let $\delta^*(G,F)$ be the maximum minimum degree of a subgraph $H\subset G$ that has a proper edge-coloring with no rainbow copy of $F$. Let $Q_n$…

For a graph $G$ and a graph $F$, let $\mathrm{ex^*}(G,F)$ be the maximum number of edges in a subgraph of $G$ that has a proper edge-coloring with no rainbow copy of $F$. The $n$-d…