Chapter 6 GRAPH COLORING

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Chapter 6 GRAPH COLORING A k-coloring of (the vertex set of) a graph G is a function c : V (G) {1,,..., k} such that c (u) c (v) whenever u is adjacent to v. Ifak-coloring of G exists, then G is called k-colorable. The chromatic number of G is defined as When χ (G) =k, G is called k-chromatic. χ (G) =min{k : G is k-colorable.} 6.1 Lower bounds of the chromatic number Let ω(g) be the clique number of G, that is, the maximal number of vertices in a complete subgraph of G. Obviously, we have χ(g) ω(g) (6.1) Given a k-coloring of G, the vertices being colored with the same color form an independent set. Let G be a graph with n vertices and c a k-coloring of G. We define V i = {v : c (v) =i} for i =1,,..., k. Each V i is an independent set. Let α(g) be the independence number of G, wehave V i α (G). Since we have n = V 1 + V + + V k k α (G) =χ (G) α (G), χ (G) n α (G). (6.) These bounds can be very far off. For (6.), there are graphs with n < but χ (G) α(g) arbitrarily large. (6.1) is not much better either. There are graphs with χ(g) >ω(g), for example, C 5. χ(c 5 )=and ω (C 5 )=.LetGand H be two graphs. We define the join of G and H, G H to be the graph obtained by joining every vertex in G with

2 68 Graph coloring every vertex in H. Clearly, χ (G H) =χ (G)+χ (H) and ω (G H) =ω(g)+ω(h). So χ (C 5 C 5 )=6and ω (C 5 C 5 )=. Let G 1 = C 5 C 5 and G p = G p 1 G p 1, we have χ (G 1 ) = 6,ω(G 1 )= χ (G ) = 1,ω(G )=8 χ (G ) =,ω(g )=16 χ (G p ) = p,ω(g p )= p+1 χ (G p ) ω (G p )= p The difference between χ (G) and ω (G) can be arbitrarily large. Furthermore, even when ω (G) =, we can have χ (G) arbitrarily large. When ω (G) =, G is called triangle-free Tutte s construction of triangle-free k-chromatic graphs We construct G k recursively. G = K. Let n k = G k, the number of vertices in G k. Suppose that G k 1 has been built. Let I k be an independent set of (n k 1 1) (k 1)+ 1 vertices. For every (k 1)-subset of I k,wetakeacopyofg k 1 and match the vertices in that copy to the vertices in the (k 1)-subsets. The result is G k. Example: G. Claim G k is triangle-free. Proof. Prove by induction on k. G is obviously triangle-free. Assume that G k 1 is triangle-free. No vertex in I k canbeinatriangle: Letx be a vertex in I k. All vertices that are adjacent to x are in different copies of G k 1. So no two neighbors of x are adjacent. Since there are no triangles in the copies of G k 1, there is no triangle in G k. Claim 6.1. χ (G) =k. Proof. By induction on k. Since it is easy to see that G k is k-colorable (color all the copies of G k 1 with colors 1,,..., k 1 and color the vertices in I k with color k), we only need to show that G k is not (k 1)-colorable. Suppose that G k is (k 1)- colorable and c is a (k 1)-coloring of G k. By the pigeonhole principle, there are at least n k 1 vertices that are colored with the same color. Then the copy of G k 1 must be colored with k colors. Contradiction.

