Kalina Petrova

Preprints

1. On constructing small subgraphs in the budget-constrained random graph process

   Sylwia Antoniuk, Alberto Espuny Díaz, Kalina Petrova, Miloš Stojaković

   submitted in 2026

   PDF
2. Ramsey number of a cycle versus a graph of a given size

   Stijn Cambie, Andrea Freschi, Patryk Morawski, Kalina Petrova, Alexey Pokrovskiy

   submitted in 2026

   PDF
3. Odd-Ramsey numbers of Hamilton cycles

   Simona Boyadzhiyska, Shagnik Das, Thomas Lesgourgues, and Kalina Petrova

   submitted in 2025

   PDF
4. Extending Thomassen's conjecture to directed graphs

   Micha Christoph, Barnabás Janzer, Kalina Petrova, Raphael Steiner

   submitted in 2025

   PDF
5. Parities in random Latin squares

   Matthew Kwan, Kalina Petrova, and Mehtaab Sawhney

   submitted in 2025

   PDF
6. Sharp thresholds for higher powers of Hamilton cycles in random graphs

   Tamás Makai, Matija Pasch, Kalina Petrova, Leon Schiller

   submitted in 2025

   PDF

Published

1. Packing subdivisions into regular graphs

   Richard Montgomery, Kalina Petrova, Arjun Ranganathan, Jane Tan

   Proceedings of the American Mathematical Society 154 (2026), 3693-3704

   PDF
2. Randomly perturbed digraphs also have bounded-degree spanning trees

   Patryk Morawski and Kalina Petrova

   The Electronic Journal of Combinatorics 33(2) (2026), P2.24

   PDF
3. Size-Ramsey numbers of structurally sparse graphs

   Nemanja Draganić, Marc Kaufmann, David Munhá Correia, Kalina Petrova, and Raphael Steiner

   Random Structures & Algorithms 68 (2) (2026), e70059

   PDF
4. Odd-Ramsey numbers of complete bipartite graphs

   Simona Boyadzhiyska, Shagnik Das, Thomas Lesgourgues, and Kalina Petrova

   European Journal of Combinatorics 131 (2026), 104235

   PDF
5. The Hamilton space of pseudorandom graphs

   Micha Christoph, Rajko Nenadov, and Kalina Petrova

   Journal of Combinatorial Theory, Series B, 176 (2026), 254-267

   PDF
6. Size-Ramsey numbers of graphs with maximum degree three

   Nemanja Draganić and Kalina Petrova

   Journal of the London Mathematical Society 111 (3), e70116, 2025

   PDF
7. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound

   Jonas Lill, Kalina Petrova, and Simon Weber

   Algorithmica 87 (2025), 983-1007

   PDF
8. A note on digraph splitting

   Micha Christoph, Kalina Petrova, and Raphael Steiner

   Combinatorics, Probability and Computing 34(4) (2025), 559-564

   PDF
9. Improved bounds for graph distances in scale free percolation and related models

   Kostas Lakis, Johannes Lengler, Kalina Petrova, and Leon Schiller

   APPROX/RANDOM 2024, LIPIcs 317 (2024), 74:1-74:22

   PDF
10. Embedding loose spanning trees in 3-uniform hypergraphs

    Yanitsa Pehova and Kalina Petrova

    Journal of Combinatorial Theory, Series B, 168, 47-67, 2024

    PDF
11. On connectivity in random graph models with limited dependencies

    Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, and Emo Welzl

    Random Structures & Algorithms, 65 (2), 411-448, 2024

    PDF
12. Transference for loose Hamilton cycles in random 3-uniform hypergraphs

    Kalina Petrova and Miloš Trujić

    Random Structures & Algorithms 65 (2), 313-341, 2024

    PDF
13. Optimal strategies for patrolling fences

    Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, and Pascal Pfister

    International Colloquium on Automata, Languages and Programming 2019, 144:1-144:13

    PDF
14. A dynamic data structure for segment intersection queries

    Kalina Petrova and Robert Tarjan

    Fifteenth International Workshop on Algebraic and Combinatorial Coding Theory, Albena, Bulgaria, June 18-24, 2016. Proceedings, 2016, 244-249

    PDF