1 problem

Let $P_s$ be the path with $s$ vertices, and let $obreakhat r(F1,F2)$ denote the minimum number of edges in a graph that arrows $(F1,F2)$. For positive integers $k$ and sufficient…