Timeline for Bipartite graph with exactly one perfect matching
Current License: CC BY-SA 4.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 6, 2021 at 17:39 | answer | added | Algernon | timeline score: 3 | |
Aug 6, 2021 at 17:27 | comment | added | Richard Stanley | The graph must have a cycle, since otherwise there would be vertex of degree one. | |
Aug 6, 2021 at 14:34 | comment | added | Algernon | Cross-posted: math.stackexchange.com/q/4217756/37830 | |
Aug 6, 2021 at 13:35 | comment | added | Ken W. Smith | Can you show that the graph has a cycle? If it does, it must be a cycle on an even number of vertices and on those vertices, there are two perfect matchings.... (What is the source of this problem?) | |
Aug 5, 2021 at 22:04 | review | First posts | |||
Aug 6, 2021 at 4:35 | |||||
Aug 5, 2021 at 22:01 | history | asked | Sanket Biswas | CC BY-SA 4.0 |