3 papers
math.CO2024
Stability of transversal Hamilton cycles and paths
Yangyang Cheng, Katherine Staden
Given graphs all on a common vertex set and a graph with , a copy of is \emph{transversal} or \emph{rainbow} if it contains one edge from each $G…
math.CO2023
Transversals via regularity
Yangyang Cheng, Katherine Staden
Given graphs all on the same vertex set and a graph with , a copy of is transversal or rainbow if it contains at most one edge from each …
math.CO2016
Local conditions for exponentially many subdivisions
Hong Liu, Maryam Sharifzadeh, Katherine Staden
Given a graph , let be the number of subdivisions of , each with a different vertex set, which one can guarantee in a graph in which every edge lies in at least…