8 papers
Rainbow connecting -colorings of super-Dirac graphs
János Barát, Simona Boyadzhiyska, Andrea Freschi
Let be a graph with minimum degree . Can we color the edges of with red and blue so that every pair of non-adjacent vertices is connected by a path consist…
Almost-perfect colorful matchings in three-edge-colored bipartite graphs
Simona Boyadzhiyska, Micha Christoph, Tibor Szabó
We prove that, for positive integers satisfying , it holds that any bipartite graph which is the union of three perfect matchings , $M…
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 with few colours. We obtain asymptotically optimal bou…
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 in , defined as the minimum number of colours needed to c…
On the chromatic number of powers of subdivisions of graphs
Michael Anastos, Simona Boyadzhiyska, Silas Rathke +1
For a given graph , we define its \emph{th subdivision} as the graph obtained from by replacing every edge by a path of length . We also define the \emph{th p…
Ramsey goodness of -uniform paths, or the lack thereof
Simona Boyadzhiyska, Allan Lo
Given a pair of -uniform hypergraphs , the Ramsey number of , denoted by , is the smallest integer such that in every red/blue-colouring of the edges o…