Timeline for how to proof "every loopless graph G has a bipartite subgraph with at least e(G)/2 edges"? [closed]
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jul 28, 2023 at 6:14 | history | suggested | steve chalkle | CC BY-SA 4.0 |
Added a specific example and asking for a specific solution.
|
| Jul 27, 2023 at 21:42 | review | Suggested edits | |||
| S Jul 28, 2023 at 6:14 | |||||
| Mar 6, 2012 at 16:13 | history | closed |
Brendan McKay Chris Godsil Igor Rivin Benjamin Steinberg Andreas Blass |
off topic | |
| Mar 6, 2012 at 13:54 | vote | accept | Mathsniper | ||
| Mar 6, 2012 at 11:41 | answer | added | Zahra Taheri | timeline score: 8 | |
| Mar 6, 2012 at 10:33 | history | asked | Mathsniper | CC BY-SA 3.0 |