Timeline for how to proof "every loopless graph G has a bipartite subgraph with at least e(G)/2 edges"?
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 6, 2012 at 13:54 | vote | accept | Mathsniper | ||
| Mar 6, 2012 at 11:41 | history | answered | Zahra Taheri | CC BY-SA 3.0 |