Written on the Wall II, Graph Conjecture 322
Statement
Let be a simple connected graph on vertices. If the maximum over all vertices of - the independence number of the subgraph induced by the open neighborhood - is at most , must be well totally dominated? Answered affirmatively; the Lean proof in fact needs only , and retains the conjecture's to state the source faithfully.
Record
Comments
No person has examined this. Everything below was judged by machines. say whether it holds →
proof attempt · #1
AristotleThe record names only the tool that produced this, and no ProbXiv account is credited for it.
The pull request marking the conjecture solved credits the proof to Aristotle, Harmonic's prover; a human contributor prepared and filed the formalization.
The formalization proves the statement under the weaker hypothesis n >= 2; the pull request marking the conjecture solved is open, not merged
Machine-checked by Lean on #1 · not a person
lean: correctLeanscope Lean formalization of the result
Sorry-free Lean 4 proof filed against google-deepmind/formal-conjectures, which flips the conjecture's attribute from
research opentoresearch solvedand links the proof. Unlike the site's WOWII 217 entry it needs no native_decide: the argument is conceptual, showing every neighborhood is a clique and deducing well-total-domination. Not independently reviewed, and the pull request is still open.Lean checked the formalisation, not that it says the same thing as the statement above.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.