Problem

erdos:64

True ↔ ∀ (V : Type u_1) (G : SimpleGraph V) [inst : Fintype V] [inst_1 : DecidableRel G.Adj], G.minDegree ≥ 3 → ∃ k v c, k ≥ 2 ∧ c.IsCycle ∧ c.length = 2 ^ k

Open Current State

Declared status: falsifiable
Formalization: formalized
Prize: $1000
Subjects: graph theorycycles
OEIS: N/A
Sources: source:erdos-problemssource:formal-conjectures
Statement: www.erdosproblems.com

Matching claims

0

No direct claims

This problem has no directly related claim record.

Browse this Repository’s Claims