Nemanja Škorić

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Covering cycles in sparse graphs Random Structures & Algorithms	2023-10-12	Paper
Triangle resilience of the square of a Hamilton cycle in random graphs Journal of Combinatorial Theory. Series B	2021-11-17	Paper
On Komlós' tiling theorem in random graphs Combinatorics, Probability and Computing	2020-04-06	Paper
A general lower bound for collaborative tree exploration Theoretical Computer Science	2020-02-13	Paper
A general lower bound for collaborative tree exploration Theoretical Computer Science	2020-02-13	Paper
Monochromatic cycle covers in random graphs Random Structures & Algorithms	2019-02-20	Paper
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs Random Structures & Algorithms	2019-02-20	Paper
Local resilience of an almost spanning k‐cycle in random graphs Random Structures & Algorithms	2019-02-20	Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems Journal of Combinatorial Theory. Series B	2018-10-29	Paper
A general lower bound for collaborative tree exploration Structural Information and Communication Complexity	2018-04-12	Paper
Symmetric and asymmetric Ramsey properties in random hypergraphs Forum of Mathematics, Sigma	2017-12-06	Paper
Smaller subgraphs of minimum degree \(k\) The Electronic Journal of Combinatorics	2017-10-16	Paper
Smaller subgraphs of minimum degree \(k\) The Electronic Journal of Combinatorics	2017-10-16	Paper
Robust Hamiltonicity of random directed graphs: extended abstract Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms	2017-10-05	Paper
An algorithmic framework for obtaining lower bounds for random Ramsey problems: extended abstract Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms	2017-10-05	Paper
Robust Hamiltonicity of random directed graphs Journal of Combinatorial Theory. Series B	2017-08-22	Paper
Almost-spanning universality in random graphs Random Structures & Algorithms	2017-06-02	Paper
Almost-spanning universality in random graphs Random Structures & Algorithms	2017-06-02	Paper
A tight Erdős-Pósa function for long cycles Journal of Combinatorial Theory. Series B	2017-05-26	Paper
Almost-spanning universality in random graphs (extended abstract)	2016-10-14	Paper
Finite irreflexive homomorphism-homogeneous binary relational systems (available as arXiv preprint)	2012-12-07	Paper
On finite reflexive homomorphism-homogeneous binary relational systems Discrete Mathematics	2012-04-13	Paper

Research outcomes over time

This page was built for person: Nemanja Škorić