Emily Heath

collaborators

3 papers

math.CO2026

A linear upper bound on the $Z_{p}$ -Ramsey number of graphs with sufficiently large $2$ -packing

Emily Heath, Andrew Simmons

Given a positive integer $k$ and graph $G$ , the $Z_{k}$ -Ramsey number $R (G, Z_{k})$ is the least $N$ (if it exists) such that every coloring $f:E(K_N)\rightarrow \math…

math.CO2026

Generalized Ramsey Numbers in the Hypercube

Emily Heath, Coy Schwieder, Shira Zerbib

We study the generalized Ramsey numbers $f (Q_{n}, C_{k}, q)$ , that is, the minimum number of colors needed to edge-color the hypercube $Q_{n}$ so that every copy of the cycle $C_{k}$ h…

math.CO2025

Ramsey Numbers in Kneser Graphs

Emily Heath, Grace McCourt, Alex Parker +2

We define the $r -Kneser Ramsey number$ $R_{r}^{KG} (s, t)$ as the minimum integer $n$ such that every red/blue edge-coloring of the Kneser graph $KG (n, r)$ …

A linear upper bound on the Zp​-Ramsey number of graphs with sufficiently large 2-packing

Generalized Ramsey Numbers in the Hypercube

Ramsey Numbers in Kneser Graphs

A linear upper bound on the $Z_{p}$ -Ramsey number of graphs with sufficiently large $2$ -packing