Resolution of Graffiti.pc Conjecture 84: A Sharp Universal Lower Bound for Maximum Induced Trees in Connected Graphs

Universal mathematical resolution and proof of Graffiti.pc Conjecture 84 (Google DeepMind formal-conjectures benchmark WrittenOnTheWallII/GraphConjecture84.lean). Proves tree(G) >= 2*rad(G)/delta(G) universally across all simple connected finite graphs, with sharpness proven on C_{2k} + leaf.

Authors

Publication Details

Journal
Open Science Framework
Published
2026-10-28
DOI
https://doi.org/10.17605/osf.io/9rxs7
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Resolution of Graffiti.pc Conjecture 84: A Sharp Universal Lower Bound for Maximum Induced Trees in Connected Graphs

om atul mehta
Open Science Framework
Advanced Graph Theory Research
article

Resolution of Graffiti.pc Conjecture 84: A Sharp Universal Lower Bound for Maximum Induced Trees in Connected Graphs

om atul mehta
article en

Abstract

Universal mathematical resolution and proof of Graffiti.pc Conjecture 84 (Google DeepMind formal-conjectures benchmark WrittenOnTheWallII/GraphConjecture84.lean). Proves tree(G) >= 2*rad(G)/delta(G) universally across all simple connected finite graphs, with sharpness proven on C_{2k} + leaf.

Open Science Framework
Openalex Percentile: Top 14%
Advanced Graph Theory Research
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Resolution of Graffiti.pc Conjecture 84: A Sharp Universal Lower Bound for Maximum Induced Trees in Connected Graphs — om atul mehta · Open Science Framework (2026) | TGRS Research Map | TGRS