2 problems

Let $n \geq 3$, and let $\mathcal{M} = (G, \textit{In}, \textit{Out}, \textit{Leak})$ be an $n$-compartment directed-cycle model with $\textit{In}=\{1\}$ and $\textit{Out}=\{p\}$,…

Let $G$ be a graph with $n$ vertices and at most $2n-2$ edges with an exchange, and let $G'$ be the resulting collapsed graph. The collapse conjecture. If $G'$ has $n-1$ edges, the…