Timeline for Can every finite graph be represented by an arithmetic sequence of natural numbers?
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Feb 23 at 15:03 | history | suggested | The Amplitwist | CC BY-SA 4.0 |
fixed broken link to Wikipedia
|
| Feb 23 at 14:28 | review | Suggested edits | |||
| S Feb 23 at 15:03 | |||||
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Sep 29, 2011 at 3:13 | history | edited | Charles |
tag
|
|
| Mar 11, 2010 at 18:00 | comment | added | Hans-Peter Stricker | I will try. And I'll try this: to find other progressions (than arithmetic ones) for which the statement holds for all graphs. | |
| Mar 11, 2010 at 17:30 | comment | added | Reid Barton | The new question is not a real question, I feel. Pick a class of graphs you think is interesting and try enough examples that you can make a reasonable guess that it works. | |
| Mar 11, 2010 at 17:15 | history | edited | Hans-Peter Stricker | CC BY-SA 2.5 |
added 380 characters in body
|
| Mar 11, 2010 at 16:09 | vote | accept | Hans-Peter Stricker | ||
| Mar 11, 2010 at 16:04 | comment | added | Hans-Peter Stricker | I did feel that Green-Tao theorem is overkill, thanks for showing me why. I guess there will be an answer to your second comment? | |
| Mar 11, 2010 at 16:03 | answer | added | Kevin Buzzard | timeline score: 12 | |
| Mar 11, 2010 at 15:57 | comment | added | Kevin Buzzard | Oh...wait...apart from the fact that it clearly can't be done. | |
| Mar 11, 2010 at 15:55 | comment | added | Kevin Buzzard | Umm...I think the Green-Tao theorem is overkill. To get n+1 coprime integers in an arithmetic progression just consider 1,1+d,1+2d,...,1+nd with d=n!. Nice question though. | |
| Mar 11, 2010 at 15:43 | history | asked | Hans-Peter Stricker | CC BY-SA 2.5 |