1 problem

For a complete bipartite graph $K_{n,n}$ with independent exponentially distributed edge appearance times of rate $1$, let $L_{nn}(n)$ denote the length of a minimum $n$-assignment…