Kára-Pór-Wood conjecture Big Line or Big Clique in Planar Point Sets Jozef Jirasek

Slides:



Advertisements
Similar presentations
CS 336 March 19, 2012 Tandy Warnow.
Advertisements

Great Theoretical Ideas in Computer Science for Some.
Review for CS1050. Review Questions Without using truth tables, prove that  (p  q)   q is a tautology. Prove that the sum of an even integer and an.
Solving IPs – Cutting Plane Algorithm General Idea: Begin by solving the LP relaxation of the IP problem. If the LP relaxation results in an integer solution,
Computer Graphics1 Geometry Area of polygons & Volume Of Polygonal surfaces.
Mathematical induction Isaac Fung. Announcement ► Homework 1 released ► Due on 6 Oct 2008 (in class)
Bayesian Networks, Winter Yoav Haimovitch & Ariel Raviv 1.
Transformations We want to be able to make changes to the image larger/smaller rotate move This can be efficiently achieved through mathematical operations.
Minimal Matchstick Graphs With Small Degree Sets Erich Friedman Stetson University 1/25/06.
7th Grade Math Mean, Median, and Range Obj. 5b.
Problems in Ramsey theory typically ask a question of the form: "how many elements of some structure must there be to guarantee that a particular property.
Applied Combinatorics, 4th Ed. Alan Tucker
CPSC 121: Models of Computation
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
Online Graph Avoidance Games in Random Graphs Reto Spöhel Diploma Thesis Supervisors: Martin Marciniszyn, Angelika Steger.
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.
What is the best way to start? 1.Plug in n = 1. 2.Factor 6n 2 + 5n Let n be an integer. 4.Let n be an odd integer. 5.Let 6n 2 + 5n + 4 be an odd.
Multicolored Subgraphs in an Edge Colored Graph Hung-Lin Fu Department of Applied Mathematics NCTU, Hsin Chu, Taiwan
Chapter 10 Sequences, Induction, and Probability Copyright © 2014, 2010, 2007 Pearson Education, Inc Mathematical Induction.
What is the next line of the proof? a). Assume the theorem holds for all graphs with k edges. b). Let G be a graph with k edges. c). Assume the theorem.
Mathematical Induction
Adding and Subtracting Integers.
REMEMBER: A number can be negative or positive as shown in the number line below: Negative Numbers (-) Positive Numbers (+)
ADDING INTEGERS Positive + Positive = Positive Positive + Positive = Positive ( +3) + (+2) = +5 ( +3) + (+2) = +5 When a number is positive, you do not.
Addition and Subtraction of Integers
Easy Adding and subtracting using number bonds Mental Maths Learning Objectives I will be able to rapidly say all my number bonds to 10.
RMIT University; Taylor's College1 Lecture 6  To apply the Principle of Mathematical Induction  To solve the Towers of Hanoi puzzle  To define a recurrence.
Maths - Subtracting. Subtracting is simple. It is the opposite of adding. For example: 3 – 2 =___.
A BC D Let ABCD be a quadrilateral. Join AC. Clearly, ∠ 1 + ∠ 2 = ∠ A (i) And, ∠ 3 + ∠ 4 = ∠ C (ii) We know that the sum of the angles.
Integer Operations. 1) What’s the rule for adding integers? *If both addends are Positive: - Add together and the sum is positive (Ex = 12) *If.
Stephane Durocher 1 Debajyoti Mondal 1 Md. Saidur Rahman 2 1 Department of Computer Science, University of Manitoba 2 Department of Computer Science &
16 VECTOR CALCULUS.
Arrangements and Duality Sanjay Sthapit Comp290 10/6/98.
8.1 8 Algorithms Foundations of Computer Science  Cengage Learning.
CS Lecture 26 Monochrome Despite Himself. Pigeonhole Principle: If we put n+1 pigeons into n holes, some hole must receive at least 2 pigeons.
Prime and Composite Numbers Factors What is a prime number? Is this number prime?
Adding two numbers together which have the same absolute value but are opposite in sign results in a value of zero. This same principle can be applied.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 9 Line Arrangements.
Activity 1-12 : Multiple-free sets
Section 5.1. Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach a particular.
 Ramsey Theory CS494 Into to Graph Theory By: Travis Young.
Factoring an Integer My favorite way of factoring an integer is by using a Factor Tree Shown below is a simple problem, factoring the number
Triangle Inequality Theorem The sum of the lengths of any two sides of a triangle is greater than the length of the third side.
DVD Menu Diary! FOR Grown Ups 2. Plan Choose images, that I’m going to use. (mood board) Pick a colour scheme from those images and existing Grown up.
Adding and Subtracting Integers Objectives: SWBAT add or subtract two integers and give the answer the correct sign. SWBAT simplify numbers that have two.
More NP-complete problems
Monochrome Despite Himself
Adding and Subtracting Integers
Interesting Integers!.
Triangle Inequalities
Adding integers.
What is the next line of the proof?
Tucker, Applied Combinatorics, Sec 2.4
Objective: Be able to add and subtract directed numbers.
Using Rules to Subtract Integers
INTEGER RULES Positives & negatives.
1.2 Exploring the Validity of Conjectures
CS 220: Discrete Structures and their Applications
Adding and Subtracting Integers.
Lesson #17: Adding Integers
INTEGER RULES Positives & negatives.
Adding Integers Chp 2.2.
Multicolored Subgraphs in an Edge Colored Graph
Subtracting Integers Sec 2.3 pg
Mathematical Induction
Clustering.
Objective: Be able to add and subtract directed numbers.
Quick Review and Warm-Up You can copy for notes if needed.
Chapter 2-2 Adding Integers
11.4 Mathematical Induction
Presentation transcript:

Kára-Pór-Wood conjecture Big Line or Big Clique in Planar Point Sets Jozef Jirasek

The Problem Given two integers k, l Show that if we have “enough” points in the plane, then there are either: k points which can “see” each other l points which all lie on a single line or There exists an integer N( k, l ), such that for any n ≥ N, every arrangement of n points contains either: enough

l = 3(three points on a line) –set N = k, from n ≥ N points pick any k. –if they can see each other, we are done. –if two of them can not see each other, –we get a line with 3 points! Simple cases

k = 3(3 points which see each other) –set N = l, let n ≥ N. –if all n points lie on a line, we are done. –otherwise, pick the smallest triangle. if two points can not see each other, the triangle was not the smallest! –therefore, three points of the smallest triangle must be able to see each other!

Proof by Induction? N(3, l ) = l (pick the smallest triangle) For larger k : Select N( k – 1, l ) points Find either: –l points on a line, or –k – 1 points “seeing” each other Find another point which “sees” all the k – 1 points

Will not work! Given k – 1 points which see each other, we can add an arbitrary number of points, such that: – no l points lie on a single line, and – no added point sees all the k – 1 points!

Known results Easy for k ≤ 3 or l ≤ 3 (as shown here). Kára, Pór, Wood: k ≤ 4, all l. Addario-Berry et al.: k = 5, l = 4. Abel et al.: k = 5, all l. Questions? Ideas?