Luiz Moreira

activity

20192026

collaborators

5 papers

math.CO2026

A rainbow version of Lehel's conjecture

Pedro Araújo, Xiao-Chuan Liu, Taísa Martins +4

Lehel's conjecture states that every 2-edge-colouring of K_n admits a partition of its vertex set into two monochromatic cycles. It was proven for sufficiently large n by Łuczak, R…

math.CO2024

Ramsey Goodness of paths and unbalanced graphs

Fábio Botler, Luiz Moreira, João Pedro de Souza

Given graphs $G$ and $H$ , we say that $G$ is $H$ - $g oo d$ if the Ramsey number $R (G, H)$ equals the trivial lower bound $(∣ G ∣ - 1) (χ (H) - 1) + σ (H)$ , where $χ (H)$ denotes the usual ch…

math.CO2022

On the anti-Ramsey threshold for non-balanced graphs

Pedro Araújo, Taísa Martins, Letícia Mattos +3

For graphs $G$ and $H$ , we write $G ⟶ rb H$ if any proper edge-coloring of $G$ contains a rainbow copy of $H$ , 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 $G$ , we write $G \to (K_{r + 1}, T (n, D))$ if every blue-red colouring of the edges of $G$ contains either a blue copy of $K_{r + 1}$ , or a red copy…

math.CO2019

Ramsey Goodness of Paths in Random Graphs

Luiz Moreira

We say that a graph $G$ is Ramsey for $H_{1}$ versus $H_{2}$ , and write $G \to (H_{1}, H_{2})$ , if every red-blue colouring of the edges of $G$ contains either a red copy of $H_{1}$ or a blue…