Local Anti-Ramsey Numbers of Graphs

Maria Axenovich, Tao Jiang, Z Tuza

Source record

Source: Crossref

Published: Nov 1, 2003

DOI: 10.1017/s0963548303005868

Open original source ↗

Source abstract

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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.