Rajko Nenadov

From MaRDI portal
Person:322225

Available identifiers

zbMath Open nenadov.rajkoMaRDI QIDQ322225

List of research outcomes





PublicationDate of PublicationType
A short note on the characterization of countable chains with finite big Ramsey spectra2025-01-15Paper
Edge-disjoint paths in expanders: online with removals2024-11-28Paper
On the size-Ramsey number of grids2024-11-05Paper
Probabilistic hypergraph containers2024-08-28Paper
https://portal.mardi4nfdi.de/entity/Q61472552024-01-15Paper
Edge-disjoint paths in expanders: online with removals2023-10-19Paper
The size‐Ramsey number of short subdivisions2023-10-12Paper
Routing permutations on spectral expanders via matchings2023-10-04Paper
The size‐Ramsey number of cubic graphs2023-09-20Paper
A short note on the characterization of countable chains with finite big Ramsey spectra2023-05-04Paper
Probabilistic intuition holds for a class of small subgraph games2023-02-21Paper
A new proof of the KŁR conjecture2022-08-04Paper
Rolling backwards can move you forward: On embedding problems in sparse expanders2022-06-16Paper
Complete Minors in Graphs Without Sparse Cuts2022-04-05Paper
On the size-Ramsey number of grids2022-02-03Paper
The threshold bias of the clique-factor game2021-11-17Paper
Probabilistic hypergraph containers2021-11-11Paper
Proof of the Brown–Erdős–Sós conjecture in groups2021-09-14Paper
Small subsets without $k$-term arithmetic progressions2021-09-07Paper
Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties2021-06-15Paper
Sprinkling a Few Random Edges Doubles the Power2021-05-28Paper
An O(n) time algorithm for finding Hamilton cycles with high probability2020-12-04Paper
Completion and deficiency problems2020-09-24Paper
Bounded degree spanners of the hypercube2020-07-29Paper
On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem2020-04-07Paper
On Komlós’ tiling theorem in random graphs2020-04-06Paper
Resilience of perfect matchings and Hamiltonicity in random graph processes2019-08-14Paper
Triangle‐factors in pseudorandom graphs2019-07-12Paper
Spanning universality in random graphs2019-02-20Paper
Monochromatic cycle covers in random graphs2019-02-20Paper
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs2019-02-20Paper
Optimal induced universal graphs for bounded-degree graphs2019-01-31Paper
Complete minors in graphs without sparse cuts2018-12-05Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems2018-10-29Paper
Star-factors in graphs with large minimum degree2018-10-11Paper
Optimal induced universal graphs for bounded-degree graphs2018-07-16Paper
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS2017-12-06Paper
Robust hamiltonicity of random directed graphs extended abstract2017-10-05Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems extended abstract2017-10-05Paper
A Short Proof of the Random Ramsey Theorem2017-10-04Paper
Unique reconstruction threshold for random jigsaw puzzles2017-09-26Paper
Robust Hamiltonicity of random directed graphs2017-08-22Paper
Almost‐spanning universality in random graphs2017-06-02Paper
Star-factors in graphs of high degree2016-11-15Paper
On the threshold for the maker-breaker \(H\)-game2016-11-09Paper
Almost-spanning universality in random graphs (extended abstract)2016-10-14Paper
Universality of random graphs and rainbow embedding2016-06-10Paper
On the Number of Graphs Without Large Cliques2015-04-17Paper
Finite irreflexive homomorphism-homogeneous binary relational systems2012-12-07Paper
On finite reflexive homomorphism-homogeneous binary relational systems2012-04-13Paper
Universality for graphs with bounded densityN/APaper
Global rigidity of random graphs in $\mathbb{R}$N/APaper
The Hamilton space of pseudorandom graphsN/APaper
The largest subgraph without a forbidden induced subgraphN/APaper

Research outcomes over time

This page was built for person: Rajko Nenadov