Given a balanced bipartite graph that satisfies Hall's theorem (is non singular) then it shown that it has at least one perfect matching.
My question is if the balanced bipartite graph is also acyclic then is the perfect matching unique?
If so (I am almost certain it is), can you point me to a cite-able source? I was not able to such a document.