Natasha Morrison

According to our database1, Natasha Morrison authored at least 19 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Off-Diagonal Commonality of Graphs via Entropy.
SIAM J. Discret. Math., 2024

The Rainbow Saturation Number Is Linear.
SIAM J. Discret. Math., 2024

On Multicolor Turán Numbers.
SIAM J. Discret. Math., 2024

Directed cycles with zero weight in Zpk.
J. Comb. Theory B, 2024

Layered Subgraphs of the Hypercube.
Electron. J. Comb., 2024

Improved Bounds for Cross-Sperner Systems.
Electron. J. Comb., 2024

2023
Every graph is eventually Turán-good.
J. Comb. Theory B, 2023

2022
Common Pairs of Graphs.
CoRR, 2022

2021
Maximising the number of cycles in graphs with forbidden subgraphs.
J. Comb. Theory B, 2021

Weak saturation numbers of complete bipartite graphs in the clique.
J. Comb. Theory A, 2021

Bounding the number of cycles in a graph in terms of its degree sequence.
Eur. J. Comb., 2021

2020
The Kőnig graph process.
Random Struct. Algorithms, 2020

Partitioning the vertices of a torus into isomorphic subgraphs.
J. Comb. Theory A, 2020

2019
The size?Ramsey number of powers of paths.
J. Graph Theory, 2019

2018
Extremal bounds for bootstrap percolation in the hypercube.
J. Comb. Theory A, 2018

2017
Maximising the number of induced cycles in a graph.
J. Comb. Theory B, 2017

Saturation in the Hypercube and Bootstrap Percolation.
Comb. Probab. Comput., 2017

2016
Bounding the number of hyperedges in friendship r-hypergraphs.
Eur. J. Comb., 2016

2014
On Saturated k-Sperner Systems.
Electron. J. Comb., 2014


  Loading...