Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650252 | Discrete Mathematics | 2008 | 6 Pages |
Abstract
We prove that for every 4-coloring of {1,2,…,n}{1,2,…,n}, with each color class having cardinality more than (n+1)/6(n+1)/6, there exists a solution of the equation x+y=z+wx+y=z+w with x, y, z and w belonging to different color classes. The lower bound on a color class cardinality is tight.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jacob Fox, Mohammad Mahdian, Radoš Radoičić,