Edge-Coloring Geometric Graphs (Problem 75) (http://maven.smith.edu/~orourke/TOPP/P75.html#Problem.75)

Slides:



Advertisements
Similar presentations
Iterative Rounding and Iterative Relaxation
Advertisements

Directed acyclic graphs with the unique dipath property J.-C. Bermond, M. Cosnard, S. Perennes Inria and CNRS 24 Nov Disco Workshop - Valparaiso.
 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.
Convex Partitions with 2-Edge Connected Dual Graphs Marwan Al-JubehMichael Hoffmann Diane L. SouvaineCsaba D. Toth 15th International Computing and Combinatorics.
Bichromatic Separating Circles. Problem Given two sets of points, R and B ∈ R ² where | R | = n and | B | = m: – Find the smallest circle containing all.
Shakhar Smorodinsky Courant Institute, New-York University (NYU) On the Chromatic Number of Some Geometric Hypergraphs.
Feb Polygon Triangulation Shmuel Wimer Bar Ilan Univ., School of Engineering.
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.
Incidences and Many Faces via cuttings Sivanne Goldfarb
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 Polygon Triangulation Motivation: Guarding art galleries Art gallery theorem.
Stephane Durocher 1 Debajyoti Mondal 1 Rahnuma Islam Nishat 2 Sue Whitesides 2 1 Department of Computer Science, University of Manitoba 2 Department of.
Convex Grid Drawings of 3-Connected Plane Graphs Erik van de Pol.
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.
Computational Geometry Seminar Lecture 1
Lecture 3: Polygon Triangulation Computational Geometry Prof. Dr. Th. Ottmann Polygon Triangulation Motivation: Guarding art galleries Art gallery theorem.
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
On The Achromatic Number Problem Guy Kortsarz Rutgers University, Camden.
On Neighbors in Geometric Permutations Shakhar Smorodinsky Tel-Aviv University Joint work with Micha Sharir.
K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.
Jordan Curve Theorem A simple closed curve cuts its interior from its exterior.
Art Gallery Theorem Computational Geometry, WS 2006/07 Lecture 8, Part 1 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
Packing Element-Disjoint Steiner Trees Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint with Joseph Cheriyan Department.
K-Coloring k-coloring: A k-coloring of a graph G is a labeling f: V(G)  S, where |S|=k. The labels are colors; the vertices of one color form a color.
The Art Gallery Problem
Geometric Representations of Graphs A survey of recent results and problems Jan Kratochvíl, Prague.
Graph Theory Chapter 6 Planar Graphs Ch. 6. Planar Graphs.
Approximating Minimum Bounded Degree Spanning Tree (MBDST) Mohit Singh and Lap Chi Lau “Approximating Minimum Bounded DegreeApproximating Minimum Bounded.
On the union of cylinders in 3-space Esther Ezra Duke University.
Trees and Distance. 2.1 Basic properties Acyclic : a graph with no cycle Forest : acyclic graph Tree : connected acyclic graph Leaf : a vertex of degree.
Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs Kazuyuki Miura, Machiko Azuma and Takao Nishizeki title.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Arrangements and Duality.
V Spanning Trees Spanning Trees v Minimum Spanning Trees Minimum Spanning Trees v Kruskal’s Algorithm v Example Example v Planar Graphs Planar Graphs v.
1 The number of orientations having no fixed tournament Noga Alon Raphael Yuster.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Arrangements and Duality.
Introduction to Graph Theory
Graph.
Connectivity and Paths 報告人:林清池. Connectivity A separating set of a graph G is a set such that G-S has more than one component. The connectivity of G,
Beyond planarity of graphs Eyal Ackerman University of Haifa and Oranim College.
2-6 Proving Angles Congruent. Theorem: a conjecture or statement that you prove true.
More on graph drawings other representations Alex Sludnikov Seminar in Computational Geometry.
Introduction to Graph Theory
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.
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Trees Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Various Orders and Drawings of Plane Graphs Takao Nishizeki Tohoku University.
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Planarity Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering, IIT.
Eternal Domination Chip Klostermeyer.
CCCG 2014 August 11, 2014 Department of Computer Science University of Manitoba Stephane Durocher Debajyoti Mondal.
Polygon Triangulation
MCA 520: Graph Theory Instructor Neelima Gupta
Adversarial Coloring, Covering and Domination Chip Klostermeyer.
Discrete Mathematics Graph: Planar Graph Yuan Luo
Drawing Plane Triangulations with Few Segments
Proof technique (pigeonhole principle)
Great Theoretical Ideas In Computer Science
Geometric Graphs and Quasi-Planar Graphs
Rainbow cycles in flip graphs
Tucker, Applied Combinatorics, Sec 2.4
The Art Gallery Problem
The Art Gallery Problem
Trees.
Miniconference on the Mathematics of Computation
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Planarity.
Existence of 3-factors in Star-free Graphs with High Connectivity
Simple Graphs: Connectedness, Trees
Game chromatic number of graphs
Presentation transcript:

Edge-Coloring Geometric Graphs (Problem 75) (

Statement For a set of n points in the plane in general position, draw a straight segment between every pair of points. What is the minimum number of colors that suffice to color the edges such that no two edges that cross have the same color? It has been conjectured that (1 – ε)*n is an upper bound for some ε > 0.

Approaching The Problem Even Complete Graphs [n = 2x] Does every such graph have a partition of its edge set into plane spanning trees? The complete graph of n vertices has edges A spanning tree has edges, so can have trees (lower bound) Then color each spanning tree a separate color n = 6, complete graph 3 spanning trees

Approaching The Problem Convex Graphs – a geometric graph with the vertices in convex position Partition the graph into spanning caterpillar trees. A caterpillar is a tree such that deleting its leaves and leaf edges leaves a path.

Approaching The Problem What about a general complete even graph? Sufficient Condition: partition graph into spanning double stars. Double Star – A graph with at most two non-leaf vertices. Proof – in fig.8, assume a circle C and set of lines L, s.t. pts. of graph lie in the interior of C, s.t. only one pt. in each partition of C by L => can make spanning double star:

Generalizations Graphs with arbitrary no. of vertices Using non-spanning trees Every complete graph with k crossings can be partitioned into (n-k) plane trees.[lemma-14, [2]] Aronov et al. [3] proved that every complete geometric graph K n has at least √n/12 pairwise crossing edges (called a crossing family).  (n - √n/12) plane trees Is there an > 0, such that every complete geometric graph K n can be partitioned into at most (1 − )n plane subgraphs?

References G. Araujo, Adrian Gumitrescu, Ferran Hurtado, M. Noy, and J. Urrutia, “On the chromatic number of some geometric type Kneser graphs.” Comput. Geom. Theory Appl., 32(1):59-69, Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, and David R. Wood, “Partitions of complete geometric graphs into plane trees.” Comput. Geom. Theory Appl., 34(2): , B. Arronov, P. Erds, W. Goddard, D. J. Kleitman, M. Klugerman, J. Pach, and L. J. Schulman, “Crossing Families.” Combinatorica 14 (1994), ;