The aim of this paper is to extend the analysis of Cuckoo Hashing of Devroye and Morin in 2003. In particular we make several asymptotic results much more precise. We show, that the probability that the construction of a hash table succeeds, is asymptotically 1-c(ɛ)/m+O(1/m2) for some explicit c(ɛ), where m denotes the size of each of the two tables, n=m(1-ɛ) is the number of keys and ɛ∈(0,1). The analysis rests on a generating function approach to the so called Cuckoo Graph, a random bipartite graph. We apply a double saddle point method to obtain asymptotic results covering tree sizes, the number of cycles and the probability that no complex component occurs.