43 citations · 235 across the 46 of their papers we have counts for
4 papers · 1 filter
Monochromatic tree covers and Ramsey numbers for set-coloured graphs
Sebastián Bustamante, Maya Stein
We consider a generalisation of the classical Ramsey theory setting to a setting where each of the edges of the underlying host graph is coloured with a {\em set} of colours (inste…
Almost partitioning a 3-edge-coloured into 5 monochromatic cycles
Richard Lang, Oliver Schaudt, Maya Stein
We show that for any colouring of the edges of the complete bipartite graph with 3 colours there are 5 disjoint monochromatic cycles which together cover all but o…
Local colourings and monochromatic partitions in complete bipartite graphs
Richard Lang, Maya Stein
We show that for any -local colouring of the edges of the balanced complete bipartite graph , its vertices can be covered with at most~ disjoint monochromatic paths.…
Convex p-partitions of bipartite graphs
Luciano Grippo, Martín Matamala, Martín Safe +1
A set of vertices X of a graph G is convex if it contains all vertices on shortest paths between vertices of X. We prove that for fixed p, all partitions of the vertex set of a bip…