Timeline for Partition the edges of a bipartite graph into perfect $b$-matchings
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21 at 21:32 | history | edited | Tommy | CC BY-SA 4.0 |
more minor rewording
|
| Sep 21 at 21:30 | history | edited | Tommy | CC BY-SA 4.0 |
avoid using 'degree sequence', which is usually used to mean a sorted list of degrees, not necessarily assigments of degrees to particular vertices
|
| Sep 21 at 21:27 | history | edited | Tommy | CC BY-SA 4.0 |
minor rewording
|
| Sep 21 at 21:26 | history | edited | Tommy | CC BY-SA 4.0 |
tried to clarify argument
|
| Sep 14 at 18:48 | review | Late answers | |||
| Sep 16 at 8:36 | |||||
| S Sep 14 at 18:28 | review | First answers | |||
| Sep 16 at 8:36 | |||||
| S Sep 14 at 18:28 | history | answered | Tommy | CC BY-SA 4.0 |