Consider that we have a complete bipartite graph with $2n $ vertices. In each part of this graph we have $n $ vertices. We want to choose $i\leq n$ edges of this graph such that none of the two selected edges has a common vertex.
How many choices do we have?
For example, when $i=n$, we have $n!$ choices.