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 ?
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:e08f2fc13bd75097b71db9989de58362ca744d9dd9565bd1b832da1eeb25c62d
- Metadata
- sha256:40967be0019453a17197f942e2c7e1efeadbb4957abedacef594892689b6fe2d
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:88fbce9b76907ca92d74fcf709d3545b7a666f0c2ee9ea834819c6f4633e7de0
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207