BitsExplorer
Preview of Graphhunter Ai

Graphhunter Ai

Disproved the conjectured lower bound $\rho(D^L) - \mu(G) \ge \frac{3n-4}{2} = 20. 5000$ by discovering a connected graph with $\rho - \mu = 17.

Description read from the page itself, because the listing it was found in gave none.

Open it Listing