3 papers
math.CO2022
On the anti-Ramsey threshold for non-balanced graphs
Pedro Araújo, Taísa Martins, Letícia Mattos +3
For graphs and , we write if any proper edge-coloring of contains a rainbow copy of , i.e., a copy where no color appear…
math.CO2020
Ramsey goodness of trees in random graphs
Pedro Araújo, Luiz Moreira, Matías Pavez-Signé
For a graph , we write if every blue-red colouring of the edges of contains either a blue copy of , or a red copy…
math.CO2019
Ramsey Goodness of Paths in Random Graphs
Luiz Moreira
We say that a graph is Ramsey for versus , and write , if every red-blue colouring of the edges of contains either a red copy of or a blue…