Sciweavers

JGT
2006

A Ramsey-type result for the hypercube

13 years 11 months ago
A Ramsey-type result for the hypercube
We prove that for every fixed k and 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 . This answers an open question of Chung. Our techniques provide also a characterization of all subgraphs H of the hypercube which are Ramsey, i.e., have the property that for every k, any k-edge coloring of a sufficiently large Qn contains a monochromatic copy of H.
Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vond
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JGT
Authors Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák
Comments (0)