Title of article
Sparse Anti-Ramsey Graphs
Author/Authors
Kohayakawa، نويسنده , , Y. and Luczak، نويسنده , , T.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
7
From page
146
To page
152
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.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1995
Journal title
Journal of Combinatorial Theory Series B
Record number
1525979
Link To Document