Math Is Fun Forum
Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ π -¹ ² ³ °
You are not logged in.
- Topics: Active | Unanswered
#1 2010-10-11 01:13:56
- mathHATESme
- Member
- Registered: 2010-10-11
- Posts: 1
A graph is bipartite iff it contains no odd cycle.
We all know how this was proven by sufficiency. But what I'm wondering is... how can you show the proof by necessity?
Offline