Skip to main content
MathOverflow
steve chalkle's user avatar
steve chalkle's user avatar
steve chalkle's user avatar
steve chalkle
  • Member for 1 year, 4 months
  • Last seen more than 1 year ago
Profile Activity

4 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
awarded
 Excavator
awarded
 Editor
revised
how to proof "every loopless graph G has a bipartite subgraph with at least e(G)/2 edges"?
Added a specific example and asking for a specific solution.
suggested
Approve
how to proof "every loopless graph G has a bipartite subgraph with at least e(G)/2 edges"?