5 citations · 5 across the 9 of their papers we have counts for
22 papers · 1 filter
An 18-colour bound for locally irregular decompositions
Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli +1
A graph is locally irregular if adjacent vertices have distinct degrees. A graph G is decomposable if its edge set can be decomposed into locally irregular graphs, and its locally…
Monochromatic components in dense 2-edge-coloured balanced bipartite graphs
César Bispo, George Kontogeorgiou, Marcelo Lage +2
We prove that each -edge-coloured spanning subgraph of with can be covered by at most three monochromatic components. We provide…
Monochromatic cycle partitions in 3-mean edge-colourings
Richard Lang, Guilherme Oliveira Mota
Given and an edge-coloured complete graph such that the average number of colours incident with a vertex is at most , Conlon and Stein asked whether there is…
Gallai 3-colourings of random graphs
Fabrício S. Benevides, Rubens C. S. Monteiro, Guilherme O. Mota
A Gallai -colouring of a graph is a colouring of with colours that induces no rainbow triangles, that is, a triangle with edges of 3 different colours. We give a…
A canonical Ramsey theorem for even cycles in random graphs
José D. Alvarado, Y. Kohayakawa, Patrick Morris +1
The celebrated canonical Ramsey theorem of Erdős and Rado implies that for , any colouring of the edges of with sufficiently large gives a copy of…
Resilience for Loose Hamilton Cycles
José D. Alvarado, Yoshiharu Kohayakawa, Richard Lang +2
We study the emergence of loose Hamilton cycles in subgraphs of random hypergraphs. Our main result states that the minimum -degree threshold for loose Hamiltonicity relative to…