Natasha Morrison

According to our database, Natasha Morrison authored at least 21 papers between 2014 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

An Approximate Counting Version of the Multidimensional Szemerédi Theorem.

Natalie C. Behague, Joseph Hyde, Natasha Morrison, Jonathan A. Noel, Ashna Wright

Comb., August, 2025

Thresholds for constrained Ramsey and anti-Ramsey problems.

Natalie C. Behague, Robert Hancock, Joseph Hyde, Shoham Letzter, Natasha Morrison

Eur. J. Comb., 2025

2024

Off-Diagonal Commonality of Graphs via Entropy.

Natalie C. Behague, Natasha Morrison, Jonathan A. Noel

SIAM J. Discret. Math., 2024

The Rainbow Saturation Number Is Linear.

Natalie C. Behague, Tom Johnston, Shoham Letzter, Natasha Morrison, Shannon Ogden

SIAM J. Discret. Math., 2024

On Multicolor Turán Numbers.

József Balogh, Anita Liebenau, Letícia Mattos, Natasha Morrison

SIAM J. Discret. Math., 2024

Directed cycles with zero weight in Zpk.

Shoham Letzter, Natasha Morrison

J. Comb. Theory B, 2024

Layered Subgraphs of the Hypercube.

Natalie C. Behague, Imre Leader, Natasha Morrison, Kada Williams

Electron. J. Comb., 2024

Improved Bounds for Cross-Sperner Systems.

Natalie C. Behague, Akina Kuperus, Natasha Morrison, Ashna Wright

Electron. J. Comb., 2024

2023

Every graph is eventually Turán-good.

Natasha Morrison, JD Nir, Sergey Norin, Pawel Rzazewski, Alexandra Wesolek

J. Comb. Theory B, 2023

2022

Common Pairs of Graphs.

Natalie C. Behague, Natasha Morrison, Jonathan A. Noel

CoRR, 2022

2021

Maximising the number of cycles in graphs with forbidden subgraphs.

Natasha Morrison, Alexander Roberts, Alex D. Scott

J. Comb. Theory B, 2021

Weak saturation numbers of complete bipartite graphs in the clique.

Gal Kronenberg, Taísa Martins, Natasha Morrison

J. Comb. Theory A, 2021

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

Zdenek Dvorák, Natasha Morrison, Jonathan A. Noel, Sergey Norin, Luke Postle

Eur. J. Comb., 2021

2020

The Kőnig graph process.

Nina Kamcev, Michael Krivelevich, Natasha Morrison, Benny Sudakov

Random Struct. Algorithms, 2020

Partitioning the vertices of a torus into isomorphic subgraphs.

Marthe Bonamy, Natasha Morrison, Alex Scott

J. Comb. Theory A, 2020

2019

The size?Ramsey number of powers of paths.

Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa, Natasha Morrison, Guilherme Oliveira Mota, Damian Reding, Barnaby Roberts

J. Graph Theory, 2019

2018

Extremal bounds for bootstrap percolation in the hypercube.

Natasha Morrison, Jonathan A. Noel

J. Comb. Theory A, 2018

2017

Maximising the number of induced cycles in a graph.

Natasha Morrison, Alex Scott

J. Comb. Theory B, 2017

Saturation in the Hypercube and Bootstrap Percolation.

Natasha Morrison, Jonathan A. Noel, Alex Scott

Comb. Probab. Comput., 2017

2016

Bounding the number of hyperedges in friendship r-hypergraphs.

Karen Gunderson, Natasha Morrison, Jason Semeraro

Eur. J. Comb., 2016

2014

On Saturated k-Sperner Systems.

Natasha Morrison, Jonathan A. Noel, Alex Scott

Electron. J. Comb., 2014