Presentation is loading. Please wait.

Presentation is loading. Please wait.

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.

Published byTemel Benli Modified over 5 years ago

Similar presentations

Presentation on theme: "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."— 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 1 2 3 4 5 Definitions of the components/Keywords:
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 3

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

5 3 Step 1: 1 2 4 5 indicates know each other
indicates don’t know each other 3 Instruction for the animator Text to be displayed in the working area (DT) Show the black circles A to F in the animation area and the red and blue lines in the explanation area The text in DT should appear in parallel to the figures Any node will have 5 edges. For any node the no. of blue lines and the no. of red lines can be tabulated as follows: Blue Red Here we consider the case of a node having 3 blue lines and 2 red lines 4 5

6 3 Step 2: 1 2 4 5 Instruction for the animator
Text to be displayed in the working area (DT) When the user clicks PLAY, a blue line must be drawn between A and B The text in DT should appear in parallel to the figures Press NEXT button to go to next step Node A is connected to node B with a blue line indicating A knows B 5

7 3 Step 3: 1 2 4 5 Instruction for the animator
Text to be displayed in the working area (DT) When the user clicks NEXT, a blue line must be drawn between A and C The text in DT should appear in parallel to the figures Press NEXT button to go to next step Node A is connected to node C with a blue line indicating A knows C 5

8 3 Step 4: 1 2 4 5 Instruction for the animator
Text to be displayed in the working area (DT) When the user clicks NEXT, a blue line must be drawn between A and D The text in DT should appear in parallel to the figures Press NEXT button to go to next step Node A is connected to node D with a blue line indicating A knows D 5

9 3 Step 5: 1 2 4 5 Instruction for the animator
Text to be displayed in the working area (DT) When the user clicks NEXT, a red line must be drawn between A and E The text in DT should appear in parallel to the figures Press NEXT button to go to next step Node A is connected to node E with a red line indicating A doesn’t know E 5

10 3 Step 6: 1 2 4 5 Instruction for the animator
Text to be displayed in the working area (DT) When the user clicks NEXT, a red line must be drawn between A and F The text in DT should appear in parallel to the figures Press NEXT button to go to next step Node A is connected to node F with a red line indicating A doesn’t know F 5

11 3 Step 7: 1 2 4 5 Instruction for the animator
Text to be displayed in the working area (DT) When the user clicks NEXT, a red line must be drawn between B and C The text in DT should appear in parallel to the figures Press NEXT button to go to next step Node A is connected to nodes B and C with blue lines. If B and C are connected with blue line, A-B-C triangle will be formed which we try to avoid. So a red line is drawn between B and C 5

12 3 Step 8: 1 2 4 5 Instruction for the animator
Text to be displayed in the working area (DT) When the user clicks NEXT, a red line must be drawn between C and D The text in DT should appear in parallel to the figures Press NEXT button to go to next step Node A is connected to nodes C and D with blue lines. If C and D are connected with blue line, A-C-D triangle will be formed which we try to avoid. So a red line is drawn between C and D 5

13 3 Step 9: 1 2 4 5 Instruction for the animator
Text to be displayed in the working area (DT) When the user clicks NEXT, a red line must be drawn between B and D The text in DT should appear in parallel to the figures Press NEXT button to go to next step Node A is connected to nodes B and D with blue lines. If B and D are connected with blue line, A-B-D triangle will be formed which we try to avoid. So a red line is drawn between B and D But if a red line is drawn between B and D, it forms a red triangle B-C-D which cannot be avoided. Here red triangle B-C-D indicates B, C and D are strangers 5

14 3 Step 10: 1 2 4 5 Instruction for the animator
Text to be displayed in the working area (DT) The text in DT should appear at last Then give End of animation and then the RESET button has to be enabled Press RESET to stop the animation Thus we conclude that in a party of 6 guests there will be at least 3 mutual friends or at least 3 mutual strangers 5

15 Test your understanding
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) 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) c) 5 d) 6 2 3 4 5

