Before revision: The main purpose of this work is to prove a theorem about the probability that a random mapping  possesses a unique highest tree in its underlying graph.
After revision: The main purpose of this work is to prove a theorem about the probability that a random mapping of n elements possesses a unique highest tree in its underlying graph.