2 papers
math.CO2024
Improved bounds for proper rainbow saturation
Andrew Lane, Natasha Morrison
Given a graph , we say that a graph is properly rainbow -saturated if: (1) There is a proper edge colouring of containing no rainbow copy of ; (2) For every $e \no…
math.CO2024
Proper rainbow saturation for trees
Andrew Lane, Natasha Morrison
Given a graph , we say that a graph is properly rainbow -saturated if: (1) There is a proper edge colouring of containing no rainbow copy of ; (2) For every $e \no…