Timeline for A k-1 edge connected k regular graph is matching covered
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 21, 2012 at 22:29 | comment | added | Andrew D. King | Yes, I just added the missing details. Additionally I originally said "stable set polytope" when I meant to say "perfect matching polytope". Hope this helps. | |
| Feb 21, 2012 at 22:29 | history | edited | Andrew D. King | CC BY-SA 3.0 |
added 1113 characters in body
|
| Feb 19, 2012 at 21:46 | comment | added | Cosmin Pohoata | Sorry, I was going through this again, and I'm having trouble understanding this approach. Can you please offer more details? Thanks. | |
| Oct 24, 2011 at 2:31 | history | answered | Andrew D. King | CC BY-SA 3.0 |