Erdős problem 595 · problems.science

Erdős Problem 595 (250): Is there an infinite graph G which contains no $K_4$ and is not the union of countably many triangle-free graphs?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:ce43b2d93ac21e84502d89066848d277a806606c6e992f8d6035e3c58d4158f1
Metadata: sha256:a38db44f6aabe75e2cbdb64d062ad2d735cd71713b219e7b15a1f04ab7b6f77a
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:8265ae2fc120b44a0bca404e2e802c7c87244ecbc9a3651c8dafb5524bb48152

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207