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 2023Show all

3 papers · 1 filter

math.CO2023

Off-Diagonal Commonality of Graphs via Entropy

Natalie Behague, Natasha Morrison, Jonathan A. Noel

A graph $H$ is common if the limit as $n \to \infty$ of the minimum density of monochromatic labelled copies of $H$ in an edge colouring of $K_{n}$ with red and blue is attained by a s…

math.CO2023

Directed cycles with zero weight in $Z_{p}^{k}$

Shoham Letzter, Natasha Morrison

For a finite abelian group $A$ , define $f (A)$ to be the minimum integer such that for every complete digraph $Γ$ on $f$ vertices and every map $w : E (Γ) \to A$ , there exists…

math.CO2023

Improved bounds for cross-Sperner systems

Natalie Behague, Akina Kuperus, Natasha Morrison +1

A collection of families $(F_{1}, F_{2}, \dots, F_{k}) \in P ([n])^{k}$ is cross-Sperner if there is no pair $i \neq = j$ for which some $F_i…

Off-Diagonal Commonality of Graphs via Entropy

Directed cycles with zero weight in Zpk​

Improved bounds for cross-Sperner systems

Directed cycles with zero weight in $Z_{p}^{k}$