16 citations · 44 across the 14 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.CO2022★ 4 cited
The rainbow saturation number is linear
Natalie Behague, Tom Johnston, Shoham Letzter +2
Given a graph , we say that an edge-coloured graph is -rainbow saturated if it does not contain a rainbow copy of , but the addition of any non-edge in any colour crea…
math.CO2022★ 9 cited
Every graph is eventually Turán-good
Natasha Morrison, JD Nir, Sergey Norin +2
Let be a graph. We show that if is large enough as a function of , then the -partite Turán graph maximizes the number of copies of among all -free graphs…
math.CO2022
Common Pairs of Graphs
Natalie Behague, Natasha Morrison, Jonathan A. Noel
A graph is said to be common if the number of monochromatic labelled copies of in a red/blue edge colouring of a large complete graph is asymptotically minimized by a rando…