An improved bound for the monochromatic cycle partition number

Authors:
András Gyárfás;Miklós Ruszinkó;Gábor N. Sárközy;Endre Szemerédi
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, PO Box 63, Budapest H-1518, Hungary;Computer and Automation Research Institute, Hungarian Academy of Sciences, PO Box 63, Budapest H-1518, Hungary;Computer and Automation Research Institute, Hungarian Academy of Sciences, PO Box 63, Budapest H-1518, Hungary and Computer Science Department, Worcester Polytechnic Institute, Worcester, MA 01609 ...;Computer Science Department, Rutgers University, New Brunswick, NJ 08903, USA
Venue:
Journal of Combinatorial Theory Series B
Year:
2006

Citing 6
Cited 4

Vertex coverings by Monochromatic cycles and trees

Journal of Combinatorial Theory Series B
Partitioning complete bipartite graphs by monochromatic cycles

Journal of Combinatorial Theory Series B
An algorithmic version of the blow-up lemma

Random Structures & Algorithms
R(Cn, Cn,Cn) 0 (1)) n

Journal of Combinatorial Theory Series B
Vertex partitions by connected monochromatic k-regular graphs

Journal of Combinatorial Theory Series B
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles

Combinatorics, Probability and Computing

Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs

Journal of Combinatorial Theory Series B
Covering two-edge-coloured complete graphs with two disjoint monochromatic cycles

Combinatorics, Probability and Computing
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture

Journal of Combinatorial Theory Series B
The 3-colour ramsey number of a 3-uniform berge cycle

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Improving a result of Erdos, Gyarfas and Pyber for large n we show that for every integer r=2 there exists a constant n"0=n"0(r) such that if n=n"0 and the edges of the complete graph K"n are colored with r colors then the vertex set of K"n can be partitioned into at most 100rlogr vertex disjoint monochromatic cycles.