Send to a Friend

squaldig's avatar

How do I show that a simple graph of size n >= 2 always has at least two vertices of the same degree?

Asked by squaldig (5points) February 7th, 2007

Using Fluther

or

Using Email

Separate multiple emails with commas.
We’ll only use these emails for this message.