Vela

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_37aec80d874a0239
vela reproduce examples/erdos-problems

formal

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.coe
formal-conjectures/1067.lean ↗

status

solved

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 6c5153c2ec9de8210b5a06141975a6ba0ba8926dd8c8f87afec185bc50f8b511

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.