Vertex Partitions by Connected Monochromatic k-Regular Graphs
نویسندگان
چکیده
Generalizing a result of Erdo s, Gya rfa s and Pyber we show that there exists a constant c such that for any integers r, k 2 and for any coloring of the edges of a complete graph with r colors, its vertices can be partitioned into at most r log r+k) connected monochromatic k-regular subgraphs and vertices. We also show that the same result holds for complete bipartite graphs, generalizing a result of Haxell. 2000 Academic Press
منابع مشابه
An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
Improving a result of Sárközy and Selkow, we show that for all integers r, k ≥ 2 there exists a constant n0 = n0(r, k ) such that if n ≥ n0 and the edges of the complete graph Kn are colored with r colors then the vertex set of Kn can be partitioned into at most 100r log r + 2rk vertex disjoint connected monochromatic k-regular subgraphs and vertices. This is close to best possible. C © 2012 Wi...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملLarge Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition
It is well-known that in every k-coloring of the edges of the complete graph Kn there is a monochromatic connected component of order at least n k−1 . In this paper we study an extension of this problem by replacing complete graphs by graphs of large minimum degree. For k = 2 the authors proved that δ(G) > 3n 4 ensures a monochromatic connected component with at least δ(G) + 1 vertices in every...
متن کاملBrick partitions of graphs
For each rational number q ≥ 1, we describe two partitions of the vertex set of a graph G, called the q-brick partition and the q-superbrick partition. The special cases when q = 1 are the partitions given by the connected components and the 2-edge-connected components of G, respectively. We obtain structural results on these partitions and describe their relationship to the principal partition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 78 شماره
صفحات -
تاریخ انتشار 2000