Emily Heath

collaborators

4 papers

math.CO2025

Universality for transversal powers of Hamilton cycles

Emily Heath, Joseph Hyde, Natasha Morrison +1

Let $k \geq 2$ and let $G = {G_{1}, \dots, G_{m}}$ be a collection of graphs on a common vertex set of cardinality $n$ . We show that if each graph in $G$ has minimum degree…

math.CO2025

Odd Ramsey numbers of multipartite graphs and hypergraphs

Nicholas Crawford, Emily Heath, Owen Henderschedt +2

Given a hypergraph $G$ and a subhypergraph $H$ of $G$ , the \emph{odd Ramsey number} $r_{o dd} (G, H)$ is the minimum number of colors needed to edge-color $G$ so that every copy of $H…

math.CO2025

The Saturation Spectrum of Berge Stars

Neal Bushaw, Sean English, Emily Heath +2

The forbidden subgraph problem is among the oldest in extremal combinatorics -- how many edges can an $n$ -vertex $F$ -free graph have? The answer to this question is the well-studie…

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$ …