Work

On the anti-Ramsey threshold

Year: 2026

Type: article

Abstract: We say that a graph G is anti-Ramsey for a graph H if any proper edge-colouring of G yields a rainbow copy of H , i.e. a copy of H whose edges all receive different colours. In this work we determine the threshold at which the binomial random graph becomes anti-Ramsey for any fixed graph H , given that H is sufficiently dense. Our proof employs a graph decomposition lemma in the style of the Nine Dragon Tree theorem, which may be of independent interest.

Source: European Journal of Combinatorics

DOI: 10.1016/j.ejc.2026.104344

Author: Eden Kuperwasser

Institution: Tel Aviv University

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,560

Funder: European Research Council