Explicit 𝑁-vertex graphs with maximum degree 𝐾 and diameter [1+𝑜(1)]log <sub>𝐾-1</sub> 𝑁 for each 𝐾-1 a prime power (Q5212858)
From MaRDI portal
scientific article; zbMATH DE number 7160591
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Explicit 𝑁-vertex graphs with maximum degree 𝐾 and diameter [1+𝑜(1)]log <sub>𝐾-1</sub> 𝑁 for each 𝐾-1 a prime power |
scientific article; zbMATH DE number 7160591 |
Statements
Explicit 𝑁-vertex graphs with maximum degree 𝐾 and diameter [1+𝑜(1)]log <sub>𝐾-1</sub> 𝑁 for each 𝐾-1 a prime power (English)
0 references
30 January 2020
0 references
explicit constructions
0 references
extremal graph theory
0 references
