Suppose we have a finite, 100-uniform system of sets such that any point is contained in at most 3 sets. Is it true that we can color the points such that every set contains 50 red and 50 blue points?


The question is by Thomas Rothvoss. A positive answer would solve the [Three permutations problem of Beck](http://www.math.sc.edu/~cooper/combprob.html), so a simple answer would be a counterexample...



If every point is contained in at most 3 sets and all sets are big, then is the discrepancy zero?
No. 


Given sets 
$$
a\_1,a\_2,\dots,a\_{99},b\_1{\rm\ and\ }a\_1,a\_2,\dots,a\_{99},b\_2
$$
we see that $b\_1$ and $b\_2$ must be the same color, say, red. Then from 
$$
b\_1,b\_2,c\_1,c\_2,\dots,c\_{98}{\rm\ and\ }d\_1,d\_2,c\_1,c\_2,\dots,c\_{98}
$$
we see $d\_1$ and $d\_2$ must both be red. Then from 
$$
d\_1,d\_2,e\_1,e\_2,\dots,e\_{98}{\rm\ and\ }f\_1,f\_2,e\_1,e\_2,\dots,e\_{98}
$$
we see that $f\_1$ and $f\_2$ must both be red. Dot, dot, dot. You wind up with as many elements as you like, all of which must be red, and none of them are in more than two of the sets. Once you have more than 50 of them, you can put them in another set which will then have more than 50 red points. 


Obviously, we can take 100 to be a variable in this problem and solution, provided we restrict its range to the positive even integers and understand 50 to be 100/2. 


