Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Alon, N.
Capalbo, M.
Kohayakawa, Y.
Rodl, V.
Rucinski, A.
and
Szemeredi, E.
2000.
Universality and tolerance.
p.
14.
Kohayakawa, Y.
and
Rödl, V.
2003.
Regular pairs in sparse random graphs I.
Random Structures & Algorithms,
Vol. 22,
Issue. 4,
p.
359.
Sárközy, Gábor N.
and
Selkow, Stanley
2008.
Distributing vertices along a Hamiltonian cycle in Dirac graphs.
Discrete Mathematics,
Vol. 308,
Issue. 23,
p.
5757.
Sárközy, Gábor N.
2008.
On 2-factors with k components.
Discrete Mathematics,
Vol. 308,
Issue. 10,
p.
1962.
CONLON, DAVID
2009.
Hypergraph Packing and Sparse Bipartite Ramsey Numbers.
Combinatorics, Probability and Computing,
Vol. 18,
Issue. 6,
p.
913.
Sárközy, Gábor N.
2009.
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs.
Discrete Mathematics,
Vol. 309,
Issue. 6,
p.
1611.
Alon, Noga
2010.
An Irregular Mind.
Vol. 21,
Issue. ,
p.
21.
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.
BÖTTCHER, JULIA
KOHAYAKAWA, YOSHIHARU
and
TARAZ, ANUSCH
2013.
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal.
Combinatorics, Probability and Computing,
Vol. 22,
Issue. 5,
p.
639.
Mota, G.O.
Sárközy, G.N.
Schacht, M.
and
Taraz, A.
2015.
Ramsey numbers for bipartite graphs with small bandwidth.
European Journal of Combinatorics,
Vol. 48,
Issue. ,
p.
165.
Böttcher, Julia
2017.
Surveys in Combinatorics 2017.
p.
87.
Bollobás, Béla
Janson, Svante
and
Scott, Alex
2017.
Packing random graphs and hypergraphs.
Random Structures & Algorithms,
Vol. 51,
Issue. 1,
p.
3.
Simonovits, Miklós
and
Szemerédi, Endre
2019.
Building Bridges II.
Vol. 28,
Issue. ,
p.
445.
Mota, G. O.
2019.
Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth.
SIAM Journal on Discrete Mathematics,
Vol. 33,
Issue. 1,
p.
197.