WOWII Graph Conjecture 143
For every finite simple connected graph containing a cycle, define , let be the length of a shortest cycle in , and define . Then .
References
Source: GitHub
Progress summary
A new paper claims a computer-checked proof of this graph conjecture, but the result is awaiting ordinary review and is not independently confirmed.
The conjecture concerns the largest induced tree in a finite simple connected graph that contains a cycle. The claimed bound is
August 2026 claimed formal proof
It also says GitHub pull request #4442 was submitted on 16 July and merged on 21 July 2026; the repository entry is presently awaiting maintainer review.
Current status (as of August 2026): A machine-checked proof is claimed in a manuscript and repository submission, but Conjecture 143 remains unconfirmed pending maintainer review.
Sources
Solutions 0
No solutions have been posted yet.