Large monochromatic components in edge colorings of graphs: A survey

20Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The aim of this survey is to summarize an area of combinatorics that lies on the border of several areas: Ramsey theory, resolvable block designs, factorizations, fractional matchings and coverings, and partition covers.

Cite

CITATION STYLE

APA

Gyárfás, A. (2011). Large monochromatic components in edge colorings of graphs: A survey. In Progress in Mathematics (Vol. 285, pp. 77–96). Springer Basel. https://doi.org/10.1007/978-0-8176-8092-3_5

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