3 Upper bounds Upper bounds 6..1 The greedy algorithm LettheverticesofagraphG be v 1,v,..., v n and the maximum degree of G be. For i =1,,..., n we color v i with the smallest number that is available, i.e. the number that has not been used on the vertices in {v 1,v,..., v i 1 } that are adjacent to v i. Since there are at most vertices that are adjacent to v i, this algorithm will not use more than +1colors. Therefore we have Theorem 6..1 χ(g) (G) +1 (6.) (6.) can be pretty bad. The graph K 1,p is called a star. It has (G) =p and χ (G) =. However, for a complete graph K n and an odd cycle, we have χ(g) = (G) +1. Therefore, (6.) cannot be improved in general. Theorem 6.. Suppose that in every subgraph H of G there is a vertex with degree at most δ in H. χ(g) δ +1 Proof. There is a vertex with degree at most δ in G. Label that vertex v n. There is a vertex with degree at most δ in G v n. Label that vertex v n 1. Label the vertex with degree at most δ in G {v n,v n 1 } v n. Continue to label all the vertices in G as v 1,v,..., v n. Apply the greedy algorithm according to this labeling. At each step, the vertex we are going to color is adjacent to at most δ vertices that are already colored. Therefore, δ +1colors will be enough. For a star K 1,p Theorem 6..1 provides the upper bound χ(g) p +1. Since every subgraph of K 1,p has a vertex of degree at most one, Theorem 6.. gives the upper bound χ (G). Definition 6.. A graph is called a wheel (W n ) if it is obtained by joining a new vertex to every vertex in a cycle C n. The wheel is called odd (or even) if n is odd (or even). In the figure that follows is the wheel W 7. It has maximum degree 7. All its subgraphs contain a vertex of degree at most three. Theorem 6..1 gives an upper bound χ(g) 8 and Theorem 6.. gives χ(g). Actually we can see that χ(g) =.

4 70 Graph coloring 6.. Brook s Theorem Theorem 6.. is difficult to apply in general. Another way to improve (6.) is the following theorem. Theorem 6.. (Brook s Theorem) Suppose that (G) =k. χ(g) k unless G contains a K k+1 or k =and G contains an odd cycle. Before we prove Brook s Theorem, we need some definitions about the connectivity of a graph. We denote the graph obtained fby deleting vertices v 1,v,..., v k (and all the edges that are incident to at least one of these vertices) from G as G {v 1,v,..., v k } and we write G {v} as G v. A vertex in G is called a cut-vertex if G v has more components than G. G is called -connected if G is connected and G does not contain any cut-vertex. (That is, you need to remove at least two vertices to disconnect the graph.) Similarly we say that G is k-connected if G is connected and one needs to remove at least k vertices to disconnect the graph. A maximal subgraph of G that is -connected is called a block. We can construct a block-graph B (G) for a graph G: The vertices of B (G) are the blocks and cut-vertices of G. There is an edge joining a cut-vertex with a block if the cut-vertex is in that block. In the following figure, a graph G and its block graph B (G) is shown. b f B 1 B i a g c j G d B B B 5 k h B 6 e l B B 1 g c B B 5 d B (G) B (G) is always a tree. (Why?) If a block is a leaf in B (G), wesaythatblockisan end-block. ProofofBrook stheorem: The theorem is true for k =:IfG does not contain any odd cycles, then G is bipartite therefore χ (G). Let k> bethefirstvalueof (G) such that the theorem is not true and let G be a counter example with the leastnumberofvertices. Thatis, (G) =k, χ (G) >kand every graph with less vertices than G that has maximum degree k can be coloured with k colours. Claim 1: G must be connected. Then either one of the components of G is a smaller counter example or all its components can be coloured with k colours therefore G can be coloured with k colours. Either way, there is a contradiction. Claim : G must be -connected. Suppose that G contains a cut-vertex u. Each block of G canbecolouredwithk colours. Then we can combine those k-colourings together to obtain a k-colouring of G. This is a contradiction. h B B 6

