Abstract
AbstractLet G be any graph of minimum degree at least k, and let Gp be the random subgraph of G obtained by keeping each edge independently with probability p. Recently, Krivelevich, Lee and Sudakov showed that if pk → ∞ then with probability tending to 1 Gp contains a cycle of length at least (1 – o(1))k. We give a much shorter proof of this result, also based on depth‐first search. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 45, 764–767, 2014
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
