On oriented cycles in randomly perturbed digraphs
Open Access
- 8 November 2023
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 33 (2) , 157-178
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Bounded-Degree Spanning Trees in Randomly Perturbed GraphsSIAM Journal on Discrete Mathematics, 2017
- Cycles and Matchings in Randomly Perturbed Digraphs and HypergraphsCombinatorics, Probability and Computing, 2016
- Arbitrary Orientations of Hamilton Cycles in DigraphsSIAM Journal on Discrete Mathematics, 2015
- The size Ramsey number of a directed pathJournal of Combinatorial Theory, Series B, 2012
- A Dirac-Type Theorem for 3-Uniform HypergraphsCombinatorics, Probability and Computing, 2006
- How many random edges make a dense graph hamiltonian?Random Structures & Algorithms, 2002
- Triangle Factors in Random GraphsCombinatorics, Probability and Computing, 1997
- Oriented hamilton cycles in digraphsJournal of Graph Theory, 1995
- General first-passage percolationAdvances in Applied Probability, 1983
- Pancyclic graphs IJournal of Combinatorial Theory, Series B, 1971