graph theory question
- From: hujin <enphinion4@xxxxxxxxxxx>
- Date: Mon, 20 Feb 2006 10:06:02 EST
Q: Must the number of odd people at a party who do not know an odd number of people be even?
A: Yes, if people are represented as vertices, an edge representing if 2 people do not know each other, then since the sum of the degrees of all vertices must be even, the answer is yes.
Is this right? (Assume not knowing is mutual)
Is there a way to negate the sentence, reformulating in terms of people knowing each other.
.
- Follow-Ups:
- Re: graph theory question
- From: Robert Israel
- Re: graph theory question
- From:
- Re: graph theory question
- Prev by Date: Braids: summit power and upper bound from exponent sum
- Next by Date: Re: Explanation of this hypothesis of SUBSTITUTION RULE requested
- Previous by thread: Braids: summit power and upper bound from exponent sum
- Next by thread: Re: graph theory question
- Index(es):
Relevant Pages
|
