Local anti-Ramsey numbers of graphs

Maria Axenovich, Tao Jiang, Zsolt Tuza

Research output: Contribution to journalArticle

11 Citations (Scopus)


A subgraph H in an edge-colouring is properly coloured if incident edges of H are assigned different colours, and H is rainbow if no two edges of H are assigned the same colour. We study properly coloured subgraphs and rainbow subgraphs forced in edge-colourings of complete graphs in which each vertex is incident to a large number of colours.

Original languageEnglish
Pages (from-to)495-511
Number of pages17
JournalCombinatorics Probability and Computing
Issue number5-6 SPEC. ISS.
Publication statusPublished - Sep 1 2003

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Local anti-Ramsey numbers of graphs'. Together they form a unique fingerprint.

  • Cite this