1 / 20

Party Problem

Party Problem. The simplest example of Ramsey theory. It is also known as the ‘Maximum Clique Problem’. A clique of a graph is a complete sub graph of the main graph, and the clique of largest possible size is referred to as a maximum clique.

treva
Download Presentation

Party Problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Party Problem The simplest example of Ramsey theory. It is also known as the ‘Maximum Clique Problem’. A clique of a graph is a complete sub graph of the main graph, and the clique of largest possible size is referred to as a maximum clique. • Course Name: Graph Theory Level(UG/PG): UG • Author(s) : Phani Swathi Chitta • Mentor: Prof. Saravanan Vijayakumaran *The contents in this ppt are licensed under Creative Commons Attribution-NonCommercial-ShareAlike 2.5 India license

  2. Learning Objectives After interacting with this Learning Object, the learner will be able to: • Explain the proof for a problem called ‘Party problem’ of Ramsey theory

  3. Definitions of the components/Keywords: 1 • The ‘Party Problem’ is also called ‘Theorem on Friends and Strangers’. • Statement of the theorem is: • Prove that at a party of six people there are at least three mutual friends or at least there are three mutual strangers. • We can phrase the problem in graph-theoretic language as follows: • - Let the 6 nodes A - F stand for the 6 people in the party. • - Let the edges be colored red or blue depending on whether the two people represented by the nodes connected by the edge are mutual strangers or mutual friends, respectively. 2 3 4 5

  4. Master Layout 1 1 2 indicates know each other indicates don’t know each other 3 • Give Play, Next and Reset buttons 4 5

  5. Step 1: 1 indicates know each other 2 indicates don’t know each other 3 4 5

  6. Step 2: 1 2 3 4 5

  7. Step 3: 1 2 3 4 5

  8. Step 4: 1 2 3 4 5

  9. Step 5: 1 2 3 4 5

  10. Step 6: 1 2 3 4 5

  11. Step 7: 1 2 3 4 5

  12. Step 8: 1 2 3 4 5

  13. Step 9: 1 2 3 4 5

  14. Step 10: 1 2 3 4 5

  15. Electrical Engineering Slide 1 Slide 3 Slide 16,17,18,19 Slide 20 Introduction Definitions Analogy Test your understanding (questionnaire)‏ Lets Sum up (summary)‏ Want to know more… (Further Reading)‏ Interactivity: Try it yourself • Please select no. of nodes and Press PLAY button to start the animation • Please select color(red or blue) and click on any two nodes to join them. Default color is red Depending on the no. of nodes selected by the user the figure appears • Give drop down to select no. of nodes • 6 nodes • 5 nodes • 4 nodes • In the explanation area • When a line is drawn between nodes the below statement should appear • - Edge is drawn between XX node and YY node • When the triangle is formed the below statement should appear ( in red color or blue color depending on the color of the triangle) • - Triangle is formed • If all the lines are drawn and no triangle is formed then print the below statement • - Can’t find three people who know each other or don’t know each other • If all the nodes are connected with lines then • - All the edges are drawn • Give hint for each node as: • Hint: Possible Edges • 4 nodes: Edges can be drawn from A-B, A-C, A-D, B-C, B-D, C-D • 5 nodes: Edges can be drawn from A-B, A-C, A-D, A-E, B-C, B-D, B-E, C-D, C-E, D-E • 6 nodes: Edges can be drawn from A-B, A-C, A-D, A-E, A-F, B-C, B-D, B-E, B-F, C-D, C-E, C-F, D-E, D-F, E-F 15 Credits

  16. Questionnaire 1 1. In a party of 6 people, is it possible to have 3 mutual friends and 3 mutual strangers simultaneously? Answers: a) Yes b) No 2 3 4 5

  17. Questionnaire 1 2. In a party of 5 people, is it always true that there are at least 3 mutual friends or strangers? Answers: a) Yes b) No 2 3 4 5

  18. Questionnaire 1 3. There are 6 cities connected by either rail or road(only either of them but not both). How many cities can at least be connected by rail? Answers: a) 3 b) 4 c) 5 d) 6 2 3 4 5

  19. Questionnaire 1 4. There are 6 cities connected by either rail or road(only either of them but not both). How many cities can at least be connected by road? Answers: a) 3 b) 4 c) 5 d) 6 2 3 4 5

  20. Links for further reading Reference websites: http://mathworld.wolfram.com/RamseyNumber.html http://mathworld.wolfram.com/RamseyTheory.html http://www.cs.ucsb.edu/~rich/class/cs290I-grid/notes/Ramsey/ http://www.cut-the knot.org/Curriculum/Combinatorics/ThreeOrThree.shtml http://en.wikipedia.org/wiki/Theorem_on_friends_and_strangers http://en.wikipedia.org/wiki/Clique_problem Books: GRAPH THEORY –Harary, Narosa Publishing House

More Related