Timeline for Average degree of neighbors in a simple graph (-> Friendship paradox)
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 6, 2015 at 9:20 | history | edited | Dominic van der Zypen | CC BY-SA 3.0 |
added 4 characters in body
|
| May 6, 2015 at 9:15 | vote | accept | CommunityBot | ||
| Sep 2, 2015 at 16:36 | |||||
| May 6, 2015 at 9:03 | comment | added | James Cranch | Or take a union of lots and lots of copies of an n-regular graph, and a single m-regular graph, where m<n. As you take more and more copies of the n-regular graph, the vertices of above-average degree n are a larger and larger proportion of all the vertices. | |
| May 6, 2015 at 9:00 | history | answered | Dominic van der Zypen | CC BY-SA 3.0 |