20 Links for further reading
Reference websites: knot.org/Curriculum/Combinatorics/ThreeOrThree.shtml Books: GRAPH THEORY –Harary, Narosa Publishing House

Download ppt "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."

Similar presentations

Logical Operations on Images Boolean logic is a system of logical operations defined by George Boole in the mid 19th century to apply algebraic operations.

Logical Operations on Images Boolean logic is a system of logical operations defined by George Boole in the mid 19th century to apply algebraic operations.
Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
High Boost filtering In image processing, it is often desirable to emphasize high frequency components representing the image details without eliminating.

High Boost filtering In image processing, it is often desirable to emphasize high frequency components representing the image details without eliminating.
Hamming Code A Hamming code is a linear error-correcting code named after its inventor, Richard Hamming. Hamming codes can detect up to two bit errors,

Hamming Code A Hamming code is a linear error-correcting code named after its inventor, Richard Hamming. Hamming codes can detect up to two bit errors,
SDS-PAGE gel analysis SDS-PAGE analysis is done to study the expression of a protein from the control and the sample, to detect the molecular weight of.

SDS-PAGE gel analysis SDS-PAGE analysis is done to study the expression of a protein from the control and the sample, to detect the molecular weight of.
Syndrome Decoding of Linear Block Code

Syndrome Decoding of Linear Block Code
Binary Exponential Backoff Binary exponential backoff refers to a collision resolution mechanism used in random access MAC protocols. This algorithm is.

Binary Exponential Backoff Binary exponential backoff refers to a collision resolution mechanism used in random access MAC protocols. This algorithm is.
Document that explains the chosen concept to the animator.

Document that explains the chosen concept to the animator.
Driving force for solidification This Learning object ‏ will introduce the concept of undercooling and driving force for phase transformations Subject:

Driving force for solidification This Learning object ‏ will introduce the concept of undercooling and driving force for phase transformations Subject:
Document that explains the chosen concept to the animator 1.

Document that explains the chosen concept to the animator 1.
Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
Logic Gates Part – III : Combinational Logic Gates Combinational Logic Circuits are made up from basic logic NAND, NOR or NOT gates that are combined

Logic Gates Part – III : Combinational Logic Gates Combinational Logic Circuits are made up from basic logic NAND, NOR or NOT gates that are "combined"
ID template 5.0 for creating learning objects Created by OSCAR team October 2011 INSTRUCTIONS SLIDE: DO NO EDIT.

ID template 5.0 for creating learning objects Created by OSCAR team October 2011 INSTRUCTIONS SLIDE: DO NO EDIT.
Electrical Resistivity in Superconductors The electrical resistivity of many metals and alloys drops suddenly to zero when the specimen is cooled to a.

Electrical Resistivity in Superconductors The electrical resistivity of many metals and alloys drops suddenly to zero when the specimen is cooled to a.
Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.

Welcome This is a document to explains the chosen concept to the animator. This will take you through a 5 section process to provide the necessary details.
Line Coding Schemes ‏Line coding is the process of converting binary data, a sequence of bits to a digital signal. Authors Phani Swathi Chitta Mentor Prof.

Line Coding Schemes ‏Line coding is the process of converting binary data, a sequence of bits to a digital signal. Authors Phani Swathi Chitta Mentor Prof.
Convolutional Coding In telecommunication, a convolutional code is a type of error- correcting code in which m-bit information symbol to be encoded is.

Convolutional Coding In telecommunication, a convolutional code is a type of error- correcting code in which m-bit information symbol to be encoded is.
Isothermal reversible ideal gas system The concepts deals with system in which the temperature of the system is constant With the help of this animation.

Isothermal reversible ideal gas system The concepts deals with system in which the temperature of the system is constant With the help of this animation.
Edge Detection using Laplacian of Gaussian Edge detection is a fundamental tool in image processing and computer vision. It identifies points in a digital.

Edge Detection using Laplacian of Gaussian Edge detection is a fundamental tool in image processing and computer vision. It identifies points in a digital.

Similar presentations

Ads by Google