Timeline for Lower bound on diameter of trivalent graphs
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 25, 2017 at 4:59 | vote | accept | Bidyut Sanki | ||
| Jun 24, 2017 at 7:56 | comment | added | Fedor Petrov | Yes, it is. Sometimes it is sharp, for example, $d=2$, $n=2k=10$, Petersen's graph. | |
| Jun 24, 2017 at 7:14 | comment | added | Bidyut Sanki | Thank you very much for your answer. This is the maximum number of nodes in a ball of radius $d$ . | |
| Jun 24, 2017 at 7:03 | history | answered | Fedor Petrov | CC BY-SA 3.0 |