Skip to content

Erdős problem 1068

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

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/1068.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1068.leanErdos1068.erdos_10683 linesExact file
True ↔  ∀ (V : Type) (G : SimpleGraph V),    G.chromaticCardinal = Cardinal.aleph 1 → ∃ s, s.Countable ∧ (SimpleGraph.induce s G).InfinitelyConnected
OpenStatement only, no proof

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page