I have discovered that Luca Trevisan (Well-known for his results in approximation algorithms and PCP theorem) writting a blog devoted to Computational Complexity, Math.
I liked a lot a series of posts about the Szeremedi's theorem,
Szemeredi's theorem
Analytical approaches to Szemeredi's Theorem: k=3
Analytical approaches to Szemeredi's Theorem: general case
Polynomials and subspaces
Property testing and Szemeredi's Theorem
his recent post about the real value of approximation factor for approximation algorithms and his post about Gowers uniformity