Skip to content

Erdős problem 595

Erdős Problem 595 (250): Is there an infinite graph G which contains no K4K_4 and is not the union of countably many triangle-free graphs?

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/595.lean

Formal Conjectures

FormalConjectures/ErdosProblems/595.leanErdos595.erdos_5951 lineExact file
True ↔ ∃ V, ∃ (_ : Infinite V), ∃ G, G.CliqueFree 4 ∧ ¬Erdos595.IsCountableUnionOfTriangleFree G
OpenStatement only, no proof

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page