3 papers
math.CO2026
The oriented chromatic number of random graphs of bounded degree
Karen Gunderson, JD Nir
The chromatic number of the random graph has long been studied and has inspired several landmark results. In the case where , Achlioptas and Naor showed…
math.CO2026
Achievable Burning Densities of Growing Grids
Jordan Barrett, Karen Gunderson, JD Nir +1
Graph burning is a discrete-time process on graphs where vertices are sequentially activated and burning vertices cause their neighbours to burn over time. In this work, we focus o…
math.CO2024
Adversarial graph burning densities
Karen Gunderson, William Kellough, JD Nir +1
Graph burning is a discrete-time process that models the spread of influence in a network. Vertices are either burning or unburned, and in each round, a burning vertex causes all o…