Maya Stein

most citedMonochromatic cycle partitions in local edge colourings

6 citations · 8 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2024

On the Ramsey number of the double star

Freddy Flores Dubó, Maya Stein

The double star $S (m_{1}, m_{2})$ is obtained from joining the centres of a star with $m_{1}$ leaves and a star with $m_{2}$ leaves. We give a short proof of a new upper bound on the two-co…

math.CO2014★ 2 cited

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles

Oliver Schaudt, Maya Stein

We show that any complete $k$ -partite graph $G$ on $n$ vertices, with $k \geq 3$ , whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distin…

math.CO2014★ 6 cited

Monochromatic cycle partitions in local edge colourings

David Conlon, Maya Stein

An edge colouring of a graph is said to be an $r$ -local colouring if the edges incident to any vertex are coloured with at most $r$ colours. Generalising a result of Bessy and Thom…