Combinatorics And Graph Theory Harris Solutions Manual Today

The solution was not a proof. It was a single diagram: a graph with 22 vertices and 33 edges, labeled like a constellation. At the bottom: This graph is you. Trace it. Find your odd cycle.

She laughed. That had to be a joke.

She was not sleeping much. Chapter 11 contained the supplemental problems — ones not in the student edition. Problem 11.4 read: Let G be a graph on n vertices. Prove that either G or its complement is connected. Combinatorics And Graph Theory Harris Solutions Manual

But below it, in a different handwriting — small, red ink — someone had written: See solution on page 347. Then see yourself. The solution was not a proof