Sean English

activity

20172026

most citedThe zero forcing polynomial of a graph

13 citations · 19 across the 15 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

math.CO2022

A random coloring process gives improved bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers

Patrick Bennett, Andrzej Dudek, Sean English

The Erdős-Gyárfás number $f (n, p, q)$ is the smallest number of colors needed to color the edges of the complete graph $K_{n}$ so that all of its $p$ -clique spans at least $q$ colors…

math.CO2022

Rainbow Connection for Complete Multipartite Graphs

Igor Araujo, Kareem Benaissa, Richard Bi +3

A path in an edge-colored graph is said to be rainbow if no color repeats on it. An edge-colored graph is said to be rainbow $k$ -connected if every pair of vertices is connected by…

math.CO2022

Saturation for the $3$ -uniform loose $3$ -cycle

Sean English, Alexandr Kostochka, Dara Zirlin

Let $F$ and $H$ be $k$ -uniform hypergraphs. We say $H$ is $F$ -saturated if $H$ does not contain a subgraph isomorphic to $F$ , but $H + e$ does for any hyperedge $e \neq \in E (H)$ . The…

A random coloring process gives improved bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers

Rainbow Connection for Complete Multipartite Graphs

Saturation for the 3-uniform loose 3-cycle

Saturation for the $3$ -uniform loose $3$ -cycle