Timeline for Can every finite graph be represented by an arithmetic sequence of natural numbers?
Current License: CC BY-SA 2.5
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 11, 2010 at 16:58 | comment | added | Hans-Peter Stricker | What do you think: May I change my question to "Which finite graphs may be represented...?" | |
Mar 11, 2010 at 16:34 | comment | added | Thomas Bloom | This argument can be extended to show the same for any tree (on at least three vertices). Might it still be possible for an interesting subclass of graphs? (e.g. graphs containing cycles, or graphs with complete components.) | |
Mar 11, 2010 at 16:09 | vote | accept | Hans-Peter Stricker | ||
Mar 11, 2010 at 16:03 | history | answered | Kevin Buzzard | CC BY-SA 2.5 |