Rainbow Subgraphs in Edge-Colorings of Complete Graphs

  • Erdős P
  • Tuza Z
  • 5


    Mendeley users who have this article in their library.
  • 26


    Citations of this article.


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

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free