Maximum induced paths in random bipartite graphs

We prove that the maximum size of an induced path in the binomial bipartite random graph G(n,n,p = 1/2) is concentrated asymptotically almost surely at three consecutive points.