3 citations · 3 across the 4 of their papers we have counts for
4 papers
Robustness of Erdős--Ko--Rado theorems on permutations and perfect matchings
Karen Gunderson, Karen Meagher, Joy Morris +2
The Erdős--Ko--Rado (EKR) theorem and its generalizations can be viewed as classifications of maximum independent sets in appropriately defined families of graphs, such as the Knes…
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…
Random-step Markov processes
Neal Bushaw, Karen Gunderson, Steven Kalikow
We explore two notions of stationary processes. The first is called a random-step Markov process in which the stationary process of states, has a station…