Written on the Wall II, Graph Conjecture 103
Statement
For every connected graph , is , where is the largest induced-bipartite-subgraph order? An -vertex counterexample - a triangle with four leaves on each of two vertices - has against bound .
Context
Machine-generated (Written on the Wall II); real but unfamous by construction.
People
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 counterexample was found with ChatGPT and Codex and verified in Lean, alongside exhaustive subset enumeration.
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
Lean-checked counterexample merged into the google-deepmind/formal-conjectures repository.
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.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.