Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Kohayakawa, Y.
Łuczak, T.
and
Rödl, V.
1997.
OnK 4-free subgraphs of random graphs.
Combinatorica,
Vol. 17,
Issue. 2,
p.
173.
Kohayakawa, Y.
1997.
Foundations of Computational Mathematics.
p.
216.
Kohayakawa, Y.
and
Rödl, V.
2000.
LATIN 2000: Theoretical Informatics.
Vol. 1776,
Issue. ,
p.
1.
Komlós, János
Shokoufandeh, Ali
Simonovits, Miklós
and
Szemerédi, Endre
2002.
Theoretical Aspects of Computer Science.
Vol. 2292,
Issue. ,
p.
84.
Kohayakawa, Y.
and
Rödl, V.
2003.
Regular pairs in sparse random graphs I.
Random Structures & Algorithms,
Vol. 22,
Issue. 4,
p.
359.
Donadelli, Jair
Haxell, Penny E.
and
Kohayakawa, Yoshiharu
2005.
A note on the Size-Ramsey number of long subdivisions of graphs.
RAIRO - Theoretical Informatics and Applications,
Vol. 39,
Issue. 1,
p.
191.
Kostochka, Alexandr
and
Sheikh, Naeem
2006.
Topics in Discrete Mathematics.
Vol. 26,
Issue. ,
p.
155.
Bielak, Halina
2006.
Size Ramsey numbers for some regular graphs.
Electronic Notes in Discrete Mathematics,
Vol. 24,
Issue. ,
p.
39.
Kohayakawa, Yoshiharu
Rödl, Vojtěch
Schacht, Mathias
Sissokho, Papa
and
Skokan, Jozef
2007.
Turán's theorem for pseudo-random graphs.
Journal of Combinatorial Theory, Series A,
Vol. 114,
Issue. 4,
p.
631.
Fox, Jacob
and
Sudakov, Benny
2008.
Induced Ramsey-type theorems.
Advances in Mathematics,
Vol. 219,
Issue. 6,
p.
1771.
Conlon, David
2010.
On-line Ramsey Numbers.
SIAM Journal on Discrete Mathematics,
Vol. 23,
Issue. 4,
p.
1954.
Rödl, Vojtěch
and
Schacht, Mathias
2010.
Fete of Combinatorics and Computer Science.
Vol. 20,
Issue. ,
p.
287.
Kohayakawa, Yoshiharu
Rödl, Vojtěch
Schacht, Mathias
and
Szemerédi, Endre
2011.
Sparse partition universal graphs for graphs of bounded degree.
Advances in Mathematics,
Vol. 226,
Issue. 6,
p.
5041.
GEBAUER, HEIDI
2013.
Size Ramsey Number of Bounded Degree Graphs for Games.
Combinatorics, Probability and Computing,
Vol. 22,
Issue. 4,
p.
499.
Jiang, Tao
Milans, Kevin G.
and
West, Douglas B.
2013.
Degree Ramsey numbers for cycles and blowups of trees.
European Journal of Combinatorics,
Vol. 34,
Issue. 2,
p.
414.
Mütze, Torsten
and
Peter, Ueli
2013.
On globally sparse Ramsey graphs.
Discrete Mathematics,
Vol. 313,
Issue. 22,
p.
2626.
Conlon, David
Fox, Jacob
and
Sudakov, Benny
2015.
Surveys in Combinatorics 2015.
p.
49.
Dudek, Andrzej
and
Lesniak, Linda
2016.
The vertex size-Ramsey number.
Discrete Mathematics,
Vol. 339,
Issue. 6,
p.
1753.
Conlon, David
Fox, Jacob
and
Sudakov, Benny
2016.
Short proofs of some extremal results II.
Journal of Combinatorial Theory, Series B,
Vol. 121,
Issue. ,
p.
173.
Clemens, Dennis
Jenssen, Matthew
Kohayakawa, Yoshiharu
Morrison, Natasha
Mota, Guilherme Oliveira
Reding, Damian
and
Roberts, Barnaby
2017.
Número de Ramsey relativo a arestas de potências de caminhos.
p.
85.