AbstractWe prove that for every 4-coloring of {1,2,…,n}, with each color class having cardinality more than (n+1)/6, there exists a solution of the equation x+y=z+w with x, y, z and w belonging to different color classes. The lower bound on a color class cardinality is tight
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.