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

Ryosuke Mizuno

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