Extremal Graph Theory and Ramsey Theory · Challenge problem

The edges of $K_8$ are colored red and blue with no red triangle and no blue $K_4$. What is the largest possible number of red edges at a single vertex?