A strongly non-Ramsey uncountable graph
It is consistent that there exists a graph X of cardinality such that every graph has an edge coloring with colors in which the induced copies of X (if there are any) are totally multicolored (get all possible colors).