Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 6 - Section 6.2 - The Pigeonhole Principle - Exercises - Page 406: 29

Answer

Showing that if n is an integer with n ≥ 2, then the Ramsey number R(2, n) equals n.

Work Step by Step

--We need to show two things: -that if we have a group of n people, then among them -we must find either a pair of friends or a subset of n of them all of whom are mutual enemies; -and that there exists a group of n − 1 people for which this is not possible. -For the first statement, if there is any pair of friends, then the condition is satisfied, and if not, then every pair of people are enemies, so -the second condition is satisfied. -- For the second statement, if -we have a group of n − 1 people all of whom are enemies of each other, then there is neither a pair of friends nor a subset of n of them all of whom are mutual enemies.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.