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

P. Erdős, Daniel J. Kleitman

Research output: Contribution to journalArticle

36 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

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

Fingerprint

Graph Coloring
Proportion
Maximise
Colouring
Graph in graph theory
Color
Generalization

Cite this

On coloring graphs to maximize the proportion of multicolored k-edges. / Erdős, P.; Kleitman, Daniel J.

In: Journal of Combinatorial Theory, Vol. 5, No. 2, 09.1968, p. 164-169.

Research output: Contribution to journalArticle

@article{59c89371bf8f43859074ea51deffccfd,
title = "On coloring graphs to maximize the proportion of multicolored k-edges",
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",
author = "P. Erdős and Kleitman, {Daniel J.}",
year = "1968",
month = "9",
language = "English",
volume = "5",
pages = "164--169",
journal = "Journal of Combinatorial Theory",
issn = "0021-9800",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

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

AU - Erdős, P.

AU - Kleitman, Daniel J.

PY - 1968/9

Y1 - 1968/9

N2 - 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

AB - 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

UR - http://www.scopus.com/inward/record.url?scp=0000350625&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000350625&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0000350625

VL - 5

SP - 164

EP - 169

JO - Journal of Combinatorial Theory

JF - Journal of Combinatorial Theory

SN - 0021-9800

IS - 2

ER -