Problem

erdos:1068

True ↔ ∀ (V : Type) (G : SimpleGraph V), G.chromaticCardinal = Cardinal.aleph 1 → ∃ s, s.Countable ∧ (SimpleGraph.induce s G).InfinitelyConnected

Open Current State

Declared status: open
Formalization: formalized
Subjects: graph theoryset theorychromatic number
OEIS: N/A
Sources: source:erdos-problemssource:formal-conjectures
Statement: www.erdosproblems.com

Matching claims

0

No direct claims

This problem has no directly related claim record.

Browse this Repository’s Claims