- Thread starter
- #1

#### find_the_fun

##### Active member

- Feb 1, 2012

- 166

a)verify the base case where G has no edges - done

b)Write down the strong induction hypothesis that asserts the statement is true for all graphs that meet the hypotheses and have at most k edges.

I'm not sure if I did b right. Here's what I got

Assume that G is connected and it has a Eularian Circuit if has at most k edges and ever vertex has an even degree.

Is this right? In the induction hypothesis a new constant is introduced, which is k in this case.