Longest paths in random hypergraphs

Given integers k, j with 1 ≤ j ≤ k -1, we consider the length of the longest j-tight path in the binomial random k-uniform hypergraph Hk(n, p). We show that this length undergoes a phase transition from logarithmic length to linear and determine the critical threshold, as well as proving upper and lower bounds on the length in the subcritical and supercritical ranges. In particular, for the supercritical case we introduce the Pathfinder algorithm, a depth-first search algorithm which discovers j-tight paths in a k-uniform hypergraph. We prove that, in the supercritical case, with high probability this algorithm will find a long j-tight path.