Rainbow Subgraphs in Edge-Colorings of Complete Graphs

Research output: Contribution to journalArticle

26 Citations (Scopus)


We raise the following problem. Let F be a given graph with e edges. Consider the edge colorings of Kn (n large) with e colors, such that every vertex has degree at least d in each color (d<n/e). For which values of d does every such edge coloring contain a subgraph isomorphic to F, all of whose edges have distinct colors? The case when F is the triangle K3 is well-understood, but for other graphs F many interesting questions remain open, even for d-regular colorings when n = de + 1.

Original languageEnglish
Pages (from-to)81-88
Number of pages8
JournalAnnals of Discrete Mathematics
Issue numberC
Publication statusPublished - Jan 1 1993

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Rainbow Subgraphs in Edge-Colorings of Complete Graphs'. Together they form a unique fingerprint.

  • Cite this