This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: . Since and are disjoint, there is no shared horse forcing them to be the same color, so the proof falters. (0.12) Suppose there is a graph with nodes, . If no 2 nodes have the same degree, each node must have a different degree between (no connections to other nodes) and (connections to all other nodes), inclusive. Since there can’t be both an unconnected node and a node connected to every other node, at least 2 of the nodes must therefore have the same degree....
View Full Document
This homework help was uploaded on 04/10/2008 for the course COSI 30a taught by Professor Di lillo during the Spring '08 term at Brandeis.
- Spring '08
- Di Lillo