Erdős problem 1068 · problems.science

Does every graph with chromatic number $\aleph_1$ contain a countable subgraph which is infinitely connected?

Sources

Browse retained paths and inspect the exact material available for this Problem.

1 retained statement2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

1068.lean

Retained formal statement1 of 1

Does every graph with chromatic number $\aleph_1$ contain a countable subgraph which is infinitely connected?

FormalConjectures/ErdosProblems/1068.leanErdos1068.erdos_10683 linesExact file

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

OpenStatement only, no proof

Sources

Search problems.science