Подписаться
Rajko Nenadov
Rajko Nenadov
Google Switzerland
Подтвержден адрес электронной почты в домене google.com - Главная страница
Название
Процитировано
Процитировано
Год
A short proof of the random Ramsey theorem
R Nenadov, A Steger
Combinatorics, Probability and Computing 25 (1), 130-144, 2016
462016
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
R Nenadov, N Škorić
Random Structures & Algorithms 54 (1), 187-208, 2019
332019
Robust Hamiltonicity of random directed graphs
A Ferber, R Nenadov, A Noever, U Peter, N Škorić
Journal of Combinatorial Theory, Series B 126, 1-23, 2017
272017
Universality of random graphs and rainbow embedding
A Ferber, R Nenadov, U Peter
Random Structures & Algorithms 48 (3), 546-564, 2016
242016
An algorithmic framework for obtaining lower bounds for random Ramsey problems
R Nenadov, Y Person, N Škorić, A Steger
Journal of Combinatorial Theory, Series B 124, 1-38, 2017
212017
On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem
R Nenadov, Y Pehova
SIAM Journal on Discrete Mathematics 34 (2), 1001-1010, 2020
202020
On the threshold for the Maker‐Breaker H‐game
R Nenadov, A Steger, M Stojaković
Random Structures & Algorithms 49 (3), 558-578, 2016
202016
Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties
F Mousset, R Nenadov, W Samotij
Combinatorics, Probability and Computing 29 (6), 943-955, 2020
192020
Resilience of perfect matchings and Hamiltonicity in random graph processes
R Nenadov, A Steger, M Trujić
Random Structures & Algorithms 54 (4), 797-819, 2019
192019
Almost‐spanning universality in random graphs
D Conlon, A Ferber, R Nenadov, N Škorić
Random Structures & Algorithms 50 (3), 380-393, 2017
182017
Optimal induced universal graphs for bounded-degree graphs
N Alon, R Nenadov
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
172017
Monochromatic cycle covers in random graphs
D Korándi, F Mousset, R Nenadov, N Škorić, B Sudakov
Random Structures & Algorithms 53 (4), 667-691, 2018
152018
Symmetric and asymmetric Ramsey properties in random hypergraphs
L Gugelmann, R Nenadov, Y Person, N Škorić, A Steger, H Thomas
Forum of Mathematics, Sigma 5, 2017
152017
On the number of graphs without large cliques
F Mousset, R Nenadov, A Steger
SIAM Journal on Discrete Mathematics 28 (4), 1980-1986, 2014
152014
Sprinkling a few random edges doubles the power
R Nenadov, M Trujić
SIAM Journal on Discrete Mathematics 35 (2), 988-1004, 2021
142021
On finite reflexive homomorphism-homogeneous binary relational systems
D Mašulović, R Nenadov, N Škorić
Discrete mathematics 311 (21), 2543-2555, 2011
142011
Spanning universality in random graphs
A Ferber, R Nenadov
Random Structures & Algorithms 53 (4), 604-637, 2018
122018
Completion and deficiency problems
R Nenadov, B Sudakov, AZ Wagner
Journal of Combinatorial Theory, Series B 145, 214-240, 2020
112020
On finite reflexive homomorphism-homogeneous binary relational systems
D Mašulović, R Nenadov, N Škorić
Discrete mathematics 311 (21), 2543-2555, 2011
112011
Triangle‐factors in pseudorandom graphs
R Nenadov
Bulletin of the London Mathematical Society 51 (3), 421-430, 2019
102019
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20