Timeline for Birkhoff's theorem for hypergraphs
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 21, 2020 at 22:28 | comment | added | Tri | I don't know if this is relevant: Aharoni and Haxell, "Hall's Theorem for Hypergraphs," mathcs.emory.edu/~whalen/Papers/Hall/matchingsinhyps.pdf | |
| Aug 20, 2020 at 14:31 | comment | added | Erel Segal-Halevi | @GerryMyerson Interesting, but this is about finding a single perfect matching - not about decomposition into a convex combination of perfect matchings. | |
| Aug 20, 2020 at 13:12 | comment | added | Gerry Myerson | Sounds like Problem 2 of imc-math.org.uk/imc2011/imc2011-day2-solutions.pdf Also, there's a discussion of Hall's Theorem for hypergraphs at gilkalai.wordpress.com/2012/11/25/happy-birthday-ron-aharoni | |
| Aug 20, 2020 at 11:06 | history | asked | Erel Segal-Halevi | CC BY-SA 4.0 |