Michael Krivelevich, Eyal Lubetzky, Benny Sudakov. Longest cycles in sparse random digraphs. Random Struct. Algorithms, 43(1):1-15, 2013. [doi]
@article{KrivelevichLS13,
title = {Longest cycles in sparse random digraphs},
author = {Michael Krivelevich and Eyal Lubetzky and Benny Sudakov},
year = {2013},
doi = {10.1002/rsa.20435},
url = {http://dx.doi.org/10.1002/rsa.20435},
researchr = {https://researchr.org/publication/KrivelevichLS13},
cites = {0},
citedby = {0},
journal = {Random Struct. Algorithms},
volume = {43},
number = {1},
pages = {1-15},
}