Timeline for Diameter of sum-graph over a non-meager set
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 8, 2015 at 12:30 | comment | added | Tom De Medts | Sure, go ahead. It's just that because of the way you asked the question, I thought that perhaps you already had such an example in mind. | |
| Apr 8, 2015 at 12:18 | comment | added | Dominic van der Zypen | Sorry for misunderstanding. I think this would be a good question to ask - please go ahead. Or if you prefer not to, is it OK if I do it? | |
| Apr 8, 2015 at 11:59 | comment | added | Tom De Medts | Well, my question was of course whether you have examples where $S$ is meager but nevertheless the two other claims are valid, i.e. $G_S$ is connected but $\operatorname{diam}(G_S)$ is infinite... | |
| Apr 8, 2015 at 11:03 | vote | accept | Dominic van der Zypen | ||
| Apr 8, 2015 at 10:50 | answer | added | Ben Barber | timeline score: 3 | |
| Apr 8, 2015 at 10:40 | comment | added | Dominic van der Zypen | For instance the set of square numbers $S = \{n^2: n\in \mathbb{N}\}$ is meager. Moreover, it appears that the associated $G_S$ has diameter 4 (see mathoverflow.net/questions/201930/…). | |
| Apr 8, 2015 at 10:17 | comment | added | Tom De Medts | Controlling the diameter of such a graph seems hard. Do you have examples where $S$ is meager? | |
| Apr 8, 2015 at 8:56 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |