Timeline for Graphs with unique 1-Factorization
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 12, 2017 at 13:16 | comment | added | Mario Krenn | @BrendanMcKay After your answer I had to think again what I actually needed, and finally reformulated the question. Thank you very much again, your answer was very helpful! | |
| Apr 12, 2017 at 4:47 | comment | added | Brendan McKay | @GordonRoyle : Smart arse. | |
| Apr 11, 2017 at 22:52 | comment | added | Gordon Royle | I tried searching without the second "u" but didn't find anything on "uniqely edge colurable"! | |
| Apr 11, 2017 at 16:19 | vote | accept | Mario Krenn | ||
| Apr 11, 2017 at 16:19 | comment | added | Mario Krenn | Thank you very much for this answer! The P(9,2) is a wonderful counterexample for a conjecture I had (actually, something I believed was obviously true): A perfect matching is always a 1-factor (one factor of a complete 1-factorization). Apparently, the P(9,2) has a perfect matching connecting all inner vertices with the outer ones. And that one is no 1-factor. Thank you very much! | |
| Apr 11, 2017 at 11:23 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 5 characters in body
|
| Apr 11, 2017 at 9:31 | history | answered | Brendan McKay | CC BY-SA 3.0 |