Name
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. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1006/jctb.1995.1010 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
sparse anti-ramsey graph | Discrete mathematics,Graph,Combinatorics,Existential quantification,Mathematics | Journal |
Volume | Issue | ISSN |
63 | 1 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
1 | 0.45 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoshiharu Kohayakawa | 1 | 477 | 64.87 |
| Tomasz Łuczak | 2 | 225 | 40.26 |