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
public preview
- #1175
- None
- 0
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 ?
Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.
Canvas
public previewFind a Problem, Result, source, or page