5 Planar graphs and the Four Colour Theorem 71 Claim : G must contain three vertices u 1,u and v such that u 1 is not adjacent to u ;bothu 1 and u are adjacent to v and G {u 1,u } is connected. Case 1: G is -connected. Since G is not a completed graph, there are two vertices x and y such that x is not adjacent to y. Let the shortest path from x to y be x = v 0,v 1,..., v p = y and p. Since this path is the shortest, v 0 is not adjacent to v.thenwecanchooseu 1 = v 0, u = v and v = v 1. Case : G is -connected but not -connected. There exist two vertices u and v such that G {u, v} is disconnected. Then G v contains cut-vertices (for example, the vertex u). However, there is no cut-vertex in G. Sov must be adjacent to at least one vertex in every block of G v. Letu 1 and u be two vertices in two different end-blocks of G v that are adjacent to v. The triple u 1,u and v satisfy the conditions of Claim. Then we order the vertices of G in such a way that v 1 = u 1,v = u and v n = v. v, v,..., v n 1 are ordered in such a way that if i<jthen the distance from v to v i is greater than or equal to the distance from v to v j for all i, j n 1. When we apply the greedy algorithm to G according to this ordering, v 1 and v will be coloured with colour 1. When we are colouring v i (i<n), there is at least one neighbor of v i that has not been coloured. Therefore, there is at least one colour available for v i if we have k = (G) colours. When we are colouring the last vertex v n = v, atmost 1 colours were used on the neighbors of v (since v 1 and v are coloured with the same colour), and there is at least one colour for v. This shows that G canbecolouredwithk coloursaswell. 6. Planar graphs and the Four Colour Theorem One earlier focus of graph theory is the Four Colour Problem: Given a map of countries such that every country is a continuous piece, is it always possible to use four colors to color the countries such that any two countries with a common boundary are colored with different colors? It is easy to see that three colors would not be enough and no one had found an example of map that needed more than four colors. However, no one can prove that such examples do not exist for a long time. It is until 1976 with the help of thousands hours of computer time, a proof was found Dual graphs A map can be represented by a graph such that each country is represented by a vertex and two countries share a boundary if and only if the corresponding vertices are adjacent. That graph is called a dual graph of the map. A coloring of the map satisfying the condition of the four color problem corresponding to a coloring of the vertices of the dual graph. A graph is planar if it can be drawn (or embedded)in the plane such that no two edges crossing each other. The four color problem is equivalent to If G is a planar graph, is it true that χ (G)?

6 7 Graph coloring 6.. Euler s formula We first study some properties of the planar graphs. The most important property is the Euler s formula: Let G be a connected planar graph and v, e, r the numbers of vertices, edges and regions of G respectively. v e + r =. (6.) The formula is easy to prove by induction on v. Since every region is bounded by at least three edges and an edge can be used twice in the boundaries, we have r e or Substitute this into (6.), we have Corollary 6..1 K 5 is not planar. Corollary 6.. K, is not planar. r e. v e + e v 1 e + e v 6. (6.5) (6.5) cannot be used directly to prove Corollary 6... We need a stronger version of (6.5) for bipartite graphs. Since a bipartite graph does not contain any triangles, a region is bounded by at least edges. For all bipartite graphs, we have That will imply r e r 1 e. v e + 1 e v 1 e + e v. (6.6) (6.6) implies Corollary 6... Subdividing an edge or performing an elementary subdivision of an edge uv of a graph G is the operation of deleting uv and adding a path u, w, v through a

7 Planar graphs and the Four Colour Theorem 7 new vertex w. A subdivision of G is a graph obtained from G by a sequence of elementary subdivisions, turning edges into paths through new vertices of degree. Subdividing edges does not affect planarity. Therefore any subdivision of K 5 or K 6,6 is not planar either. Kuratowski [190] proved that G is planar if and only if G contains no subdivision of K 5 or K,. However, this condition is not easy to check for large graphs. 6.. Planarity testing There are more efficient algorithms to test whether a graph G is planar. The output of these algorithm is either a drawing of G in the plane (when G is planar) or the statement that G is not planar. These algorithm all use the concept of H-bridge. If H is a subgraph of G, andh-bridge of G is either (1) an edge not in H whose endpoint are in H or () a component of G V (H) together with the edges (and vertices of attachment) that connect it to H. TheH-bridges are the pieces that must be added to an embedding of H to obtain an embedding of G. Given a cycle H in a graph G, twoh-bridges A, B conflict if they have three common vertices of attachment or if there are four vertices v 1,v,v,v in cyclic order on H such that v 1,v are vertices of attachment of A and v,v are vertices of attachment of B. In the latter case, we say the H-bridges cross. Theconflict graph of H is a graph whose vertices are the H-bridges of G, with conflicting H-bridges adjacent. Theorem 6.. (Tutte 1958) A graph G is planar if and only if for every cycle C in G, the conflict graph of C is bipartite. It is easy to see that why for a planar graph G, the conflict graph must be bipartite. In a planar embedding of G, all the H-bridges are either inside of C or outside of C. Theonesonthesamesidecannotbeconflicting. Example 6.. The conflict graph of a C 5 in K K 5 5 The conflicting graph.

