Timeline for Matching in regular bipartite graphs
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 22, 2012 at 16:05 | comment | added | hbm | $r \geq 3$ and $M$ is indeed a perfect matching. @Igor Rivin this is not a Homowork. I am interested in 1-factorizations of bipartite regular graphs when extra conditions on the graphs are imposed. | |
| May 22, 2012 at 2:03 | comment | added | Igor Rivin | The phrasing says "homework". Voting to close. | |
| May 22, 2012 at 2:00 | comment | added | Brendan McKay | Also, is $M$ required to be a perfect matching? There are none if $|X|$ is odd. | |
| May 22, 2012 at 1:55 | comment | added | Michael Albert | Do you want $r \geq 2$? Otherwise take $G$ to be a single matching with the `edge endpoint reversing' automorphism. | |
| May 22, 2012 at 1:49 | history | asked | hbm | CC BY-SA 3.0 |