Timeline for Good lower bound on matching in bipartite graph
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 18, 2013 at 15:14 | vote | accept | user30689 | ||
| Jan 17, 2013 at 19:22 | answer | added | Ami Paz | timeline score: 4 | |
| Jan 16, 2013 at 13:55 | comment | added | Chris Godsil | 0. If you insist that your graph has edges then 1 (think $K_{1,n}$). Your question is not well formulated. | |
| Jan 16, 2013 at 9:29 | history | asked | user30689 | CC BY-SA 3.0 |