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

Karen Gunderson, Natasha Morrison, Jason Semeraro

Maximising the number of induced cycles in a graph

Natasha Morrison, Alex Scott

The size-Ramsey number of powers of paths

Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa +4

Saturation in the Hypercube and Bootstrap Percolation

Natasha Morrison, Jonathan A. Noel, Alex Scott

Extremal Bounds for Bootstrap Percolation in the Hypercube

Natasha Morrison, Jonathan A. Noel

On Saturated $k$-Sperner Systems

Natasha Morrison, Jonathan A. Noel, Alex Scott

Bounding the number of cycles in a graph in terms of its degree sequence

Zdeněk Dvořák, Natasha Morrison, Jonathan A. Noel +2

The paper provides an upper bound on how many cycles a simple graph can have based on its degree sequence, and uses this result to settle several conjectures and improve bounds for…