Large monochromatic components of small diameter
نویسندگان
چکیده
Gyárfás conjectured in 2011 that every r-edge-colored K n contains a monochromatic component of bounded (“perhaps three”) diameter on at least ∕ ( r − 1 ) vertices. Letzter proved this conjecture with four. In note we improve the result case = 3: We show 3-edge-coloring either there is most three 2 vertices or color class spanning and has
منابع مشابه
Finding Large Monochromatic Diameter Two Subgraphs
Given a coloring of the edges of the complete graph on n vertices in k colors, by considering the neighbors of an arbitrary vertex it follows that there is a monochromatic diameter two subgraph on at least 1 + (n− 1)/k vertices. We show that for k ≥ 3 this is asymptotically best possible, and that for k = 2 there is always a monochromatic diameter two subgraph on at least ⌈ 3 4 n⌉ vertices, whi...
متن کاملGraph coloring with no large monochromatic components
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having more than m vertices. Let F be any nontrivial minor-closed family of graphs. We show that mcc2(G) = O(n ) for any n-vertex graph G ∈ F . This bound is asymptotically optimal and it is attained for planar graphs. More g...
متن کاملGraph Colouring with No Large Monochromatic Components
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having more than m vertices. Let F be any nontrivial minor-closed family of graphs. We show that mcc2(G) = O(n ) for any n-vertex graph G ∈ F . This bound is asymptotically optimal and it is attained for planar graphs. More g...
متن کاملMonochromatic and zero-sum sets of nondecreasing diameter
For positive integers m and r define f (m, r) to be the minimum integer n such that for every coloring of {1,2 . . . . . n} with r colors, there exist two monochromatic subsets B 1, B2~{1, 2 . . . . . n} (but not necessarily of the same color) which satisfy: (i)IBll=lB21=m; (ii) The largest number in B 1 is smaller than the smallest number in B2; (iii) The diameter of the convex hull spanned by...
متن کاملMonochromatic and Zero-Sum Sets of Nondecreasing Modified Diameter
Let m be a positive integer whose smallest prime divisor is denoted by p, and let Zm denote the cyclic group of residues modulo m. For a set B = {x1, x2, . . . , xm} of m integers satisfying x1 < x2 < · · · < xm, and an integer j satisfying 2 ≤ j ≤ m, define gj(B) = xj − x1. Furthermore, define fj(m, 2) (define fj(m, Zm)) to be the least integer N such that for every coloring ∆ : {1, . . . ,N} ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22739