Skip to content

Erdős problem 595

Start work

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

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal7 retained
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Open the source record
Where the source files it298 share a topic
Graph Theory275Set Theory35
None carries a Standing. Browse the topic.
Start workOpen sources