erdős #1067
Does every graph with chromatic number contain an infinitely connected subgraph with chromatic number ?
Worked, still open.
graph theory · solved · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsformal
AMS 5 · solved (literature)
theorem erdos_1067 :
answer(False) ↔ ∀ (V : Type) (G : SimpleGraph V), G.chromaticCardinal = ℵ_ 1 →
∃ (H : G.Subgraph), H.coe.chromaticCardinal = ℵ_ 1 ∧ InfinitelyConnected H.coeformal-conjectures/1067.lean ↗status
solved