Premium
Large components in r ‐edge‐colorings of K n have diameter at most five
Author(s) -
Ruszinkó Miklós
Publication year - 2012
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20587
Subject(s) - combinatorics , mathematics , yesterday , monochromatic color , ramsey theory , ramsey's theorem , graph , enhanced data rates for gsm evolution , edge coloring , graph theory , discrete mathematics , physics , graph power , computer science , telecommunications , line graph , astronomy , optics
Abstract Reflecting on problems posed by Gyárfás [Ramsey Theory Yesterday, Today and Tomorrow, Birkhäuser, Basel, 2010, pp. 77–96] and Mubayi [Electron J Combin 9 (2002), #R42], we show in this note that every r ‐edge‐coloring of K n contains a monochromatic component of diameter at most five on at least n /( r −1) vertices. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory 69:337–340, 2012