Sarah Frederickson

collaborators

2 papers

math.CO2026

Improved bounds for the chromatic index of $k$ -uniform hypergraphs

Sarah Frederickson, Yanli Hao, Tom Kelly

In 1997, Alon and Kim conjectured that if $H$ is a $k$ -uniform $t$ -simple hypergraph with maximum degree $D$ sufficiently large, then the chromatic index $χ^{'} (H)$ is upper bounded b…

quant-ph2026

Almost all graphs are vertex-minor universal

Ruben Ascoli, Bryce Frederickson, Sarah Frederickson +2

Answering a question of Claudet, we prove that the uniformly random graph $G \sim G (n, 1/2)$ is $Ω (n)$ -vertex-minor universal with high probability. That is, for some…

Improved bounds for the chromatic index of k-uniform hypergraphs

Almost all graphs are vertex-minor universal

Improved bounds for the chromatic index of $k$ -uniform hypergraphs