Coy Schwieder

activity

20232026

most citedNew bounds on the generalized Ramsey number

f (n, 5, 8)

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 papers

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

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

math.CO2024

Frogs, hats and common subsequences

Joseph Briggs, Alex Parker, Coy Schwieder +1

Write $W^{(n)}$ to mean the $n$ -letter word obtained by repeating a fixed word $W$ and let $R_{n}$ denote a uniformly random $n$ -letter word sampled from the same alphabet as $W$ . We…

math.CO2023★ 1 cited

New bounds on the generalized Ramsey number $f (n, 5, 8)$

Enrique Gomez-Leos, Emily Heath, Alex Parker +2

Let $f (n, p, q)$ denote the minimum number of colors needed to color the edges of $K_{n}$ so that every copy of $K_{p}$ receives at least $q$ distinct colors. In this note, we show $\fra…