Suppose $G$ is a graph and $\eta$ is a subgraph. Assume the subgraph contains all the vertices. Is there any way to upper bound the number of edges in $G$ between components of $\eta$?
Suppose $G$ is a graph and $\eta$ is a subgraph. Assume the subgraph contains all the vertices. Is there any way to upper bound the number of edges in $G$ between components of $\eta$?
