Continuing Paul's result:
given the constraint on blue and red triangles, there are two possible configurations for 7 triangles: Paul's six plus aCD, and the six with the colored "inner triangles" switched with the white ones.
Let's check them, using the fact that since only areas are considered we can do arbitrary linear maps to fix points:
The former: Let $A,C,D$ be $(0,0),(3,0),(0,3)$ so that $e,d,c,b$ are $(2,0),(1,0),(0,1),(0,2)$ by the area requirement. Solving the diagonals yields $B,E,a = (4,-3),(-3,4),(\frac{6}{5},\frac{6}{5})$, from which we obtain that the six have area $\frac{3}{2}$ and $aCD$ has area $\frac{9}{10}$.
The latter: Let $A,B,E$ be $(0,0),(3,0),(0,3)$ so that $d,c$ are $(2,1),(1,2)$. We need $aB$ to be bisected by $AC$ so that $BCe=aCe$ - assuming symmetry about $x=y$ this happens when $D,C = (3,6),(6,3)$ which sets $b,e,a$ = $(\frac{3}{2},3),(3,\frac{3}{2}),(3,3)$. Unfortunately, while $bDE=abD=aCe=BCe=\frac{9}{4}$, $ABd=Acd=AcE=\frac{3}{2}$ and we can't get 7 this way either.
Therefore,
six triangles is best possible.