On coloring graphs to maximize the proportion of multicolored k-edges

Paul Erdös, Daniel J. Kleitman

Research output: Contribution to journalArticle

37 Citations (Scopus)

Abstract

The following results and some generalizations are obtained. Consider all colorings of the n vertices of a k-graph G into l colors. Then, if k is sufficiently large (k≥k0(r, l)), at least a proportion r of the k-edges of G will contain vertices colored in every color for any r<1.

Original languageEnglish
Pages (from-to)164-169
Number of pages6
JournalJournal of Combinatorial Theory
Volume5
Issue number2
DOIs
Publication statusPublished - Sep 1968

    Fingerprint

Cite this