Cycles and trees in randomly perturbed sparse digraphs

DOI10.1016/J.DAM.2025.11.046MaRDI QIDQ6859888zbMATH OpenFDO

Authors Yu-Lin Chang, Jichang Wu, Zhiwei Zhang

Publication date 11 February 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.11.046

zbMATH Keywords

Hamilton cyclesrandomly perturbed digraphsspanning treesvertex-pancyclic

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42) Eulerian and Hamiltonian graphs (05C45) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites work

• Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
• Cycle lengths in randomly perturbed graphs
• Cycles and matchings in randomly perturbed digraphs and hypergraphs
• Extending cycles in graphs
• General first-passage percolation
• Hamiltonian circuits in random graphs
• How many random edges make a dense graph hamiltonian?
• scientific article; zbMATH DE number 3149611 (Why is no real title available?)
• scientific article; zbMATH DE number 3943849 (Why is no real title available?)
• scientific article; zbMATH DE number 17673 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Large bounded degree trees in expanding graphs
• Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint)
• On large matchings and cycles in sparse random graphs
• On pancyclic digraphs
• Pancyclic graphs. I
• Random perturbation of sparse graphs
• Some Theorems on Abstract Graphs
• Spanning cycles in random directed graphs
• Spanning trees in random graphs
• Spanning trees of dense directed graphs
• Tight bounds for embedding bounded degree trees
• Universality for bounded degree spanning trees in randomly perturbed graphs
• Vertex pancyclic graphs

This page was built for publication: Cycles and trees in randomly perturbed sparse digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859888)