Randomly sampling an acyclic orientation on the complete bipartite graph \(K_{n,k}\) with parts of size n and k, we investigate the length of the longest path. We provide a probability generating function for the distribution of the longest path length, and we use analytic combinatorics to perform asymptotic analysis of the probability distribution in the case of equal part sizes \(n=k\) tending toward infinity. We show that the distribution is asymptotically Gaussian, and we obtain precise asymptotics for the mean and variance. These results address a question asked by Peter J. Cameron.
