Nemanja Draganić
- A generalization of Bondy's pancyclicity theorem
2023/02/24 by Nemanja Draganić, David Munhá Correia, Draganić, Nemanja +3 · 4 citations
Mathematics · Computer Science · #Graph theory and applications #Advanced Graph Theory Research #Limits and Structures in Graph Theory
- Powers of paths in tournaments
2021/03/23 by Nemanja Draganić, François Dross, Jacob Fox +7 · 2 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #graph theory and CDMA systems
- Rolling backwards can move you forward: on embedding problems in sparse expanders
2020/07/16 by Nemanja Draganić, Draganić, Nemanja, Michael Krivelevich +3 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Limits and Structures in Graph Theory
- Hamiltonicity of expanders: optimal bounds and applications
2024/02/09 by Nemanja Draganić, Draganić, Nemanja, Richard Montgomery +7 · 3 citations
Economics, Econometrics and Finance · #Combinatorics (math.CO) #Economic Theory and Policy #FOS: Mathematics
- Cyclic subsets in regular Dirac graphs
2025/03/03 by Nemanja Draganić, Draganić, Nemanja, Peter Keevash +3 · 3 citations
Computer Science · Engineering · Mathematics · #05C35 #05C65 #05C70 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems
- Edge-disjoint paths in expanders: online with removals
2023/10/19 by Nemanja Draganić, Rajko Nenadov, Draganić, Nemanja +1 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #Complexity and Algorithms in Graphs
- New bounds for linear arboricity and related problems
2025/07/28 by Micha Christoph, Christoph, Micha, Nemanja Draganić +9 · 3 citations
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Polynomial and algebraic computation
- Efficient Hamilton covers and linear arboricity of random graphs
2026/07/16 by Nemanja Draganić, Michael Krivelevich
#math.CO