Longest cycles in sparse random digraphs

DOI10.1002/rsa.20435zbMath1270.05050arXiv1102.3147OpenAlexW2044179554MaRDI QIDQ2844080

Eyal Lubetzky, Michael Krivelevich, Benjamin Sudakov

Publication date: 27 August 2013

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.3147

zbMATH Keywords

directed graphsrandom digraphlong cyclessparse random graphslong paths

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths ⋮ Cycle lengths in sparse random graphs ⋮ Cycle lengths in randomly perturbed graphs ⋮ A scaling limit for the length of the longest cycle in a sparse random digraph ⋮ The birth of the strong components ⋮ On the Method of Typical Bounded Differences ⋮ A scaling limit for the length of the longest cycle in a sparse random graph ⋮ A classification of isomorphism-invariant random digraphs

Cites Work

• Unnamed Item
• The size Ramsey number of a directed path
• Long paths in sparse random graphs
• On large matchings and cycles in sparse random graphs
• An algorithm for finding Hamilton paths and cycles in random graphs
• The longest path in a random graph
• On tail probabilities for martingales
• Long cycles in subgraphs of (pseudo)random directed graphs
• Clutter percolation and random graphs
• Cycles in a random graph near the critical point

This page was built for publication: Longest cycles in sparse random digraphs