Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T13:18:19.460Z Has data issue: false hasContentIssue false

On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle

Published online by Cambridge University Press:  03 December 2003

T Jiang*
Affiliation:
Department of Mathematics and Statistics, Miami University, Oxford, OH 45056, USA
D West*
Affiliation:
Department of Mathematics, University of Illinois, Urbana, IL 61801, USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Given a positive integer n and a family of graphs, let denote the maximum number of colours in an edge-colouring of such that no subgraph of belonging to has distinct colours on its edges. Erdös, Simonovits and Sós [6] conjectured for fixed k with that . This has been proved for . For general k, in this paper we improve the previous bound of to . For even k, we further improve it to . We also prove that , which is sharp.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2003