Timeline for The minimum possible degree of a graph of $n$ vertices, in which all pairs of nodes have a distance no more than $d$
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 28, 2018 at 17:09 | answer | added | RaphaelB4 | timeline score: 1 | |
| May 28, 2018 at 10:43 | comment | added | Brendan McKay | No exact formula known. Essentially the same problem with table of records is here: en.wikipedia.org/wiki/… | |
| May 28, 2018 at 8:32 | comment | added | usul | It seems like expander graphs should give about the right answer... | |
| May 28, 2018 at 8:03 | history | asked | zbh2047 | CC BY-SA 4.0 |