Nemanja Škorić

Available identifiers

Publication	Date of Publication	Type
Covering cycles in sparse graphs	2023-10-12	Paper
Triangle resilience of the square of a Hamilton cycle in random graphs	2021-11-17	Paper
On Komlós’ tiling theorem in random graphs	2020-04-06	Paper
A general lower bound for collaborative tree exploration	2020-02-13	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
Local resilience of an almost spanning k‐cycle in random graphs	2019-02-20	Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems	2018-10-29	Paper
A general lower bound for collaborative tree exploration	2018-04-12	Paper
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS	2017-12-06	Paper
Smaller subgraphs of minimum degree \(k\)	2017-10-16	Paper
Robust hamiltonicity of random directed graphs extended abstract	2017-10-05	Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems extended abstract	2017-10-05	Paper
Robust Hamiltonicity of random directed graphs	2017-08-22	Paper
Almost‐spanning universality in random graphs	2017-06-02	Paper
A tight Erdős-Pósa function for long cycles	2017-05-26	Paper
Almost-spanning universality in random graphs (extended abstract)	2016-10-14	Paper
Finite irreflexive homomorphism-homogeneous binary relational systems	2012-12-07	Paper
On finite reflexive homomorphism-homogeneous binary relational systems	2012-04-13	Paper

This page was built for person: Nemanja Škorić