On the anti-Ramsey threshold for non-balanced graphs

From MaRDI portal

(Redirected from Publication:6131744)

Jump to:navigation, search

DOI10.37236/11449MaRDI QIDQ6131744zbMATH OpenFDO

Authors Pedro Araújo, Taísa L. Martins, Letícia Mattos, Walner Mendonça, Luiz Moreira, G. O. Mota

Publication date 18 April 2024

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2201.05106

zbMATH Keywords

anti-Ramsey threshold for cycles rainbow copy

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Structural characterization of families of graphs (05C75) Random graphs (graph-theoretic aspects) (05C80)

Abstract: For graphs

G

and

H

, we write

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

if any proper edge-coloring of

G

contains a rainbow copy of

H

, i.e., a copy where no color appears more than once. Kohayakawa, Konstadinidis and the last author proved that 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 H

is at most

n^{- 1 / m_{2} (H)}

. Previous results have matched the lower bound for this anti-Ramsey threshold for cycles and complete graphs with at least 5 vertices. Kohayakawa, Konstadinidis and the last author also presented an infinite family of graphs

H

for which the anti-Ramsey threshold is asymptotically smaller than

n^{- 1 / m_{2} (H)}

. In this paper, we devise a framework that provides a richer and more complex family of such graphs that includes all the previously known examples.

Recommendations

Cited in

(3)

This page was built for publication: On the anti-Ramsey threshold for non-balanced graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131744)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=On_the_anti-Ramsey_threshold_for_non-balanced_graphs&oldid=98811089"