8 citations · 59 across the 53 of their papers we have counts for
6 papers · 1 filter
Almost all permutation matrices have bounded saturation functions
Jesse Geneson
Saturation problems for forbidden graphs have been a popular area of research for many decades, and recently Brualdi and Cao initiated the study of a saturation problem for 0-1 mat…
Reconfiguration graphs of zero forcing sets
Jesse Geneson, Ruth Haas, Leslie Hogben
This paper begins the study of reconfiguration of zero forcing sets, and more specifically, the zero forcing graph. Given a base graph , its zero forcing graph, …
Extremal results for graphs of bounded metric dimension
Jesse Geneson, Suchir Kaustav, Antoine Labelle
Metric dimension is a graph parameter motivated by problems in robot navigation, drug design, and image processing. In this paper, we answer several open extremal problems on metri…
The damage throttling number of a graph
Joshua Carlson, Robin Eagleton, Jesse Geneson +3
The cop throttling number of a graph, introduced in 2018 by Breen et al., optimizes the balance between the number of cops used and the number of rounds required to catch the robbe…
Broadcast Dimension of Graphs
Jesse Geneson, Eunjeong Yi
In this paper we initiate the study of broadcast dimension, a variant of metric dimension. Let be a graph with vertex set , and let denote the length of a …
A generalization of the Kővári-Sós-Turán theorem
Jesse Geneson
We present a new proof of the Kővári-Sós-Turán theorem that for . The new proof is elementary, avoiding the use of convexity. For any $…