Abstract
It is shown that for every l ≥ 3 there exists a graph G of girth l such that in any proper edge-colouring of G one may find a cycle of length l all of whose edges are given different colours. © 1995 by Academic Press, Inc.
Cite
CITATION STYLE
APA
Kohayakawa, Y., & Łuczak, T. (1995). Sparse anti-ramsey graphs. Journal of Combinatorial Theory, Series B, 63(1), 146–152. https://doi.org/10.1006/jctb.1995.1010
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free