Local Anti-Ramsey Numbers of Graphs

Authors:
Maria Axenovich;Tao Jiang;Zsolt Tuza
Affiliations:
Department of Mathematics, Iowa State University, Ames, IA 50011, USA (e-mail: axenovic@math.iastate.edu);Department of Mathematics and Statistics, Miami University, Oxford, OH 45056, USA (e-mail: jiangt@muohio.edu);Computer and Automation Institute, Hungarian Academy of Sciences, H-1111 Budapest, Kende u.13-17, Hungary (e-mail: tuza@lutra.sztaki.hu)
Venue:
Combinatorics, Probability and Computing
Year:
2003

Citing 5
Cited 1

Ramsey theory (2nd ed.)

Ramsey theory (2nd ed.)
Multicolored subsets in colored hypergraphs

Journal of Combinatorial Theory Series A
Properly colored Hamilton cycles in edge-colored complete graphs

Random Structures & Algorithms
Extremal Graph Theory

Extremal Graph Theory
Bipartite anti-Ramsey numbers of cycles

Journal of Graph Theory

Extensions of Gallai–Ramsey results

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

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.