## Hypercube proof [closed]

I want to prove that any n-dimension hypercube is bipartite using induction

-
Dear Nick. This is not the appropriate level of question for the forum (as indicated in the FAQ). Moreover, given the specific way you formulate the question, it looks very likely that this is a homework question (otherwise, why would you care about the use of induction per se, as a method of proof?). This place is definitively NOT for solving homework questions. I vote to close. – André Henriques Mar 7 2011 at 21:31
Sorry, but MO is not for homework questions. Please try over at math.stackexchange.com Incidentally, I never really liked the inductive proof of this result. It is easy to see (non-inductively) that the n-dimension hypercube has no odd cycles. – Tony Huynh Mar 7 2011 at 21:34
:( it is not a homework more a theory related problem the theory suggest to prove it using induction on how to construct a hypercube of n-dimensions...I would be greatful if you could help me – Nick Mar 7 2011 at 21:41
@Nick, as Tony said, you might find a better forum in math.stackexchange.com. Even there, homework problems are not appreciated. I understand that yours is not one, but you should read our mathoverflow.net/howtoask and the similar pages at math.SE, and when you do post a question there, think about various ways to rewrite and expand it. In particular, mathematics questions (at any level) are best when accompanied by some background and motivation. Mathematicians are much more likely to answer questions when they know why they're interesting (interesting to you, say). – Theo Johnson-Freyd Mar 8 2011 at 1:28