On the Erdos-Simonovits-So's Conjecture about the Anti-Ramsey Number of a Cycle

@article{Jiang2003OnTE,
  title={On the Erdos-Simonovits-So's Conjecture about the Anti-Ramsey Number of a Cycle},
  author={Tao Jiang and Douglas B. West},
  journal={Combinatorics, Probability & Computing},
  year={2003},
  volume={12},
  pages={585-598}
}
Given a positive integer $n$ and a family ${\cal F}$ of graphs, let $f(n,{\cal F})$ denote the maximum number of colours in an edge-colouring of $K_n$ such that no subgraph of $K_n$ belonging to ${\cal F}$ has distinct colours on its edges. Erdos, Simonovits and Sos [6] conjectured for fixed $k$ with $k\geq3$ that $f(n,C_k)\,{=}\, (\frac{k-2}{2}+\frac{1}{k-1})n + O(1)$. This has been proved for $k\leq7$. For general $k$, in this paper we improve the previous bound of $(k-2)n-\big({{k\,{-}\,1… CONTINUE READING

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

On a conjecture of erdöus, simonovits, and sós concerning anti-Ramsey theorems

  • Journal of Graph Theory
  • 1983
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Anti-Ramsey Numbers of Subdivided Graphs

  • J. Comb. Theory, Ser. B
  • 2002
VIEW 2 EXCERPTS

Edge-Colorings with No Large Polychromatic Stars

  • Graphs and Combinatorics
  • 2002
VIEW 1 EXCERPT

Anti - Ramsey theorems

P. Erdős, M. Simonovits, V. T. Sós
  • Infinite and Finite Sets ( Keszthely , Hungary , 1973 )
  • 1975