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
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 17, 2012 at 19:20 | vote | accept | Fred.Fred | ||
| Aug 16, 2012 at 18:39 | comment | added | Gerhard Paseman | It looks promising. Also, I added some comments to my answer which you might find useful. Thanks for the problem. You might ask if weaker versions of set theory allow you to do this. Gerhard "After This Question, More Await" Paseman, 2012.08.16 | |
| Aug 16, 2012 at 12:29 | history | edited | Fred.Fred | CC BY-SA 3.0 |
added 445 characters in body
|
| Aug 16, 2012 at 12:15 | history | answered | Fred.Fred | CC BY-SA 3.0 |