8 7 Graph coloring Example 6..5 The conflict graph of a C 6 in K 6,6. x 1 y 1 x1 y1 1 1 x y y x x K, y x y Another drawing of K, The conflicting graph. There are linear-time planarity-testing algorithms due to Hopcroft and Tarjan (197) and to Booth and Luecker (1976), but these are very complicated. An earlier algorithm due to Demoucron, Malgrange and Pertuiset (196) is much simpler. It is not linear but runs in polynomial time. The idea is that if a planar embedding of H can be extended to a planar embedding of G, then in that extension every H-bridge of G appears inside a single face of H. The algorithm builds increasingly larger plane subgraphs H of G that can be extended to an embedding of G if G is planar. We want to enlarge H by making small decisions that won t lead to trouble. The basic enlargement step is the following. (1) Choose a face F that can accept an H-bridge B; a necessary condition for F to accept B is that its boundary contain all vertices of attachment of B. () Although we do not know the best way to embed B in F,eachparticularpathinB between vertices of attachment by itself has only one way to be added across F, so we add a single such path. () If there is an H-bridge that is not acceptable to any face of H, theng is not planar. Example The first subgraph H used is the cycle 1,,,, 5. Then the path, 7, 6, 5...

9 Planar graphs and the Four Colour Theorem 75 Example For the cycle 1,,,, 8, 7, 6, 5, theedges1, 7, 6 are all crossing. The graph is nonplanar. 6.. The chromatic number of a planar graph (6.5) implies that for a planar graph G, the degree sum has the upper bound deg(v) =e 6v 1. v There is a vertex with degree at most 5. Since every subgraph of a planar graph is also a planar graph, every subgraph of G has a vertex with degree at most 5. By Theorem 6.., χ (G) 6. So the six color theorem is easy to proof. With a little of more work, we can prove the five color theorem: Theorem 6..8 Every planar graph G has chromatic number at most five. Proof. Suppose that the theorem is not true. Let G be the smallest planar graph(intermsofnumberofvertices)thatcannotbecoloredwithfivecolors.let v be a vertex in G that has the minimum degree. We know that deg (v) 5. Case 1: deg (v). G v can be colored with five colors. There are at most colors have been used on the neighbors of v. There is at one color available for v. So G can be colored with five colors, a contradiction. Case : deg (v) =5.G v can be colored with five colors. If two of the neighbors of v are colored with the same color, then there is a color available for v. So we may assume that all the vertices that are adjacent to v are colored with colors 1,,,, 5 in the clockwise order. We will call these vertices v 1,v,..., v 5. Consider all the vertices being colored with colors 1 or (and all the edges among them). If this subgraph G is disconnect and v 1 and v are in different components, then we can switch the colors 1 and in the component with v 1. This will still be a 5-coloring of G v. Furthermore, v 1 is colored with color in this new 5-coloring and v is still colored with color. Color 1 would be available for v, a contradiction. Therefore v 1 and v must be in the same component in that subgraph, i.e., there is a path from v 1 to v such that every vertices on this path is colored with either color 1 or color.

10 76 Graph coloring Similarly, there is a path from v to v such that every vertices on that path has either color or color. These two paths must intersect even though they have no vertex in common. Then there must be two edges crossing each other. This contradiction concludes the proof.

UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE

UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs

Analysis of Algorithms, I

Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadth-first search (BFS) 4 Applications

