### 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≥k_{0}(r, l)), at least a proportion r of the k-edges of G will contain vertices colored in every color for any r

Original language | English |
---|---|

Pages (from-to) | 164-169 |

Number of pages | 6 |

Journal | Journal of Combinatorial Theory |

Volume | 5 |

Issue number | 2 |

Publication status | Published - Sep 1968 |

### Fingerprint

### Cite this

*Journal of Combinatorial Theory*,

*5*(2), 164-169.

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

Research output: Contribution to journal › Article

*Journal of Combinatorial Theory*, vol. 5, no. 2, pp. 164-169.

}

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 -