1989 | OriginalPaper | Buchkapitel
Covering Complete Graphs by Monochromatic Paths
verfasst von : A. Gyárfás
Erschienen in: Irregularities of Partitions
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A theorem of R. Radó (see in [2]) says that if the edges of the countably infinite complete graph K∞ are colored with r colors then the vertices of K∞ can be covered by at most r (finite or one-way infinite) vertex-disjoint monochromatic paths. Edge-coloring theorems are usually extended from finite to infinite, however, in the case of Radó’s theorem it seems natural to look for finite versions.