Timeline for Connectedness of random distance graph on integers
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Sep 22, 2013 at 18:28 | history | suggested | Sergiy Kozerenko | CC BY-SA 3.0 |
TeX corrections
|
| Sep 22, 2013 at 18:20 | review | Suggested edits | |||
| S Sep 22, 2013 at 18:28 | |||||
| Apr 27, 2010 at 11:53 | vote | accept | domotorp | ||
| Apr 24, 2010 at 13:25 | answer | added | fedja | timeline score: 9 | |
| Apr 24, 2010 at 10:13 | comment | added | domotorp | oh, I started to believe that it might be false, at least I am pretty sure that the path approach (also suggested in didier's answer) fails if p grows very slowly. So please, post the sketch of the proof! | |
| Apr 24, 2010 at 3:12 | comment | added | fedja | This is true but slightly non-trivial (I mean the main question). If you haven't found this result in Shelah's papers or somewhere else already, I'll post the proof tomorrow. Now it is too late (and the comment window is too narrow...) | |
| Apr 21, 2010 at 21:07 | answer | added | Did | timeline score: 4 | |
| Apr 21, 2010 at 19:44 | comment | added | François G. Dorais | (I came across this by pure accident. Apologies if it turns out to be a dead end.) | |
| Apr 21, 2010 at 19:42 | comment | added | François G. Dorais | Shelah has a series of papers titled Zero-one laws for graphs with edge probability decaying with distance. I haven't read any of them, but the title looks promising. | |
| Apr 21, 2010 at 18:55 | answer | added | Alon Amit | timeline score: 0 | |
| Apr 21, 2010 at 16:13 | history | asked | domotorp | CC BY-SA 2.5 |