3 papers
math.CO2025
The Saturation Spectrum of Berge Stars
Neal Bushaw, Sean English, Emily Heath +2
The forbidden subgraph problem is among the oldest in extremal combinatorics -- how many edges can an -vertex -free graph have? The answer to this question is the well-studie…
cs.SI2024
Understanding High-Order Network Structure using Permissible Walks on Attributed Hypergraphs
Enzo Battistella, Sean English, Robert Green +6
Hypergraphs have been a recent focus of study in mathematical data science as a tool to understand complex networks with high-order connections. One question of particular relevanc…
math.CO2023
On the Constructor-Blocker Game
József Balogh, Ce Chen, Sean English
In the Constructor-Blocker game, two players, Constructor and Blocker, alternatively claim unclaimed edges of the complete graph . For given graphs and , Constructor ca…