CS311H. Prof: Peter Stone. Department of Computer Science The University of Texas at Austin

CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902

Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler Different Graphs, Similar Properties

Sum of Degrees of Vertices Theorem

Sum of Degrees of Vertices Theorem Theorem (Sum of Degrees of Vertices Theorem) Suppose a graph has n vertices with degrees d 1, d 2, d 3,...,d n. Add together all degrees to get a new number d 1 + d 2

Social Media Mining. Graph Essentials

Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures

Finding and counting given length cycles

Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected

Approximation Algorithms

Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer

Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

Distributed Computing over Communication Networks: Maximal Independent Set

Distributed Computing over Communication Networks: Maximal Independent Set What is a MIS? MIS An independent set (IS) of an undirected graph is a subset U of nodes such that no two nodes in U are adjacent.

On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

Total colorings of planar graphs with small maximum degree

Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong

Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

Class One: Degree Sequences

Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of

Ph.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor

Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai

Extremal Wiener Index of Trees with All Degrees Odd

MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287-292 ISSN 0340-6253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of

On planar regular graphs degree three without Hamiltonian cycles 1

On planar regular graphs degree three without Hamiltonian cycles 1 E. Grinbergs Computing Centre of Latvian State University Abstract. Necessary condition to have Hamiltonian cycle in planar graph is given.

Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

Planar Orientations with Low Out-Degree and Compaction of Adjacency Matrices

Planar Orientations with Low Out-Degree and Compaction of Adjacency Matrices Marek Chrobak David Eppstein February 25, 1989 Abstract We consider the problem of orienting the edges of a planar graph in

The Minimum Consistent Subset Cover Problem and its Applications in Data Mining

The Minimum Consistent Subset Cover Problem and its Applications in Data Mining Byron J Gao 1,2, Martin Ester 1, Jin-Yi Cai 2, Oliver Schulte 1, and Hui Xiong 3 1 School of Computing Science, Simon Fraser

Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

IE 680 Special Topics in Production Systems: Networks, Routing and Logistics*

IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti

Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )

1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the

Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

THE PROBLEM WORMS (1) WORMS (2) THE PROBLEM OF WORM PROPAGATION/PREVENTION THE MINIMUM VERTEX COVER PROBLEM

1 THE PROBLEM OF WORM PROPAGATION/PREVENTION I.E. THE MINIMUM VERTEX COVER PROBLEM Prof. Tiziana Calamoneri Network Algorithms A.y. 2014/15 2 THE PROBLEM WORMS (1)! A computer worm is a standalone malware

Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

HOLES 5.1. INTRODUCTION

HOLES 5.1. INTRODUCTION One of the major open problems in the field of art gallery theorems is to establish a theorem for polygons with holes. A polygon with holes is a polygon P enclosing several other

Graphical degree sequences and realizations

swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS - Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös

Generalized Induced Factor Problems

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2002-07. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

On the crossing number of K m,n

On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known

Graph Theory and Complex Networks: An Introduction. Chapter 06: Network analysis

Graph Theory and Complex Networks: An Introduction Maarten van Steen VU Amsterdam, Dept. Computer Science Room R4.0, steen@cs.vu.nl Chapter 06: Network analysis Version: April 8, 04 / 3 Contents Chapter

CSC 373: Algorithm Design and Analysis Lecture 16

CSC 373: Algorithm Design and Analysis Lecture 16 Allan Borodin February 25, 2013 Some materials are from Stephen Cook s IIT talk and Keven Wayne s slides. 1 / 17 Announcements and Outline Announcements

SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM

SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM ALEX WRIGHT 1. Intoduction A fixed point of a function f from a set X into itself is a point x 0 satisfying f(x 0 ) = x 0. Theorems which establish the

The Clar Structure of Fullerenes

The Clar Structure of Fullerenes Liz Hartung Massachusetts College of Liberal Arts June 12, 2013 Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, 2013 1 / 25

A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

Minimum degree condition forcing complete graph immersion

