Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T10:11:29.191Z Has data issue: false hasContentIssue false
  • English
  • Français

Local Anti-Ramsey Numbers of Graphs

Published online by Cambridge University Press:  03 December 2003

Maria Axenovich ,
Tao Jiang  and
Z Tuza
Maria Axenovich*
Affiliation:
Department of Mathematics, Iowa State University, Ames, IA 50011, USA
Tao Jiang*
Affiliation:
Department of Mathematics and Statistics, Miami University, Oxford, OH 45056, USA
Z Tuza*
Affiliation:
Computer and Automation Institute, Hungarian Academy of Sciences, H-1111 Budapest, Kende u.13-17, Hungary
*
(e-mail: axenovic@math.iastate.edu)
(e-mail: jiangt@muohio.edu)
(e-mail: tuza@lutra.sztaki.hu)
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.

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.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 12 , Issue 5-6: This issue contains volume twelve, parts five and six , November 2003 , pp. 495 - 511
Copyright
Copyright © Cambridge University Press 2003

Footnotes

†

Research supported by Miami University Faculty Summer Research Grant.