3 papers
math.CO2026
Unavoidable substructures in large and infinite -edge-connected graphs
Sarah Allred, M. N. Ellingham
In 1930, Ramsey proved that every large graph contains either a large clique or a large edgeless graph as an induced subgraph. It is well known that every large connected graph con…
math.CO2026
Forbidding the subdivided claw as a subgraph or a minor
Sarah Allred, M. N. Ellingham
Let be the subdivided claw, the -vertex tree obtained from a claw by subdividing each edge exactly once. We characterize the graphs (finite and infinite) that do n…
math.CO2025
Enumerative Chromatic Choosability
Sarah Allred, Jeffrey A. Mudrock
Chromatic-choosablility is a notion of fundamental importance in list coloring. A graph is chromatic-choosable when its chromatic number is equal to its list chromatic number. In 1…