Simona Boyadzhiyska

collaborators

4 papers

math.CO2025

Almost-perfect colorful matchings in three-edge-colored bipartite graphs

Simona Boyadzhiyska, Micha Christoph, Tibor SzabÃ³

We prove that, for positive integers $n, a_{1}, a_{2}, a_{3}$ satisfying $a_{1} + a_{2} + a_{3} = n - 1$ , it holds that any bipartite graph $G$ which is the union of three perfect matchings $M_{1}$ , $M…

math.CO2024

Simultaneous edge-colourings

Simona Boyadzhiyska, Richard Lang, Allan Lo +1

We study a generalisation of Vizing's theorem, where the goal is to simultaneously colour the edges of graphs $G_{1}, \dots, G_{k}$ with few colours. We obtain asymptotically optimal bou…

math.CO2024

On the chromatic number of powers of subdivisions of graphs

Michael Anastos, Simona Boyadzhiyska, Silas Rathke +1

For a given graph $G = (V, E)$ , we define its \emph{ $n$ th subdivision} as the graph obtained from $G$ by replacing every edge by a path of length $n$ . We also define the \emph{ $m$ th p…

math.CO2024

Odd-Ramsey numbers of complete bipartite graphs

Simona Boyadzhiyska, Shagnik Das, Thomas Lesgourgues +1

In his study of graph codes, Alon introduced the concept of the odd-Ramsey number of a family of graphs $H$ in $K_{n}$ , defined as the minimum number of colours needed to c…