Timeline for Perfect matchings of a regular, uniform, partite hypergraph
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 15, 2020 at 13:48 | comment | added | Erel Segal-Halevi | As far as I understand, they do not assume regularity, but they do assume that all $r$ sides of the graph contain the same number of vertices ($n$). | |
| Jul 7, 2020 at 22:36 | review | Late answers | |||
| Jul 8, 2020 at 0:01 | |||||
| Jul 7, 2020 at 22:20 | history | undeleted | alpmu | ||
| Jul 7, 2020 at 22:19 | history | deleted | alpmu | via Vote | |
| Jul 7, 2020 at 22:18 | history | answered | alpmu | CC BY-SA 4.0 |