Erdős problem 944 · problems.science

Let $k \ge 4$ and $r\ge 1$ . Must there exist a graph $G$ with chromatic number $k$ such that every vertex is critical, yet every critical set of edges has size $>r$ ?

Sources

Browse retained paths and inspect the exact material available for this Problem.

7 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

944.lean

Retained formal statement5 of 7

Jensen [Je02] gave an construction for $k$ -critical graphs without any critical edges for all $k ≥ 5$ .

[Je02] Jensen, Tommy R., Dense critical and vertex-critical graphs. Discrete Math. (2002), 63--84.

FormalConjectures/ErdosProblems/944.leanErdos944.erdos_944.variants.dirac_conjecture.k_ge_five1 lineExact file

1∀ (k : ℕ), 5 ≤ k → ∃ V G, Erdos944.SimpleGraph.IsErdos944 G k 1

SolvedStatement only, no proof

Sources

Search problems.science