Erdős problem 595
Erdős Problem 595 (250): Is there an infinite graph G which contains no and is not the union of countably many triangle-free graphs?
Workspace
public preview
- #595
- None
- 0
Erdős Problem 595 (250): Is there an infinite graph G which contains no and is not the union of countably many triangle-free graphs?
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