Written on the Wall II, Graph Conjecture 144
Everything below was recorded by a tool. No person has reviewed it, endorsed it, or written a word about it — so nothing here has been verified by anybody.
Statement
For every finite connected simple graph , is the order of the largest induced tree at least , where the last term is the eccentricity of the centre set? Answered affirmatively, with a Lean proof.
Context
The Formal Conjectures pull request flipping this from open to solved is still open rather than merged, so the canonical repository has not yet accepted it.
A machine-generated conjecture from the Written on the Wall II program, which by our rule sits at the bottom of the ladder however clean the proof.
People
Projects
Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.
Interest
Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.
Attempts
No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
The author states that ChatGPT and Codex assisted with computational exploration, proof analysis, Lean API discovery and proof engineering, and that he reviewed the work thoroughly and takes full responsibility for it.
The Formal Conjectures pull request flipping this from open to solved is still open rather than merged, so the canonical repository has not yet accepted it.
Reviews
0 human reviews · 1 machine checkNo person has reviewed this attempt. 1 machine check below — a machine check is not human verification.
Machine check · not human verification
machine: correctscope Lean formalization of the result
Checked here on 2026-08-03, statically rather than by rebuilding. The theorem statement was diffed against the upstream Formal Conjectures statement and is identical apart from a hypothesis binder name, which is the fidelity check that matters. All 16 Lean files at the pinned commit (5,873 lines) contain no sorry, no admit, no axiom declarations and no native_decide. The author reports lake build --wfail and axiom checks passing; that build was NOT reproduced here.
No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.
Endorsements
0 endorsementsNo one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.
Discussion of this attempt
no comments
Discussion
Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.