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 | |
|---|---|---|---|---|---|
| Oct 24, 2011 at 1:30 | vote | accept | Cosmin Pohoata | ||
| Oct 23, 2011 at 20:27 | comment | added | Igor Rivin | The proof is in Berge's book, which used to be a standard graph theory reference, so is certainly in your university library. | |
| Oct 23, 2011 at 19:40 | comment | added | Cosmin Pohoata | Errr, I hate how everything not too convoluted has been already found in Graph Theory! Anyway, I can't access the paper to see the author's proof. I myself did it with Tutte's matching theorem/lemma. Other ideas? | |
| Oct 23, 2011 at 18:48 | history | answered | Igor Rivin | CC BY-SA 3.0 |