New lower bounds for the degree/diameter problem via interaction with a browser-accessible LLM

Ryosuke Mizuno

Let $N(\Delta ,D)$ denote the maximum number of vertices in a simple undirected connected graph with maximum degree at most $\Delta$ and diameter at most $D$. Determining $N(\Delta ,D)$ is known as…