Perfect Matchings: Trees and Dirac-Type Degree Conditions

A tree has at most one perfect matching (uniqueness, via the acyclic symmetric-difference argument); and any graph on $2n$ vertices with minimum degree $\ge n$ has a perfect matching (existence, Dirac-type).