18 citations · 39 across the 14 of their papers we have counts for
11 papers · 1 filter
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…
Induced forests in some distance-regular graphs
Karen Gunderson, Karen Meagher, Joy Morris +1
In this article, we study the order and structure of the largest induced forests in some families of graphs. First we prove a variation of the ratio bound that gives an upper bound…
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…
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…
Burning the plane: densities of the infinite Cartesian grid
Anthony Bonato, Karen Gunderson, Amy Shaw
Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal prope…
Minimum degree conditions for small percolating sets in bootstrap percolation
Karen Gunderson
The -neighbour bootstrap process is an update rule for the states of vertices in which `uninfected' vertices with at least `infected' neighbours become infected and a set of…
Tournaments, 4-uniform hypergraphs, and an exact extremal result
Karen Gunderson, Jason Semeraro
We consider -uniform hypergraphs with the maximum number of hyperedges subject to the condition that every set of vertices spans either or exactly hyperedges and giv…
Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs
Paul Balister, Béla Bollobás, Karen Gunderson
The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be gener…
Limited packings of closed neighbourhoods in graphs
Paul N. Balister, Béla Bollobás, Karen Gunderson
The k-limited packing number, , of a graph , introduced by Gallant, Gunther, Hartnell, and Rall, is the maximum cardinality of a set of vertices of such that eve…
Bounding the Number of Hyperedges in Friendship -Hypergraphs
Karen Gunderson, Natasha Morrison, Jason Semeraro
For , an -uniform hypergraph is called a friendship -hypergraph if every set of vertices has a unique 'friend' - that is, there exists a unique vertex $x \no…
Almost Separable Matrices
Matthew Aldridge, Leonardo Baldassini, Karen Gunderson
An matrix with column supports is -separable if the disjunctions are all distinct over all sets $\mathcal{K…