Written on the Wall II, Conjecture 84: tree(G) ≥ 2 rad(G) / δ(G)
Source: github.com/ProblemHunter/wowii84-lean/tree/722b098bafb5371c…
A complete Lean 4 / Mathlib formalization of Conjecture 84 of DeLaViña's "Written on the Wall II" (conjectures of Graffiti.pc): for every finite simple connected graph G with positive minimum degree δ(G), the maximum number of vertices of an induced subtree satisfies tree(G) ≥ 2·rad(G)/δ(G). The formal statement is the one recorded in google-deepmind/formal-conjectures (WrittenOnTheWallII/GraphConjecture84.lean, theorem `conjecture84`), copied verbatim together with its definition of `largestInducedTreeSize`. The proof formalizes the argument of J. J. Gebendorfer's manuscript "Induced trees…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-03-000005
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-03-000005/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-03-000005/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'