Question

Let Gh be the collection of all graphs with the vertex set V = {1, 2,...

Let Gh be the collection of all graphs with the vertex set V = {1, 2, 3, 4, 5, 6, 7, 8}. Suppose we are given a list of 32 graphs G1, G2, . . . G32, each in Gh.

(a) The following argument is wrong. Identify the error.

There are \binom{8}{2} = 28 two-element subsets of V . Given any graph G ∈ Gh, each edge e ∈ E(G) is a two-element subset of V . So there are 28 different graphs possible, and |Gh| = 28. Since our list includes 32 different graphs, and 32 > 28, by the pigeonhole principle at least two of the graphs in the list must be the same. (That is, Gi = Gj for some 1 ≤ i < j ≤ k.)

(b) How many graphs do we really need in the list to assure that at least two are the same?

0 0
Add a comment Improve this question Transcribed image text
Request Professional Answer

Request Answer!

We need at least 10 more requests to produce the answer.

0 / 10 have requested this problem solution

The more requests, the faster the answer.

Request! (Login Required)


All students who have requested the answer will be notified once they are available.
Know the answer?
Add Answer to:
Let Gh be the collection of all graphs with the vertex set V = {1, 2,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT