2-universality in randomly perturbed graphs
Author:
- 1 June 2020
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 87
Abstract
No abstract availableAll Related Versions
Funding Information
- Carl-Zeiss-Stiftung
This publication has 22 references indexed in Scilit:
- Powers of tight Hamilton cycles in randomly perturbed hypergraphsRandom Structures & Algorithms, 2019
- Universality for bounded degree spanning trees in randomly perturbed graphsRandom Structures & Algorithms, 2019
- Tilings in Randomly Perturbed Dense GraphsCombinatorics, Probability and Computing, 2018
- An improved upper bound on the density of universal random graphsRandom Structures & Algorithms, 2014
- The size Ramsey number of a directed pathJournal of Combinatorial Theory, Series B, 2012
- Adding random edges to dense graphsRandom Structures & Algorithms, 2004
- How many random edges make a dense graph hamiltonian?Random Structures & Algorithms, 2002
- Embedding Arbitrary Graphs of Maximum Degree TwoJournal of the London Mathematical Society, 1993
- Threshold functionsCombinatorica, 1987
- Some Theorems on Abstract GraphsProceedings of the London Mathematical Society, 1952