Timeline for What is the spectrum of the Rado graph?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 22, 2013 at 3:49 | history | edited | Aaron Meyerowitz | CC BY-SA 3.0 |
added 764 characters in body
|
| Mar 19, 2013 at 6:33 | comment | added | Aaron Meyerowitz | I only said one could look at it. I'd say it seems a reasonable choice but I agree that it may not be and that others may be better. Perhaps the spectrum is pretty robust. That might be a nice result. | |
| Mar 18, 2013 at 22:05 | comment | added | András Salamon | Why would $0,…,n−1$ using Rado's original numbering be the natural choice of finite restriction—why not the $n$ least-numbered neighbours of some enumeration of the vertices, or the first $n$ vertices in some other numbering of the graph? The spectrum seems to depend on this choice, and it seems possible that the limits obtained for some choices differ from other choices. | |
| Mar 18, 2013 at 20:18 | history | answered | Aaron Meyerowitz | CC BY-SA 3.0 |