Anti-Ramsey threshold of cycles

Abstract: For graphs

G

and

H

, let

G o v e r s e t m a t h r m r b l o n g r i g h t a r r o w H

denote the property that for every proper edge colouring of

G

there is a rainbow copy of

H

in

G

. Extending a result of Nenadov, Person, v{S}kori'{c} and Steger [J. Combin. Theory Ser. B 124 (2017),1-38], we determine the threshold for

G (n, p) o v e r s e t m a t h r m r b l o n g r i g h t a r r o w C_{e} l l

for cycles

C_{e} l l

of any given length

e l l g e q 4

.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Anti-Ramsey threshold of cycles