activity
20212026
most citedEvery graph is eventually Turán-good

9 citations · 12 across the 11 of their papers we have counts for

collaborators
Showing 2022Show all

3 papers · 1 filter

math.CO2022★ 1 cited

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…

math.CO2022★ 9 cited

Every graph is eventually Turán-good

Natasha Morrison, JD Nir, Sergey Norin +2

Let be a graph. We show that if is large enough as a function of , then the -partite Turán graph maximizes the number of copies of among all -free graphs…

math.CO2022

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…