In this paper we consider specific directed graphs called "ladders". The vertices of the graph are randomly colored by green or red. Deleting the edges with at least one red endpoint one gets a random graph. We give a method for finding the exact asymptotics of the longest path of this random graph if the "height" of the ladder goes to infinity. The result is a generalization of a celebrated theorem of Erdos-Renyi. An example is given, illustrating the method.
"A Method of Investigating the Longest Paths in Certain Random Graphs." Ann. Probab. 11 (1) 217 - 221, February, 1983. https://doi.org/10.1214/aop/1176993670