Skip to content

Erdős problem 1067

Does every graph with chromatic number ℵ1\aleph_1 contain an infinitely connected subgraph with chromatic number ℵ1\aleph_1?

Erdős Problems records this as disproved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal2 retained
  4. Resolutiondisproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Where the source files it298 share a topic
None carries a Standing. Browse the topic.