Sean English

activity

20242026

collaborators

4 papers

math.CO2026

Helly Theorems for Generalized TurÃ¡n Problems

Sean English, Sam Spiro

Given a graph $T$ and a family of graphs $F$ , the generalized TurÃ¡n number $ex (n, T, F)$ is the maximum number of copies of $T$ in an $n$ -vertex $\mathc…

math.CO2026

On the Domatic Game

Sean English, London Swan

The domatic game with pallete size $k$ is a $2$ -player game played on a graph $G$ recently introduced by Hartnell and Rall. Players Alice and Bob take turns choosing an uncolored v…

math.CO2025

Rational Exponents for General Graphs

Sean English, Sam Spiro

A rational number $r$ is a \textbf{realizable exponent} for a graph $H$ if there exists a finite family of graphs $F$ such that $ex (n, H, F) = I^ (n^{r})$ , wh…

math.CO2024

Rational exponents for cliques

Sean English, Anastasia Halfpap, Robert A. Krueger

Let $ex (n, H, F)$ be the maximum number of copies of $H$ in an $n$ -vertex graph which contains no copy of a graph from $F$ . Thinking of $H$ and $\mathcal…