Skip to main content
15 events
when toggle format what by license comment
Jun 29, 2017 at 2:08 history edited Tony Huynh CC BY-SA 3.0
Added tags and fixed link.
Sep 25, 2013 at 12:53 comment added user6976 @GerryMyerson: The book is indeed nice.
Sep 19, 2013 at 7:46 answer added Sasho Nikolov timeline score: 9
Sep 18, 2013 at 22:11 answer added Tony Huynh timeline score: 11
Sep 18, 2013 at 18:00 comment added user6976 @AnthonyQuas: The details are certainly interesting, and probably not only for me.
Sep 18, 2013 at 17:49 comment added Anthony Quas @Mark: Are details of a proof still relevant? I could try and assemble one - I'm pretty sure the ingredients are there, but if it's not needed, I'd rather not.
Sep 18, 2013 at 11:45 vote accept CommunityBot moved from User.Id=6976 by developer User.Id=69903
Sep 18, 2013 at 9:11 comment added Gerry Myerson There's a terrific but long out of print book by Reichmeider on the relations among Hall's Theorem, max-flow-min-cut, Dilworth's Theorem, and a few others.
Sep 18, 2013 at 7:13 comment added user6976 @AnthonyQuas: Yes, please!
Sep 18, 2013 at 6:29 comment added Anthony Quas Would a proof via convex duality work? I'm thinking of max flow/min cut.
Sep 18, 2013 at 5:48 answer added Gerry Myerson timeline score: 16
Sep 18, 2013 at 3:35 comment added user6976 I need the finite case of the theorem.
Sep 18, 2013 at 3:34 comment added Henry Cohn You can certainly pass from finite to infinite graphs by topology (see "The marriage problem" by Halmos and Vaughan for a nice two-page paper), but that sort of compactness argument is a different issue from whether the finite case itself has an analytic or topological proof.
Sep 18, 2013 at 3:20 history edited user6976 CC BY-SA 3.0
added 115 characters in body
Sep 18, 2013 at 3:14 history asked user6976 CC BY-SA 3.0