Natasha Morrison

activity

20142023

most citedWeak saturation numbers of complete bipartite graphs in the clique

16 citations · 44 across the 14 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

math.CO2014

Bounding the Number of Hyperedges in Friendship $r$ -Hypergraphs

Karen Gunderson, Natasha Morrison, Jason Semeraro

For $r \geq 2$ , an $r$ -uniform hypergraph is called a friendship $r$ -hypergraph if every set $R$ of $r$ vertices has a unique 'friend' - that is, there exists a unique vertex $x \no…

math.CO2014★ 7 cited

Saturation in the Hypercube and Bootstrap Percolation

Natasha Morrison, Jonathan A. Noel, Alex Scott

Let $Q_{d}$ denote the hypercube of dimension $d$ . Given $d \geq m$ , a spanning subgraph $G$ of $Q_{d}$ is said to be $(Q_{d}, Q_{m})$ -saturated if it does not contain $Q_{m}$ as a subgraph bu…

math.CO2014

On Saturated $k$ -Sperner Systems

Natasha Morrison, Jonathan A. Noel, Alex Scott

Given a set $X$ , a collection $F \subseteq P (X)$ is said to be $k$ -Sperner if it does not contain a chain of length $k + 1$ under set inclusion and it is saturated…

Bounding the Number of Hyperedges in Friendship r-Hypergraphs

Saturation in the Hypercube and Bootstrap Percolation

On Saturated k-Sperner Systems

Bounding the Number of Hyperedges in Friendship $r$ -Hypergraphs

On Saturated $k$ -Sperner Systems