  In the context of percolation in a regular tree, we study the size of the
largest cluster and the length of the longest run starting within the first d
generations. As d tends to infinity, we prove almost sure and weak convergence
results.
