Recent content by mrtanaka

Thank you for replying. I see that if you take out k+1, at least two of them will be adjacent. but i do not see how this says anything about the size of the independent set, so i am still unclear

Homework Statement Prove: G is bipartite iff every subgraph H has an independent set containing |V(H)|/2 Homework Equations independent set = set of mutually nonadjacent vertices. The Attempt at a Solution I am trying to understand a solution given by my prof (for the backwards...