Source labels openChecked July 26, 2026

Erdős Problem 944: K Eq Four

The case $k=4$ and $r=1$ remains open: Are there $4$ -critical graphs without any critical edges?

Number theory AMS 11

Mathematical statement

The case $k=4$ and $r=1$ remains open: Are there $4$ -critical graphs without any critical edges?

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_944.variants.dirac_conjecture.k_eq_four

Canonical source

Complete statement target, proof intentionally absentLean 4

theorem erdos_944.variants.dirac_conjecture.k_eq_four :    answer(sorry) ↔ ∃ (V : Type u) (G : SimpleGraph V), G.IsErdos944 4 1 := by  sorry

Statement source: Formal Conjectures
Lean version: v4.27.0
Placeholder: Present; no proof artifact
Source evidence: Pinned source index
Fidelity review: Community formulation

References

Pinned Formal Conjectures sourceformalization erdosproblems.com/944background