Academic Journal
On a problem of Bermond and Bollob\'as
| Title: | On a problem of Bermond and Bollob\'as |
|---|---|
| Authors: | Filipovski, Slobodan, Jajcay, Robert |
| Publication Year: | 2018 |
| Collection: | ArXiv.org (Cornell University Library) |
| Subject Terms: | Mathematics - Combinatorics |
| Description: | Let $n(k, d)$ be the order of the largest undirected graphs of maximum degree $k$ and diameter $d$, and let $M(k,d)$ be the corresponding Moore bound. In this paper, we give a positive answer to the question of Bermond and Bollob\'as concerning the Degree/Diameter Problem: Given a positive integer $c>0$, does there exist a pair $k$ and $d$, such that $n(k, d)\leq M(k,d)-c?$ |
| Document Type: | text |
| Language: | unknown |
| Relation: | http://arxiv.org/abs/1803.07501; Acta Mathematicae Applicandae 2021 |
| DOI: | 10.1007/s10440-021-00429-y |
| Availability: | https://doi.org/10.1007/s10440-021-00429-y http://arxiv.org/abs/1803.07501 |
| Accession Number: | edsbas.5A58C4B8 |
| Database: | BASE |
| Description not available. |