Erdős problem 1175 · problems.science

Let $\kappa$ be an uncountable cardinal. Must there exist a cardinal $\lambda$ such that every graph with chromatic number $\lambda$ contains a triangle-free subgraph with chromatic number $\kappa$ ?

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/1175.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1175.leanErdos1175.erdos_11756 linesExact file

1True ↔2  ∀ (κ : Cardinal.{u_1}),3    Cardinal.aleph0 < κ →4      ∃ μ,5        ∀ (V : Type u_1) (G : SimpleGraph V),6          G.chromaticCardinal = μ → ∃ H, H.coe.CliqueFree 3 ∧ H.coe.chromaticCardinal = κ

OpenStatement only, no proof

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Continue

Search problems.science