Minimum degree condition forcing complete graph immersion Matt DeVos Department of Mathematics Simon Fraser University Burnaby, B.C. V5A 1S6 Jacob Fox Department of Mathematics MIT Cambridge, MA 02139

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.

Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three

High degree graphs contain large-star factors

High degree graphs contain large-star factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a

Short Cycles make W-hard problems hard: FPT algorithms for W-hard Problems in Graphs with no short Cycles

Short Cycles make W-hard problems hard: FPT algorithms for W-hard Problems in Graphs with no short Cycles Venkatesh Raman and Saket Saurabh The Institute of Mathematical Sciences, Chennai 600 113. {vraman

Odd induced subgraphs in graphs of maximum degree three

Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing

On the maximum average degree and the incidence chromatic number of a graph

Discrete Mathematics and Theoretical Computer Science DMTCS ol. 7, 2005, 203 216 On the maximum aerage degree and the incidence chromatic number of a graph Mohammad Hosseini Dolama 1 and Eric Sopena 2

A Study of Sufficient Conditions for Hamiltonian Cycles

DeLeon 1 A Study of Sufficient Conditions for Hamiltonian Cycles Melissa DeLeon Department of Mathematics and Computer Science Seton Hall University South Orange, New Jersey 07079, U.S.A. ABSTRACT A graph

The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

Introduction to Algorithms. Part 3: P, NP Hard Problems

Introduction to Algorithms Part 3: P, NP Hard Problems 1) Polynomial Time: P and NP 2) NP-Completeness 3) Dealing with Hard Problems 4) Lower Bounds 5) Books c Wayne Goddard, Clemson University, 2004 Chapter

SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE

SHOT YLE OVES OF PHS WITH MINIMUM DEEE THEE TOMÁŠ KISE, DNIEL KÁL, END LIDIKÝ, PVEL NEJEDLÝ OET ŠÁML, ND bstract. The Shortest ycle over onjecture of lon and Tarsi asserts that the edges of every bridgeless

SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

On-line Ramsey Theory for Bounded Degree Graphs

On-line Ramsey Theory for Bounded Degree Graphs Jane Butterfield Tracy Grauman William B. Kinnersley Kevin G. Milans Christopher Stocker Douglas B. West University of Illinois Urbana IL, U.S.A. Submitted:

Optimal 3D Angular Resolution for Low-Degree Graphs

Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 17, no. 3, pp. 173 200 (2013) DOI: 10.7155/jgaa.00290 Optimal 3D Angular Resolution for Low-Degree Graphs David Eppstein 1 Maarten Löffler

ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER

Séminaire Lotharingien de Combinatoire 53 (2006), Article B53g ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER RON M. ADIN AND YUVAL ROICHMAN Abstract. For a permutation π in the symmetric group

Lecture 7: NP-Complete Problems

IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NP-Complete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit

A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

Regular Augmentations of Planar Graphs with Low Degree

Regular Augmentations of Planar Graphs with Low Degree Bachelor Thesis of Huyen Chau Nguyen At the Department of Informatics Institute of Theoretical Computer Science Reviewers: Advisors: Prof. Dr. Dorothea

Introduced by Stuart Kauffman (ca. 1986) as a tunable family of fitness landscapes.

68 Part II. Combinatorial Models can require a number of spin flips that is exponential in N (A. Haken et al. ca. 1989), and that one can in fact embed arbitrary computations in the dynamics (Orponen 1995).

BOUNDARY EDGE DOMINATION IN GRAPHS

BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 0-4874, ISSN (o) 0-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 197-04 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

MATHEMATICAL ENGINEERING TECHNICAL REPORTS. An Improved Approximation Algorithm for the Traveling Tournament Problem

MATHEMATICAL ENGINEERING TECHNICAL REPORTS An Improved Approximation Algorithm for the Traveling Tournament Problem Daisuke YAMAGUCHI, Shinji IMAHORI, Ryuhei MIYASHIRO, Tomomi MATSUI METR 2009 42 September

3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

8.1 Min Degree Spanning Tree

CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree

Misleading Stars: What Cannot Be Measured in the Internet?

Noname manuscript No. (will be inserted by the editor) Misleading Stars: What Cannot Be Measured in the Internet? Yvonne-Anne Pignolet Stefan Schmid Gilles Tredan Abstract Traceroute measurements are one

The number of generalized balanced lines

The number of generalized balanced lines David Orden Pedro Ramos Gelasio Salazar Abstract Let S be a set of r red points and b = r + 2δ blue points in general position in the plane, with δ 0. A line l

(Refer Slide Time: 01.26)

Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 27 Pigeonhole Principle In the next few lectures

Degree-associated reconstruction parameters of complete multipartite graphs and their complements

Degree-associated reconstruction parameters of complete multipartite graphs and their complements Meijie Ma, Huangping Shi, Hannah Spinoza, Douglas B. West January 23, 2014 Abstract Avertex-deleted subgraphofagraphgisacard.

Tenacity and rupture degree of permutation graphs of complete bipartite graphs

Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China

Cycle transversals in bounded degree graphs

Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.

! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.

Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of

Solutions to Homework 6

Solutions to Homework 6 Debasish Das EECS Department, Northwestern University ddas@northwestern.edu 1 Problem 5.24 We want to find light spanning trees with certain special properties. Given is one example

Asymptotically Faster Algorithms for the Parameterized face cover Problem

Asymptotically Faster Algorithms for the Parameterized face cover Problem Faisal N. Abu-Khzam 1, Henning Fernau 2 and Michael A. Langston 3 1 Division of Computer Science and Mathematics, Lebanese American

1 Definitions. Supplementary Material for: Digraphs. Concept graphs

