Rajko Nenadov

Available identifiers

zbMath Open nenadov.rajkoMaRDI QIDQ322225

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6147255	2024-01-15	Paper
Edge-disjoint paths in expanders: online with removals	2023-10-19	Paper
The size‐Ramsey number of short subdivisions	2023-10-12	Paper
Routing permutations on spectral expanders via matchings	2023-10-04	Paper
The size‐Ramsey number of cubic graphs	2023-09-20	Paper
A short note on the characterization of countable chains with finite big Ramsey spectra	2023-05-04	Paper
Probabilistic intuition holds for a class of small subgraph games	2023-02-21	Paper
A new proof of the KŁR conjecture	2022-08-04	Paper
Rolling backwards can move you forward: On embedding problems in sparse expanders	2022-06-16	Paper
Complete Minors in Graphs Without Sparse Cuts	2022-04-05	Paper
On the size-Ramsey number of grids	2022-02-03	Paper
The threshold bias of the clique-factor game	2021-11-17	Paper
Probabilistic hypergraph containers	2021-11-11	Paper
Proof of the Brown–Erdős–Sós conjecture in groups	2021-09-14	Paper
Small subsets without $k$-term arithmetic progressions	2021-09-07	Paper
Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties	2021-06-15	Paper
Sprinkling a Few Random Edges Doubles the Power	2021-05-28	Paper
An O(n) time algorithm for finding Hamilton cycles with high probability	2020-12-04	Paper
Completion and deficiency problems	2020-09-24	Paper
Bounded degree spanners of the hypercube	2020-07-29	Paper
On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem	2020-04-07	Paper
On Komlós’ tiling theorem in random graphs	2020-04-06	Paper
Resilience of perfect matchings and Hamiltonicity in random graph processes	2019-08-14	Paper
Triangle‐factors in pseudorandom graphs	2019-07-12	Paper
Spanning universality in random graphs	2019-02-20	Paper
Monochromatic cycle covers in random graphs	2019-02-20	Paper
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs	2019-02-20	Paper
Optimal induced universal graphs for bounded-degree graphs	2019-01-31	Paper
Complete minors in graphs without sparse cuts	2018-12-05	Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems	2018-10-29	Paper
Star-factors in graphs with large minimum degree	2018-10-11	Paper
Optimal induced universal graphs for bounded-degree graphs	2018-07-16	Paper
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS	2017-12-06	Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems extended abstract	2017-10-05	Paper
Robust hamiltonicity of random directed graphs extended abstract	2017-10-05	Paper
A Short Proof of the Random Ramsey Theorem	2017-10-04	Paper
Unique reconstruction threshold for random jigsaw puzzles	2017-09-26	Paper
Robust Hamiltonicity of random directed graphs	2017-08-22	Paper
Almost‐spanning universality in random graphs	2017-06-02	Paper
Star-factors in graphs of high degree	2016-11-15	Paper
On the threshold for the Maker-BreakerH-game	2016-11-09	Paper
Almost-spanning universality in random graphs (extended abstract)	2016-10-14	Paper
Universality of random graphs and rainbow embedding	2016-06-10	Paper
On the Number of Graphs Without Large Cliques	2015-04-17	Paper
Finite irreflexive homomorphism-homogeneous binary relational systems	2012-12-07	Paper
On finite reflexive homomorphism-homogeneous binary relational systems	2012-04-13	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Rajko Nenadov