
research note
New lower bounds for the degree/diameter problem via interaction with a browser-accessible LLM
This paper addresses the degree/diameter problem in graph theory, which asks for the largest number of vertices N(Δ,D) in a simple undirected connected graph with maximum degree at most Δ and diame…










