A strongly non-Ramsey uncountable graph

摘要

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