Problem

erdos:905

∀ (n : ℕ) (G : SimpleGraph (Fin n)) [inst : DecidableRel G.Adj], ↑n ^ 2 / 4 < ↑G.edgeFinset.card → ∃ e ∈ G.edgeFinset, ↑n / 6 ≤ ↑(G.trianglesContaining e).card

Open Current State

Declared status: proved (Lean)
Formalization: formalized
Subjects: graph theory
OEIS: N/A
Sources: source:erdos-ai-contributions-wikisource:erdos-problemssource:formal-conjecturessource:jayyhk-erdos-leansource:plby-lean-proofs
Statement: www.erdosproblems.com

Matching claims

0

No direct claims

This problem has no directly related claim record.

Browse this Repository’s Claims