friends strangers
play

Friends & Strangers Claim: there is a set of 3 mutual friends - PowerPoint PPT Presentation

Mathematics for Computer Science Friends & Strangers MIT 6.042J/18.062J Six people. Every two are Proof by Cases: either friends or strangers. Friends & Strangers Claim: there is a set of 3 mutual friends or 3 mutual strangers


  1. Mathematics for Computer Science Friends & Strangers MIT 6.042J/18.062J Six people. Every two are Proof by Cases: either friends or strangers. Friends & Strangers Claim: there is a set of 3 mutual friends or 3 mutual strangers Albert R Meyer February 8, 2015 friend-strangers.1 Albert R Meyer February 8, 2015 friend-strangers.2 Friends & Strangers Friends & Strangers People are circles Take 3 minutes to find a 3 mutual strangers 3 mutual friends counter-example --or convince yourself there isn’t any counterexample, that is, the Claim is true. red line shows friends blue line shows strangers friend-strangers.3 friend-strangers.4 Albert R Meyer February 8, 2015 Albert R Meyer February 8, 2015 1

  2. A Proof of the Claim A Proof of the Claim € Person has a line to each of Case 1: some pair of these friends other people. the are friends of each other, • lines are red or blue, so at then we have 3 mutual friends: least must be the same color. has ≥ friends Albert R Meyer February 8, 2015 friend-strangers.5 Albert R Meyer February 8, 2015 friend-strangers.7 A Proof of the Claim A Proof of the Claim Case 2: no pair of these friends are friends of each other, Since the Claim is true in either case, so we have 3 mutual strangers: and one of these cases always holds, the Claim is always true. QED friend-strangers.8 friend-strangers.9 Albert R Meyer February 8, 2015 Albert R Meyer February 8, 2015 2

  3. Ramsey• s Theorem Ramsey• s Theorem For any k, every large enough group of For any k, every large enough group of people will include either people will include either k mutual friends, or size-k red clique , or k mutual strangers. size-k blue clique . Let R(k) be the large enough size. R(3) = 6. So we’ve proved that R(3) ≤ 6. Albert R Meyer February 8, 2015 friend-strangers.10 Albert R Meyer February 8, 2015 friend-strangers.11 Ramsey• s Numbers Turns out that R(4) = 18 (not easy!) R(5) is unknown! Paul Erdös considered finding R(6) a hopeless challenge! So in our second class, we have reached a research frontier! friend-strangers.12 Albert R Meyer February 8, 2015 3

  4. MIT OpenCourseWare http://ocw.mit.edu 6.042J / 18.062J Mathematics for Computer Science Spring 20 15 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend