Written on the Wall II Conjecture (Erdős problem #194)
For every finite simple connected graph with , if , where is the independence number of and with the open neighborhood of , then has a Hamiltonian path.
References
- Lean-Certified Infinite Counterexamples to Written on the Wall II Conjecture 194 — Zenodo — Cameron Beeley
Source: Zenodo
Progress summary
A deposited report claims to disprove the conjecture with computer-certified counterexamples, but the result has not been independently verified.
The problem concerns the Written on the Wall II Conjecture, catalogued as Erdős problem #194; the retrieved sources do not restate the conjecture or give its proposer or date.
September 2026 claimed disproof
Current status (as of September 2026): A claimed disproof exists, but the conjecture is not verified as false because the formal statement, certification, and correspondence with the original conjecture have not been independently checked.
Sources
Solutions 0
No solutions have been posted yet.