Timeline for "sparse graphs are locally tree-like"
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Sep 12, 2013 at 12:21 | history | suggested | Sergiy Kozerenko | CC BY-SA 3.0 |
TeX changes
|
| Sep 12, 2013 at 12:12 | review | Suggested edits | |||
| S Sep 12, 2013 at 12:21 | |||||
| Aug 28, 2013 at 9:54 | history | edited | user9072 | CC BY-SA 3.0 |
tags and made link clickable and stabke, and added one; MJ not added on purpose
|
| Mar 12, 2012 at 14:27 | answer | added | Francesc Font-Clos | timeline score: 1 | |
| Feb 21, 2011 at 16:47 | comment | added | user13038 | [Thanks to everyone who has answered or commented - I am going to need to take some time to think about these answers, but they look very helpful.] | |
| Feb 17, 2011 at 23:12 | answer | added | user13006 | timeline score: 3 | |
| Feb 17, 2011 at 18:16 | answer | added | Kevin P. Costello | timeline score: 6 | |
| Feb 17, 2011 at 14:34 | comment | added | Louigi Addario-Berry | I think N is $\log_2 |V|$, or something like that, in that paper. They consider binary vectors of length $N$. Furthermore, "most" sparse graphs have logarithmic diameter (say, random regular graphs of constant degree $d \geq 3$, or the giant component of Erdos-Rényi random graphs with $p=c/n$ and $c>1$ a constant), rather than linear. | |
| Feb 17, 2011 at 14:32 | answer | added | Aaron Meyerowitz | timeline score: 4 | |
| Feb 17, 2011 at 12:37 | history | asked | user13038 | CC BY-SA 2.5 |