3 papers
math.CO2025
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…
math.CO2024
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…
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 , 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 …