Using path counting arguments, we prove min{(x1+x2+y1+y2x1,x2,(y1+y2)),((x1+x2+y1+y2)(x1+x2),y1,y2)}≤(x1+y1x1)(x1+y2x1)(x2+y1x2)(x2+y2x2)
This inequality, motivated by graph coloring considerations, has an interesting geometric interpretation.
