18 citations · 39 across the 14 of their papers we have counts for
4 papers · 1 filter
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…
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…
Lower bounds for bootstrap percolation on Galton-Watson trees
Karen Gunderson, Michał Przykucki
Bootstrap percolation is a cellular automaton modelling the spread of an `infection' on a graph. In this note, we prove a family of lower bounds on the critical probability for …