Kalina Petrova

activity

20242026

collaborators

14 papers

math.CO2026

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

Sylwia Antoniuk, Alberto Espuny DÃaz, Kalina Petrova +1

Consider the budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli, where each time an edge is offered through the (standard) random graph process…

math.CO2026

Packing subdivisions into regular graphs

Richard Montgomery, Kalina Petrova, Arjun Ranganathan +1

We show that, for any graph $F$ and $I^\cdot > 0$ , there exists a $d_{0} = d_{0} (F, I^\cdot)$ such that every $n$ -vertex $d$ -regular graph with $d \geq d_{0}$ has a collection of vertex-disjoint $F$ -su…

math.CO2026

Ramsey number of a cycle versus a graph of a given size

Stijn Cambie, Andrea Freschi, Patryk Morawski +2

In this paper, we prove that for every $k$ and every graph $H$ with $m$ edges and no isolated vertices, the Ramsey number $R (C_{k}, H)$ is at most $2 m + ⌊ \frac{k - 1}{2} ⌋$ ,…

math.CO2025

Odd-Ramsey numbers of Hamilton cycles

Simona Boyadzhiyska, Shagnik Das, Thomas Lesgourgues +1

The odd-Ramsey number $r_{o dd} (n, H)$ of a graph $H$ , as introduced by Alon in his work on graph-codes, is the minimum number of colours needed to edge-colour $K_{n}$ so that ev…

math.CO2025

Extending Thomassen's conjecture to directed graphs

Micha Christoph, BarnabÃ¡s Janzer, Kalina Petrova +1

A famous conjecture by Thomassen from 1983 asserts that for any given $k, g \in N$ there exists some $d = d (k, g) \in N$ such that every graph of minimum degree at leas…

math.CO2025

Size-Ramsey numbers of graphs with maximum degree three

Nemanja DraganiÄ, Kalina Petrova

The size-Ramsey number $r^(H)$ of a graph $H$ is the smallest number of edges a (host) graph $G$ can have, such that for any red/blue colouring of $G$ , there is a monochromati…