Timeline for Counting matchings and perfect matchings
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 31, 2023 at 6:30 | history | edited | Per Alexandersson | CC BY-SA 4.0 |
added 199 characters in body
|
| May 31, 2023 at 6:23 | comment | added | Wlod AA | Definitions? Please. | |
| May 31, 2023 at 5:08 | comment | added | Per Alexandersson | @SamHopkins Right, these are related questions - I was hoping perhaps maybe there was some complexity theory distinction. So finding a matching is trivial; take no edges. But finding a perfect matching is harder (but can be done in polynomial time, e.g. cs.stackexchange.com/questions/62526/… ) so finding G' from G in polynomial time is still ok. | |
| May 30, 2023 at 20:08 | comment | added | Sam Hopkins | Sorry, I understand now that this question is about going in the opposite direction, compared to your last question: from total matchings to perfect matchings. | |
| May 30, 2023 at 20:01 | comment | added | Sam Hopkins | Isn't this basically the same as (well, more general than) your previous question: mathoverflow.net/questions/443258/… ? | |
| May 30, 2023 at 19:57 | history | asked | Per Alexandersson | CC BY-SA 4.0 |