Erdős problem 74
Let possibly very slowly. Is there a graph of infinite chromatic number such that every finite subgraph on vertices can be made bipartite by deleting at most edges?
Workspace
public preview
- #74
- None
- 0
Let possibly very slowly. Is there a graph of infinite chromatic number such that every finite subgraph on vertices can be made bipartite by deleting at most edges?
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