Explicit \(N\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}N\) for each \(K-1\) a prime power (Q5212858)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7160591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Explicit \(N\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}N\) for each \(K-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
0.935858964920044
0 references
0.892255425453186
0 references
0.8920745253562927
0 references
0.8091951608657837
0 references