Supplementary Material for: van Rooij, I., Evans, P., Müller, M., Gedge, J. & Wareham, T. (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping.

Non-Separable Detachments of Graphs

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2001-12. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

Global secure sets of trees and grid-like graphs. Yiu Yu Ho

Global secure sets of trees and grid-like graphs by Yiu Yu Ho B.S. University of Central Florida, 2006 M.S. University of Central Florida, 2010 A dissertation submitted in partial fulfillment of the requirements

Network Metrics, Planar Graphs, and Software Tools. Based on materials by Lala Adamic, UMichigan

Network Metrics, Planar Graphs, and Software Tools Based on materials by Lala Adamic, UMichigan Network Metrics: Bowtie Model of the Web n The Web is a directed graph: n webpages link to other webpages

CSC2420 Fall 2012: Algorithm Design, Analysis and Theory

CSC2420 Fall 2012: Algorithm Design, Analysis and Theory Allan Borodin November 15, 2012; Lecture 10 1 / 27 Randomized online bipartite matching and the adwords problem. We briefly return to online algorithms

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

1. Nondeterministically guess a solution (called a certificate) 2. Check whether the solution solves the problem (called verification)

Some N P problems Computer scientists have studied many N P problems, that is, problems that can be solved nondeterministically in polynomial time. Traditionally complexity question are studied as languages:

Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one

x 2 f 2 e 1 e 4 e 3 e 2 q f 4 x 4 f 3 x 3

Karl-Franzens-Universitat Graz & Technische Universitat Graz SPEZIALFORSCHUNGSBEREICH F 003 OPTIMIERUNG und KONTROLLE Projektbereich DISKRETE OPTIMIERUNG O. Aichholzer F. Aurenhammer R. Hainz New Results

The Independence Number in Graphs of Maximum Degree Three

The Independence Number in Graphs of Maximum Degree Three Jochen Harant 1 Michael A. Henning 2 Dieter Rautenbach 1 and Ingo Schiermeyer 3 1 Institut für Mathematik, TU Ilmenau, Postfach 100565, D-98684

ONLINE VERTEX COLORINGS OF RANDOM GRAPHS WITHOUT MONOCHROMATIC SUBGRAPHS

ONLINE VERTEX COLORINGS OF RANDOM GRAPHS WITHOUT MONOCHROMATIC SUBGRAPHS MARTIN MARCINISZYN AND RETO SPÖHEL Abstract. Consider the following generalized notion of graph colorings: a vertex coloring of

Permutation Betting Markets: Singleton Betting with Extra Information

Permutation Betting Markets: Singleton Betting with Extra Information Mohammad Ghodsi Sharif University of Technology ghodsi@sharif.edu Hamid Mahini Sharif University of Technology mahini@ce.sharif.edu

GENERATING LOW-DEGREE 2-SPANNERS

SIAM J. COMPUT. c 1998 Society for Industrial and Applied Mathematics Vol. 27, No. 5, pp. 1438 1456, October 1998 013 GENERATING LOW-DEGREE 2-SPANNERS GUY KORTSARZ AND DAVID PELEG Abstract. A k-spanner

Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique

[2], [3], which realize a time bound of O(n. e(c + 1)).

SIAM J. COMPUT. Vol. 4, No. 1, March 1975 FINDING ALL THE ELEMENTARY CIRCUITS OF A DIRECTED GRAPH* DONALD B. JOHNSON Abstract. An algorithm is presented which finds all the elementary circuits-of a directed

ON THE COMPLEXITY OF THE GAME OF SET. {kamalika,pbg,dratajcz,hoeteck}@cs.berkeley.edu

ON THE COMPLEXITY OF THE GAME OF SET KAMALIKA CHAUDHURI, BRIGHTEN GODFREY, DAVID RATAJCZAK, AND HOETECK WEE {kamalika,pbg,dratajcz,hoeteck}@cs.berkeley.edu ABSTRACT. Set R is a card game played with a

Semi-Matchings for Bipartite Graphs and Load Balancing

Semi-Matchings for Bipartite Graphs and Load Balancing Nicholas J. A. Harvey Richard E. Ladner László Lovász Tami Tamir Abstract We consider the problem of fairly matching the left-hand vertices of a bipartite

Graph Theory: Penn State Math 485 Lecture Notes. Christopher Griffin 2011-2012

Graph Theory: Penn State Math 485 Lecture Notes Version 1.4..1 Christopher Griffin 011-01 Licensed under a Creative Commons Attribution-Noncommercial-Share Alike.0 United States License With Contributions

Network/Graph Theory. What is a Network? What is network theory? Graph-based representations. Friendship Network. What makes a problem graph-like?

What is a Network? Network/Graph Theory Network = graph Informally a graph is a set of nodes joined by a set of lines or arrows. 1 1 2 3 2 3 4 5 6 4 5 6 Graph-based representations Representing a problem

Tree-representation of set families and applications to combinatorial decompositions

Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no

Figure 2.1: Center of mass of four points.

Chapter 2 Bézier curves are named after their inventor, Dr. Pierre Bézier. Bézier was an engineer with the Renault car company and set out in the early 196 s to develop a curve formulation which would

Competitive Analysis of On line Randomized Call Control in Cellular Networks

Competitive Analysis of On line Randomized Call Control in Cellular Networks Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou Abstract In this paper we address an important communication issue arising

On three zero-sum Ramsey-type problems

On three zero-sum Ramsey-type problems Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel and Yair Caro Department of Mathematics

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 Cristina Bazgan a and Zsolt Tuza b,c,d a LAMSADE, Université Paris-Dauphine, Place du Marechal de Lattre de Tassigny, F-75775 Paris

Ramsey numbers for bipartite graphs with small bandwidth

Ramsey numbers for bipartite graphs with small bandwidth Guilherme O. Mota 1,, Gábor N. Sárközy 2,, Mathias Schacht 3,, and Anusch Taraz 4, 1 Instituto de Matemática e Estatística, Universidade de São

On-line choosability. Grzegorz Gutowski

Theoretical Computer Science Department Faculty of Mathematics and Computer Science Jagiellonian University On-line choosability Grzegorz Gutowski grzegorz.gutowski@tcs.uj.edu.pl Ph.D. Thesis Adviser: