Contact
Blog
Chat
What is Fluther?
Home
Send to a Friend
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
(
5
) February 7th, 2007
proofs
graph theory
mathematics
Using Fluther
Username
Sending to your brainy friends...
or
Using Email
From
To
Separate multiple emails with commas.
We’ll
only
use these emails for this message.
Message
Hey! I thought you'd know the answer to this question on Fluther:
Sending to your brainy friends...
Already a member?
Login
Join for Free!
privacy policy
Create Username
Create Password
Verify Password
Your Email
To join, you must be at least 13 years old and agree to the
terms and conditions
Login
Username
Password
Forgot info?
Not a member?
Join for FREE!