Erdős Problem 1175
Let be an uncountable cardinal. Must there exist a cardinal such that every graph with chromatic number contains a triangle-free subgraph with chromatic number ?
Shelah proved that a negative answer is consistent when
(see erdos_1175.variants.shelah_consistency).