Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
CrossRef.
Krivelevich, Michael
Kwan, Matthew
and
Sudakov, Benny
2017.
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 31,
Issue. 1,
p.
155.
Gishboliner, Lior
Krivelevich, Michael
and
Kronenberg, Gal
2018.
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments.
Random Structures & Algorithms,
Vol. 52,
Issue. 4,
p.
545.
Böttcher, Julia
Han, Jie
Kohayakawa, Yoshiharu
Montgomery, Richard
Parczyk, Olaf
and
Person, Yury
2019.
Universality for bounded degree spanning trees in randomly perturbed graphs.
Random Structures & Algorithms,
Vol. 55,
Issue. 4,
p.
854.
Bedenknecht, Wiebke
Han, Jie
Kohayakawa, Yoshiharu
and
Mota, Guilherme O.
2019.
Powers of tight Hamilton cycles in randomly perturbed hypergraphs.
Random Structures & Algorithms,
Vol. 55,
Issue. 4,
p.
795.
BALOGH, JÓZSEF
TREGLOWN, ANDREW
and
WAGNER, ADAM ZSOLT
2019.
Tilings in Randomly Perturbed Dense Graphs.
Combinatorics, Probability and Computing,
Vol. 28,
Issue. 2,
p.
159.
Aigner-Horev, Elad
and
Person, Yury
2019.
Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers.
SIAM Journal on Discrete Mathematics,
Vol. 33,
Issue. 4,
p.
2175.
Anastos, Michael
and
Frieze, Alan
2019.
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected?.
Journal of Graph Theory,
Vol. 92,
Issue. 4,
p.
405.
Böttcher, Julia
Montgomery, Richard
Parczyk, Olaf
and
Person, Yury
2020.
EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS.
Mathematika,
Vol. 66,
Issue. 2,
p.
422.
Kim, Jaehoon
Kim, Younjin
and
Liu, Hong
2020.
Tree decompositions of graphs without large bipartite holes.
Random Structures & Algorithms,
Vol. 57,
Issue. 1,
p.
150.
Han, Jie
and
Zhao, Yi
2020.
Hamiltonicity in randomly perturbed hypergraphs.
Journal of Combinatorial Theory, Series B,
Vol. 144,
Issue. ,
p.
14.
Dowden, Chris
Kang, Mihyun
and
Krivelevich, Michael
2020.
The genus of the Erdős‐Rényi random graph and the fragile genus property.
Random Structures & Algorithms,
Vol. 56,
Issue. 1,
p.
97.
Joos, Felix
and
Kim, Jaehoon
2020.
Spanning trees in randomly perturbed graphs.
Random Structures & Algorithms,
Vol. 56,
Issue. 1,
p.
169.
Parczyk, Olaf
2020.
2-universality in randomly perturbed graphs.
European Journal of Combinatorics,
Vol. 87,
Issue. ,
p.
103118.
Das, Shagnik
and
Treglown, Andrew
2020.
Ramsey properties of randomly perturbed graphs: cliques and cycles.
Combinatorics, Probability and Computing,
Vol. 29,
Issue. 6,
p.
830.
Han, Jie
Morris, Patrick
and
Treglown, Andrew
2021.
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu.
Random Structures & Algorithms,
Vol. 58,
Issue. 3,
p.
480.