Enrique Gomez-Leos

activity

20232025

most citedNew bounds on the generalized Ramsey number

f (n, 5, 8)

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2025

Tiling randomly perturbed multipartite graphs

Enrique Gomez-Leos, Ryan R. Martin

A perfect $K_{r}$ -tiling in a graph $G$ is a collection of vertex-disjoint copies of the graph $K_{r}$ in $G$ that covers all vertices of $G$ . In this paper, we prove that the threshol…

math.CO2024

Tiling randomly perturbed bipartite graphs

Enrique Gomez-Leos, Ryan R. Martin

A perfect $H$ -tiling in a graph $G$ is a collection of vertex-disjoint copies of a graph $H$ in $G$ that covers all vertices of $G$ . Motivated by papers of Bush and Zhao and of Bal…

math.CO2024

On the proper rainbow saturation numbers of cliques, paths, and odd cycles

Dustin Baker, Enrique Gomez-Leos, Anastasia Halfpap +7

Given a graph $H$ , we say a graph $G$ is properly rainbow $H$ -saturated if there is a proper edge-coloring of $G$ which contains no rainbow copy of $H$ , but adding any edge to $G$ …

math.CO2023★ 1 cited

New bounds on the generalized Ramsey number $f (n, 5, 8)$

Enrique Gomez-Leos, Emily Heath, Alex Parker +2

Let $f (n, p, q)$ denote the minimum number of colors needed to color the edges of $K_{n}$ so that every copy of $K_{p}$ receives at least $q$ distinct colors. In this note, we show $\fra…

Tiling randomly perturbed multipartite graphs

Tiling randomly perturbed bipartite graphs

On the proper rainbow saturation numbers of cliques, paths, and odd cycles

New bounds on the generalized Ramsey number f(n,5,8)

New bounds on the generalized Ramsey number $f (n, 5, 8)$