Timeline for Subset of edges of graph touching all vertices such that all paths consist of at most two edges
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 17, 2012 at 19:20 | vote | accept | Fred.Fred | ||
| Aug 16, 2012 at 12:15 | answer | added | Fred.Fred | timeline score: 1 | |
| Aug 16, 2012 at 7:55 | history | edited | Fred.Fred | CC BY-SA 3.0 |
added 12 characters in body; edited title; added 70 characters in body; added 4 characters in body
|
| Aug 16, 2012 at 4:23 | comment | added | Andreas Blass | There's also room for confusion as to whether the "length" of a path is the number of vertices or the number of edges. Maybe the two confusions can be made to cancel? I'm pretty sure the OP wants to prohibit paths that have 4 vertices and (therefore) 3 edges. | |
| Aug 16, 2012 at 4:21 | answer | added | Aaron Meyerowitz | timeline score: 0 | |
| Aug 16, 2012 at 3:40 | comment | added | Brendan McKay | The confusion between 2 and 3 makes it incomprehensible. | |
| Aug 16, 2012 at 0:29 | answer | added | Igor Rivin | timeline score: 0 | |
| Aug 15, 2012 at 23:19 | comment | added | Gerry Myerson | Title asks length at most 3, body asks length at most 2. Please edit for consistency. | |
| Aug 15, 2012 at 20:29 | answer | added | Gerhard Paseman | timeline score: 0 | |
| Aug 15, 2012 at 19:17 | history | asked | Fred.Fred | CC BY-SA 3.0 |