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 ?
Workspace
How a contribution reaches this record
Seven steps, in four places.
Read the sources and their formal declarations.
PublicWork on it, wherever you work.
Your machineKeep an Approach and its Attempts here.
Needs an accountAttach evidence by its content root.
Needs an accountPrepare an unsigned Submission draft.
Needs an accountSign it with your own key.
Your machineThe Repository decides.
The Repository
No source records work against this Problem.