Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

2

JCT
2006

favoriteEmaildiscussreport

68views more JCT 2006»

An improved bound for the monochromatic cycle partition number

13 years 4 months ago

An improved bound for the monochromatic cycle partition number

Download web.cs.wpi.edu

András Gyárfás, Miklós

Real-time Traffic

JCT 2006 |

claim paper

Related Content

» When is an Almost Monochromatic K4 Guaranteed

» Interchangeability of Relevant Cycles in Graphs

» The LinearArray Conjecture in Communication Complexity is False

» Online Ramsey games for triangles in random graphs

» Mesh quality improvement and other properties in the fourtriangles longestedge partition

» Improved Bounds for Computing Kemeny Rankings

» Optimal splitters for database partitioning with size bounds

» Improving Superscalar Instruction Dispatch and Issue by Exploiting Dynamic Code Sequences

» Cycles of even lengths modulo k

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JCT
Authors	András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi

Comments (0)