Local anti-Ramsey numbers of graphs

Maria Axenovich, Tao Jiang, Z. Tuza

Research output: Contribution to journalArticle

10 Citations (Scopus)

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.

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

Fingerprint

Ramsey number
Subgraph
Color
Graph in graph theory
Edge Coloring
Coloring
Complete Graph
Vertex of a graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Mathematics(all)
  • Discrete Mathematics and Combinatorics
  • Statistics and Probability

Cite this

Local anti-Ramsey numbers of graphs. / Axenovich, Maria; Jiang, Tao; Tuza, Z.

In: Combinatorics Probability and Computing, Vol. 12, No. 5-6 SPEC. ISS., 09.2003, p. 495-511.

Research output: Contribution to journalArticle

Axenovich, Maria ; Jiang, Tao ; Tuza, Z. / Local anti-Ramsey numbers of graphs. In: Combinatorics Probability and Computing. 2003 ; Vol. 12, No. 5-6 SPEC. ISS. pp. 495-511.
@article{b03ddebaae574f7a9ab62d104d13fb8f,
title = "Local anti-Ramsey numbers of graphs",
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.",
author = "Maria Axenovich and Tao Jiang and Z. Tuza",
year = "2003",
month = "9",
doi = "10.1017/S0963548303005868",
language = "English",
volume = "12",
pages = "495--511",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "5-6 SPEC. ISS.",

}

TY - JOUR

T1 - Local anti-Ramsey numbers of graphs

AU - Axenovich, Maria

AU - Jiang, Tao

AU - Tuza, Z.

PY - 2003/9

Y1 - 2003/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=2942620547&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2942620547&partnerID=8YFLogxK

U2 - 10.1017/S0963548303005868

DO - 10.1017/S0963548303005868

M3 - Article

VL - 12

SP - 495

EP - 511

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 5-6 SPEC. ISS.

ER -