EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
Top Cited Papers
Open Access
- 2 April 2020
- journal article
- research article
- Published by Wiley in Mathematika
- Vol. 66 (2) , 422-447
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Alan Turing Institute
- Engineering and Physical Sciences Research Council (EP/R00532X/1)
- Deutsche Forschungsgemeinschaft (PE 2299/1‐1)
This publication has 30 references indexed in Scilit:
- Powers of tight Hamilton cycles in randomly perturbed hypergraphsRandom Structures & Algorithms, 2019
- Tilings in Randomly Perturbed Dense GraphsCombinatorics, Probability and Computing, 2018
- Almost‐spanning universality in random graphsRandom Structures & Algorithms, 2016
- Embedding nearly-spanning bounded degree treesCombinatorica, 2007
- Adding random edges to dense graphsRandom Structures & Algorithms, 2004
- How many random edges make a dense graph hamiltonian?Random Structures & Algorithms, 2002
- Hall's theorem for hypergraphsJournal of Graph Theory, 2000
- Spanning subgraphs of random graphsGraphs and Combinatorics, 1992
- Threshold functionsCombinatorica, 1987
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952