1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
Tiling randomly perturbed multipartite graphs
Enrique Gomez-Leos, Ryan R. Martin
A perfect -tiling in a graph is a collection of vertex-disjoint copies of the graph in that covers all vertices of . In this paper, we prove that the threshol…
Tiling randomly perturbed bipartite graphs
Enrique Gomez-Leos, Ryan R. Martin
A perfect -tiling in a graph is a collection of vertex-disjoint copies of a graph in that covers all vertices of . Motivated by papers of Bush and Zhao and of Bal…
On the proper rainbow saturation numbers of cliques, paths, and odd cycles
Dustin Baker, Enrique Gomez-Leos, Anastasia Halfpap +7
Given a graph , we say a graph is properly rainbow -saturated if there is a proper edge-coloring of which contains no rainbow copy of , but adding any edge to …
New bounds on the generalized Ramsey number
Enrique Gomez-Leos, Emily Heath, Alex Parker +2
Let denote the minimum number of colors needed to color the edges of so that every copy of receives at least distinct colors. In this note, we show $\fra…