Erdős problem 1068
Does every graph with chromatic number contain a countable subgraph which is infinitely connected?
- Formal statements
- 1 open
- Erdős Problems says
- open
- Decision here
- No current contribution
- Checks
- 0 checks · 1 formal
Current Result
Current Result
No result has been accepted here yet.
- Type
- —
- Evidence
- 0 artifacts
- Decision
- None
- Reviewed
- No date retained