Skip to main content
Journal Article

Rainbow Subgraphs in Edge-Colorings of Complete Graphs

Annals of Discrete Mathematics (1993) 55(C) 81-88
DOI: 10.1016/S0167-5060(08)70377-7
32Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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

Cite

CITATION STYLE

APA

Erdős, P., & Tuza, Z. (1993). Rainbow Subgraphs in Edge-Colorings of Complete Graphs. Annals of Discrete Mathematics, 55(C), 81–88. https://doi.org/10.1016/S0167-5060(08)70377-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free