Lesson plan
Degree diameter problem
In graph theory, the degree–diameter problem asks for the maximum possible number n_{d,k} of vertices in a finite simple undirected graph of maximum degree at most d and diameter at most k . A breadth-first search gives a general upper bound known as the Moore bound. Exact equality in the Moore bound is exceptional. Apart from complete graphs, odd cycles, and the degree-one cases, the only known graphs attaining it are the Petersen graph and the Hoffman–Singleton graph; the only unresolved nontrivial parameter pair for equality is degree 57 and diameter 2. The exact value of n_{d,k} is unknown for most pairs (d,k) . A 2026 preprint by Wouter Cames van Batenburg and Samuel Korsky reports a proof that, for every fixed positive integer k , : \lim_{d\to\infty}\frac{n_{d,k}}{d^k}=1. This resolves a conjecture of Béla Bollobás and shows that, for every fixed diameter, the Moore bound is asymptotically tight as the degree tends to infinity.
Article summary
In graph theory, the degree–diameter problem asks for the maximum possible number n_{d,k} of vertices in a finite simple undirected graph of maximum degree at most d and diameter at most k . A breadth-first search gives a general upper bound known as the Moore bound. Exact equality in the Moore bound is exceptional. Apart from complete graphs, odd cycles, and the degree-one cases, the only known graphs attaining it are the Petersen graph and the Hoffman–Singleton graph; the only unresolved nontrivial parameter pair for equality is degree 57 and diameter 2. The exact value of n_{d,k} is unknown for most pairs (d,k) . A 2026 preprint by Wouter Cames van Batenburg and Samuel Korsky reports a proof that, for every fixed positive integer k , : \lim_{d\to\infty}\frac{n_{d,k}}{d^k}=1. This resolves a conjecture of Béla Bollobás and shows that, for every fixed diameter, the Moore bound is asymptotically tight as the degree tends to infinity.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.