Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
2000.
Random Graphs.
p.
307.
Frieze, Alan
and
Krivelevich, Michael
2006.
Almost universal graphs.
Random Structures & Algorithms,
Vol. 28,
Issue. 4,
p.
499.
Fürer, Martin
and
Prasad Kasiviswanathan, Shiva
2008.
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques.
Vol. 5171,
Issue. ,
p.
416.
Capalbo, Michael
2010.
Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$.
Random Structures & Algorithms,
Vol. 37,
Issue. 4,
p.
437.
Krivelevich, Michael
Sudakov, Benny
and
Wormald, Nicholas
2011.
Regular induced subgraphs of a random Graph.
Random Structures & Algorithms,
Vol. 38,
Issue. 3,
p.
235.
Dellamonica,, Domingos
Kohayakawa, Yoshiharu
Rödl, Vojtěch
and
Ruciński, Andrzej
2012.
Universality of Random Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 26,
Issue. 1,
p.
353.
Kühn, Daniela
and
Osthus, Deryk
2012.
On Pósa's Conjecture for Random Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 26,
Issue. 3,
p.
1440.
Wormald, Nicholas
2013.
Handbook of Graph Theory, Second Edition.
Vol. 20134658,
Issue. ,
p.
980.
FÜRER, MARTIN
and
KASIVISWANATHAN, SHIVA PRASAD
2014.
Approximately Counting Embeddings into Random Graphs.
Combinatorics, Probability and Computing,
Vol. 23,
Issue. 6,
p.
1028.
Allen, Peter
Böttcher, Julia
Hàn, Hiệp
Kohayakawa, Yoshiharu
and
Person, Yury
2014.
LATIN 2014: Theoretical Informatics.
Vol. 8392,
Issue. ,
p.
355.
Böttcher, Julia
Kohayakawa, Yoshiharu
Taraz, Anusch
and
Würfl, Andreas
2015.
An Extension of the Blow-up Lemma to Arrangeable Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 29,
Issue. 2,
p.
962.
Parczyk, O.
and
Person, Y.
2015.
On Spanning Structures in Random Hypergraphs.
Electronic Notes in Discrete Mathematics,
Vol. 49,
Issue. ,
p.
611.
Parczyk, Olaf
and
Person, Yury
2016.
Spanning structures and universality in sparse hypergraphs.
Random Structures & Algorithms,
Vol. 49,
Issue. 4,
p.
819.
Böttcher, Julia
Montgomery, Richard
Parczyk, Olaf
and
Person, Yury
2017.
Embedding spanning bounded degree subgraphs in randomly perturbed graphs.
Electronic Notes in Discrete Mathematics,
Vol. 61,
Issue. ,
p.
155.
Böttcher, Julia
2017.
Surveys in Combinatorics 2017.
p.
87.
Ferber, Asaf
Luh, Kyle
and
Nguyen, Oanh
2017.
Embedding large graphs into a random graph.
Bulletin of the London Mathematical Society,
Vol. 49,
Issue. 5,
p.
784.
Allen, Peter
Böttcher, Julia
Hàn, Hiệp
Kohayakawa, Yoshiharu
and
Person, Yury
2017.
Powers of Hamilton cycles in pseudorandom graphs.
Combinatorica,
Vol. 37,
Issue. 4,
p.
573.
Ferber, Asaf
and
Nenadov, Rajko
2018.
Spanning universality in random graphs.
Random Structures & Algorithms,
Vol. 53,
Issue. 4,
p.
604.
Škorić, Nemanja
Steger, Angelika
and
Trujić, Miloš
2018.
Local resilience of an almost spanning k‐cycle in random graphs.
Random Structures & Algorithms,
Vol. 53,
Issue. 4,
p.
728.
Allen, Peter
Koch, Christoph
Parczyk, Olaf
and
Person, Yury
2018.
LATIN 2018: Theoretical Informatics.
Vol. 10807,
Issue. ,
p.
28.