It is shown that for every l greater than or equal to 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. (C) 1995 Academic Press, Inc. [References: 4]
展开▼
