Alex Parker

activity

20232026

most citedNew bounds on the generalized Ramsey number

f (n, 5, 8)

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

collaborators

5 papers

math.CO2026

The chromatic number of 3-stable Kneser graphs

Wei-Chia Chen, Alex Parker, Shira Zerbib

For an integer $s \geq 2$ , a subset $S \subseteq [n]$ is {\em $s$ -stable} if $min {j - i, n + i - j} \geq s$ for every $i, j \in S$ with $i < j$ . Denote the set of all $s$ -stable subs…

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

The chromatic number of 3-stable Kneser graphs

Ramsey Numbers in Kneser Graphs

On the proper rainbow saturation numbers of cliques, paths, and odd cycles

Frogs, hats and common subsequences

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

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