Connectivity, Graph Minors, and Subgraph Multiplicity

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Connectivity, Graph Minors, and Subgraph Multiplicity David Eppstein Department of Information and Computer Science University of California, Irvine, CA January 5, 1993 Abstract It is well known that any planar graph contains at most O(n) complete subgraphs. We extend this to an exact characterization: G occurs O(n) times as a subgraph of any planar graph, if and only if G is three-connected. We generalize these results to similarly characterize certain other minor-closed families of graphs; in particular, G occurs O(n) times as a subgraph of the K b,c -free graphs, b c and c 4, iff G is c-connected. Our results use a simple Ramsey-theoretic lemma that may be of independent interest. 1 Introduction It follows from the sparsity of planar graphs that each such graph contains at most O(n) complete subgraphs K 3 and K 4 [6]. All cliques in a planar graph can be listed by an algorithm with O(n) worst-case time complexity [3, 4, 6]. Enumeration of subgraphs has a number of uses, including a recent application in testing inscribability [5]. These results naturally raise the question of determining which other planar graphs occur O(n) times as subgraphs of planar graphs. A necessary condition is that the subgraph G be 3-connected: otherwise, G can be split into two parts A and B by a separating pair of vertices, and by connecting many copies of A and B at the same two vertices, we find a family of planar graphs in which G occurs Ω(n 2 ) times as a subgraph. Our main result is that this is also a sufficient condition. Every threeconnected planar graph can only occur O(n) times as a subgraph of other planar graphs. 1

2 We extend this to minor-closed families of graphs. As is well known, the planar graphs are exactly those for which neither K 3,3 nor K 5 is a minor. We first investigate graphs for which some complete bipartite graph K b,c (with b c and c 4) is not a minor. We show that the subgraphs occurring O(n) times in this family of graphs are exactly the c-connected graphs. We extend this to other minor-closed families of graphs where some complete bipartite graph is excluded. Our main result for planar graphs appears as a corollary of this generalization. Our proofs use a simple Ramsey-theoretic lemma that may be of independent interest. In English, it states that if a set is formed as the union of a large number of k-tuples, then we can find a smaller set of tuples for which each member of the set always appears in the same tuple position. In the language of graph theory, if many copies of a subgraph occur in a larger graph, we can find a smaller number of copies of the subgraph, so that among those copies each vertex of the larger graph appears in only one way as a vertex of the subgraph. Finally, we discuss algorithmic enumeration of subgraphs. In some cases, we are able to make our results constructive, so that the copies of a given subgraph can be enumerated in O(n) time, matching the previous results for cliques in planar graphs. 2 A Ramsey-theoretic lemma Given a set S, denote the ordered k-tuples of members of S by S k. We do not allow any tuple to contain the same element in more than one position. Each tuple can be interpreted as a function from the integers 1... k onto the set S, such that for any tuple t, and 1 i < j k, t(i) t(j). Suppose we have a collection T of k-tuples, T S k. We say T is coherent if each member of S appears in at most a single position of the k-tuples. In other words, for any distinct tuples t and t, and for all integers 1 i < i k, t(i) t (i ). As we now show, any set of tuples has a large coherent subset. Lemma 1. Suppose we are given a set T containing at least k! 2 m k k-tuples. Then there is a coherent subset T T containing at least m tuples. Proof. We use induction on k. Any set of 1-tuples is coherent. First assume some element x S is contained in at least k! 2 m k 1 /k of the k-tuples. Then there is a collection of (k 1)! 2 m k 1 of those tuples for which x always appears in some particular position, say position k. By 2

3 ignoring this shared position, we construct a collection of (k 1)-tuples which by induction must have a coherent subcollection of size m. Restoring the shared positions gives our coherent subset T. Otherwise, each element is in fewer than k! 2 m k 1 /k of the tuples. Then we can repeatedly pick a tuple t, add it to T, and throw away the tuples that have an element in common with t. By the time we run out of tuples to pick, we will have added m tuples to T. 3 Complete bipartite minors We first show that not too many copies of a highly connected subgraph can share the same low-degree vertex, unless the graph contains a large complete bipartite graph as a minor. The bound on the number of times the subgraph can occur will then follow from the sparseness of minor-free graphs. Lemma 2. Let G be a c-connected graph with k vertices. Suppose that k! 2 b k2 d ck2 copies of G are subgraphs of some larger graph H, and that some vertex x (with degree d in H) is contained in each of these copies of G. Then H contains a complete bipartite graph K b,c as a minor. Proof. By Lemma 1, we can find b k d ck copies of G such that each vertex of H is used in at most one way as a vertex of G. We throw away the remaining copies of G. We now have a one-to-many correspondence between the vertices of G and those of H. Suppose each vertex of G corresponds to fewer than bd c different vertices of H. Each copy of G could then be found by choosing one such vertex of H for each of the k vertices of G, so there would be fewer than (bd c ) k possible copies of G in the coherent set, a contradiction. Therefore we ) (b 1) + 1 < bd c can find some vertex y of G that corresponds to at least ( d c vertices of H. Since G is c-connected, we can find c vertex-disjoint paths in G from y to x. Partition the remaining copies of G into equivalence classes according to the edges in H adjacent to x used by these paths. There are ( d c) such classes, so some class uses at least b copies of vertex y. Unless b = 1, y will not be adjacent to x in G; if b = 1 the lemma is trivially solved by the neighbors of any vertex. We select the copies of G in this class, and throw away the remaining copies. We then form a minor of H by removing all edges not corresponding to portions of these vertex-disjoint paths, and contracting all remaining edges except those adjacent to x or to copies of y. Because the paths are 3

4 vertex-disjoint in G, and because we have selected a coherent collection of subgraphs, the images of the paths in H are also vertex-disjoint. Thus the contraction process described above finds a minor in which x is connected to c vertices, which are also each connected to b 1 copies of y. This gives us K b,c as a minor of H. Theorem 1. Let F b,c be the family of graphs in which K b,c does not occur as a minor, and let G F b,c be c-connected. Then there is some constant κ = κ(g) such that, for any n-vertex graph H F b,c, there can be at most κn copies of G as a subgraph in H. Proof. Since F b,c is a minor-free family of graphs, the graphs in F b,c are sparse (any such graph has O(n) edges). Thus we can find a vertex x in H which has degree at most some constant d = O(1). By Lemma 2, there are at most O(1) copies of G as a subgraph of H containing vertex x. Let κ denote this number of copies. Then by induction there are at most κ(n 1) copies of G in the graph H formed by removing x from H. Thus there are at most κn copies in all. 4 Other forbidden minors We have shown that c-connected graphs cannot occur more than linearly within the K b,c -free graphs. We now show that for small c this is an exact characterization: graphs with smaller connectivity will always be able to occur more than a linear number of times. We also generalize this characterization to some other minor-closed families of graphs. Theorem 2. Let S be a set of c-connected graphs containing some complete bipartite graph K b,c, with b c and c 3. Denote by F S the family of graphs not containing any member of S as a minor. Then a graph G F S occurs O(n) times as a subgraph of members of F S if and only if G is c-connected. Proof. If G is c-connected, the result follows from Theorem 1 and the fact that F S is a subset of F b,c. If G is in F S but not c-connected, it can be separated by some (c 1)-tuple of vertices. Let A and B be two components of the separated graph. Then we can form a family of graphs in which G occurs Ω(n 2 ) times, by connecting many copies of A and B, together with a single copy of G A B, to the same (c 1)-tuple. We now show that no such graph G contains a minor in S. 4

5 We assume for a contradiction that such a minor, M, exists. M is formed by contracting certain connected sets of vertices in G, and then possibly removing some edges. First note that no two such sets can be entirely contained within components of G on different sides of the separating (c 1)- tuple, since the two corresponding vertices in K b,c would then be separated by a cut of at most (c 1) vertices. So all vertices in the K b,c minor come from sets containing at least one vertex in some particular component C of G. At most (c 1) 2 vertices in M can come from sets involving points outside that component, because each such set must include a vertex in the separating (c 1)-tuple. So the portion of G outside C can only contribute a single edge in M, connecting those two vertices. But that same edge can be found in G by contracting one of components A and B (whichever is not equal to C), so G also contains M as a minor, contradicting the assumption that G is in F S. Corollary 1. An outerplanar graph G occurs O(n) times as a subgraph of all outerplanar graphs if and only if G is biconnected. Proof. Apply Theorem 2, with S = {K 2,3, K 4 }. Corollary 2. A planar graph G occurs O(n) times as a subgraph of all planar graphs if and only if G is 3-connected. Proof. Apply Theorem 2, with S = {K 3,3, K 5 }. We can extend the theorem to a more restricted class of K b,4 -free graph families: Theorem 3. Let S be a set of triangle-free 4-connected graphs containing some complete bipartite graph K b,4, with b 4. Denote by F S the family of graphs not containing any member of S as a minor. Then a graph G F S occurs O(n) times as a subgraph of members of F S if and only if G is 4- connected. Proof. Sufficiency follows from Theorem 1. For necessity, we follow the previous proof: we assume G has a separating 3-tuple, and repeat certain components around this tuple to construct a family of graphs G in which G occurs Ω(n 2 ) times. Let M be a triangle-free minor of some such graph G. As before, all vertices of M come from sets involving a single component C of G, and at most three can cross the separating 3-tuple. Then since M is triangle-free, one of the three vertices is adjacent to all edges among the three. By collapsing all of G outside of C into that one vertex, we find M as a minor in G as well as in G, so M cannot be in S. 5

6 Unfortunately the same proof technique runs into trouble for K b,5 -free graphs: there are graphs containing no K 5,5 -minor, yet having a separating 4-tuple for which any repetition of components as above would form a K 5,5 - minor. 5 Algorithms We now discuss algorithms for enumerating the occurrences of a given subgraph. Clearly, for any fixed subgraph G, there is a polynomial time algorithm for enumerating its occurrences: if there are k vertices in G, simply test all ( n k) = O(n k ) possible choises for those vertices. We are interested in situations in which the occurrences can be listed more efficiently, in linear time (matching our bounds on the occurrences of G). Such algorithms were already known for enumerating copies of the complete graphs K 3 and K 4 as subgraphs of planar graphs. More generally, in any family of graphs with bounded arboricity, all clique subgraphs can be listed in linear time [3, 4]. The family of K 1,b -free graphs is also relatively easy. Since these graphs have maximum vertex degree b 1, there are fewer than b k = O(1) vertices within distance k of any given vertex. The occurrences of any connected subgraph G can therefore be enumerated in time O(n). The first interesting cases are the families of K 2,b -free graphs. Theorem 1 shows that in any such family, the subgraphs appearing O(n) times are the biconnected graphs. The biconnected K 2,2 -free graphs are simply the triangles, which can be enumerated using the clique algorithms cited above. We next consider K 2,3 -free graphs. The biconnected components of these graphs are either outerplanar graphs, or copies of K 4. Thus we can enumerate any biconnected subgraph of such a graph, if only we can do so for outerplanar graphs. Theorem 4. Let G be biconnected. Then there is a linear-time algorithm which enumerates the occurrences of G in any outerplanar graph. Proof. Any biconnected outerplanar graph is Hamiltonian, and adding extra edges to a graph only makes it easier to enumerate its occurrences, so we can assume without loss of generality that G is a simple cycle C k. Let H be an outerplanar graph with n vertices, for which we are to enumerate the occurrences of G as a subgraph. Any occurrence of G consists of the vertices in a union of facial cycles of H. To find an occurrence of G, we proceed as follows. We start by choosing 6

7 a single facial cycle in H. Then as long as the current subgraph is a cycle shorter than G, we choose an edge of the subgraph and replace it by the adjacent facial cycle. There are at most k edges to be replaced at each step, and each step increases the cycle length by at least one, so there are O(k k ) ways to augment the initially chosen cycle into an occurrence of G. Thus the total time to enumerate the occurrences of G is O(k k n) = O(n). Corollary 3. Let G be biconnected. Then there is a linear-time algorithm which enumerates the occurrences of G in any K 2,3 -free graph. Corollary 4. Let G be a wheel W k. Then there is a linear-time algorithm which enumerates the occurrences of G in any K 1,2,3 -free graph, and in particular in any K 3,3 -free or planar graph. Proof. W k consists of a single hub vertex connected to each vertex of a cycle C k. Let H be a K 1,2,3 -free graph. We independently enumerate, for each vertex x of H, the occurrences of W k for which x corresponds to the hub. This can be done by finding all occurrences of C k in the neighbors of x. But the induced graph of these neighbors must be K 2,3 -free, as any K 2,3 minor together with the hub vertex would form a K 1,2,3 in the original graph. So by Corollary 3 we can find all such occurrences in time linear in the number of neighbors. The time to find all occurrences of W k is proportional to the sum of the degrees of each vertex of H, which is O(n). This result generalizes the enumeration of cliques in planar graphs, since the only such cliques that can occur are K 3 and K 4, which can alternately be interpreted as wheels W 2 and W 3. We would like to be able to extend our results further, at least to the enumeration of all 3-connected planar subgraphs. We have been unable to achieve such a result. However Corollary 4 is promising, as wheels figure prominently in Tutte s characterization of triconnected graphs [7]. 6 Conclusions We have described a number of circumstances in which some subgraph occurs O(n) times in the graphs of a minor-closed family. We have also described algorithms that, in a more limited class of situations, can efficiently enumerate the occurrences of a given subgraph. A number of directions for possible generalization suggest themselves. First, we would like to extend our algorithms so that we can enumerate 7

8 the occurrences of a subgraph G whenever G is guaranteed to have O(n) occurrences. This would entail a new, constructive proof of Theorem 1. Second, we would like to characterize the subgraphs occurring few times in minor-closed families other than those described in Theorem 2. In particular, the forbidden minors for graphs of bounded genus include graphs that are not 3-connected, so our characterization does not apply to these families. We would also like to know what happens when some K b,c is excluded for b, c 5. Third, perhaps we should investigate families of graphs that are not closed under minors. Any family of sparse graphs (more precisely, graphs with bounded arboricity) will contain only O(n) cliques. But perhaps some other subgraphs occur few times. For instance, what are the subgraphs occurring few times in the k-page graphs [2]? Finally, it might be interesting to characterize graphs occurring a number of times which is a non-linear function of n. For the families for which Theorem 2 applies, we can demonstrate a gap in the possible such functions: any subgraph G occurs Ω(n) times, and the theorem tells us that G either occurs O(n) or Ω(n 2 ) times. For other families, there may be graphs that occur only O(1) times (indeed, if F excludes a minor consisting of k disjoint copies of G, then G occurs at most k 1 times in graphs of family F ). If G is a tree with k leaves (other than a single edge), then it occurs Θ(n k ) times as a subgraph in other trees. Perhaps for planar graphs, a similar characterization can be described in terms of the tree of triconnected components. For sparse graphs (graphs with O(n) edges) there can be at most O(n 3/2 ) triangles [1], and more generally O(n c/2 ) complete subgraphs K c. Are there minor-closed families, and subgraphs in those families, such that the function describing the number of occurrences is similarly nonpolynomial? References [1] M. Bern and D. Eppstein. Mesh generation and optimal triangulation. Euclidean Geometry and Computers, D.A. Du and F.K. Hwang, eds., World Scientific, [2] F. Bernhart and B. Kainen. The book thickness of a graph. J. Combinatorial Theory, Ser. B 27 (1979) [3] N. Chiba and T. Nishizeki. Arboricity and subgraph listing algorithms. SIAM J. on Computing 14 (1985)

9 [4] M. Chrobak and D. Eppstein. Planar orientations with low out-degree and compaction of adjacency matrices. Theoretical Computer Science 86 (1991) [5] M.B. Dillencourt and W.D. Smith. A linear-time algorithm for testing the inscribability of trivalent polyhedra. Proc. 8th ACM Symposium on Computational Geometry (1992) [6] C. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters 13 (1981) [7] W.T. Tutte. A theory of 3-connected graphs. Proc. Koninklijke Nederlandse Akademie van Wetenschappen, Ser. A 64 (1961)

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

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

Small Maximal Independent Sets and Faster Exact Graph Coloring

Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science The Exact Graph Coloring Problem: Given an undirected

A Note on Maximum Independent Sets in Rectangle Intersection Graphs

A Note on Maximum Independent Sets in Rectangle Intersection Graphs Timothy M. Chan School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1, Canada tmchan@uwaterloo.ca September 12,

Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

arxiv: v2 [math.co] 30 Nov 2015

PLANAR GRAPH IS ON FIRE PRZEMYSŁAW GORDINOWICZ arxiv:1311.1158v [math.co] 30 Nov 015 Abstract. Let G be any connected graph on n vertices, n. Let k be any positive integer. Suppose that a fire breaks out

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

Introduction to Graph Theory

Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

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.

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:

1 The Line vs Point Test

6.875 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Low Degree Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz Having seen a probabilistic verifier for linearity

Midterm Practice Problems

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

Lecture 3: Linear Programming Relaxations and Rounding

Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can

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

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

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

Definition 11.1. Given a graph G on n vertices, we define the following quantities:

Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define

On the k-path cover problem for cacti

On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we

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.,

When is a graph planar?

When is a graph planar? Theorem(Euler, 1758) If a plane multigraph G with k components has n vertices, e edges, and f faces, then n e + f = 1 + k. Corollary If G is a simple, planar graph with n(g) 3,

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.

All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

Polytope Examples (PolyComp Fukuda) Matching Polytope 1

Polytope Examples (PolyComp Fukuda) Matching Polytope 1 Matching Polytope Let G = (V,E) be a graph. A matching in G is a subset of edges M E such that every vertex meets at most one member of M. A matching

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

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

Connectivity and cuts

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

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

3. Eulerian and Hamiltonian Graphs

3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from

The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

Institut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie. An Iterative Compression Algorithm for Vertex Cover

Friedrich-Schiller-Universität Jena Institut für Informatik Lehrstuhl Theoretische Informatik I / Komplexitätstheorie Studienarbeit An Iterative Compression Algorithm for Vertex Cover von Thomas Peiselt

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

Exponential time algorithms for graph coloring

Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].

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 Introduction. Dr. T. Srinivas Department of Mathematics Kakatiya University Warangal 506009, AP, INDIA tsrinivasku@gmail.com

A New Allgoriitthm for Miiniimum Costt Liinkiing M. Sreenivas Alluri Institute of Management Sciences Hanamkonda 506001, AP, INDIA allurimaster@gmail.com Dr. T. Srinivas Department of Mathematics Kakatiya

136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

Divide-and-Conquer. Three main steps : 1. divide; 2. conquer; 3. merge.

Divide-and-Conquer Three main steps : 1. divide; 2. conquer; 3. merge. 1 Let I denote the (sub)problem instance and S be its solution. The divide-and-conquer strategy can be described as follows. Procedure

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

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

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

arxiv:1409.4299v1 [cs.cg] 15 Sep 2014

Planar Embeddings with Small and Uniform Faces Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl 3, and Ignaz Rutter 3,4 arxiv:409.499v [cs.cg] 5 Sep 04 Department of Engineering, Roma Tre University, Italy

Topology of RNA and DNA

University of Southern Denmark September, 203 Outline Topology of RNA Topology of RNA 2 3 4 5 Neutral networks Reidys, C.M., Stadler, P.F., Schuster, P.K., 997, Generic Properties of Combinatory and Neutral

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

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

GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

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

Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We

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

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

Well-Separated Pair Decomposition for the Unit-disk Graph Metric and its Applications

Well-Separated Pair Decomposition for the Unit-disk Graph Metric and its Applications Jie Gao Department of Computer Science Stanford University Joint work with Li Zhang Systems Research Center Hewlett-Packard

Matthias F.M. Stallmann Department of Computer Science North Carolina State University Raleigh, NC 27695-8206

Matthias F.M. Stallmann Department of Computer Science North Carolina State University Raleigh, NC 27695-8206 August, 1990 UNIFORM PLANAR EMBEDDING IS NP-COMPLETE* MATTHIAS F.M. STALLMANN Key Words. planar

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

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

Discrete Mathematics Problems

Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

Determination of the normalization level of database schemas through equivalence classes of attributes

Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,

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

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

INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

Pigeonhole Principle Solutions

Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such

The Orthogonal Art Gallery Theorem with Constrained Guards

The Orthogonal Art Gallery Theorem with Constrained Guards T. S. Michael 1 Mathematics Department United States Naval Academy Annapolis, MD, U.S.A. Val Pinciu 2 Department of Mathematics Southern Connecticut

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

Lecture 6. Inverse of Matrix

Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that

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.

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

The chromatic spectrum of mixed hypergraphs

The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex

Nimble Algorithms for Cloud Computing. Ravi Kannan, Santosh Vempala and David Woodruff

Nimble Algorithms for Cloud Computing Ravi Kannan, Santosh Vempala and David Woodruff Cloud computing Data is distributed arbitrarily on many servers Parallel algorithms: time Streaming algorithms: sublinear

1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and Hing-Fung Ting 2 1 College of Mathematics and Computer Science, Hebei University,

R u t c o r Research R e p o r t. Boolean functions with a simple certificate for CNF complexity. Ondřej Čepeka Petr Kučera b Petr Savický c

R u t c o r Research R e p o r t Boolean functions with a simple certificate for CNF complexity Ondřej Čepeka Petr Kučera b Petr Savický c RRR 2-2010, January 24, 2010 RUTCOR Rutgers Center for Operations

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

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

A Structural View on Parameterizing Problems: Distance from Triviality

A Structural View on Parameterizing Problems: Distance from Triviality Jiong Guo, Falk Hüffner, and Rolf Niedermeier Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076 Tübingen,

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

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

Foundations of Geometry 1: Points, Lines, Segments, Angles

Chapter 3 Foundations of Geometry 1: Points, Lines, Segments, Angles 3.1 An Introduction to Proof Syllogism: The abstract form is: 1. All A is B. 2. X is A 3. X is B Example: Let s think about an example.

An inequality for the group chromatic number of a graph

An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

CS2 Algorithms and Data Structures Note 11. Breadth-First Search and Shortest Paths

CS2 Algorithms and Data Structures Note 11 Breadth-First Search and Shortest Paths In this last lecture of the CS2 Algorithms and Data Structures thread we will consider the problem of computing distances

Outline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1

GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept

Faster Subtree Isomorphism

Faster Subtree Isomorphism Ron Shamir Dekel Tsur Tel-Aviv University Dept. of Computer Science Tel Aviv 69978, Israel E-Mail: {shamir,dekel}@math.tau.ac.il March 1998, Revised May 1999 Abstract We study

MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

Approximating the Minimum Chain Completion problem

Approximating the Minimum Chain Completion problem Tomás Feder Heikki Mannila Evimaria Terzi Abstract A bipartite graph G = (U, V, E) is a chain graph [9] if there is a bijection π : {1,..., U } U such

THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

Counting Falsifying Assignments of a 2-CF via Recurrence Equations

Counting Falsifying Assignments of a 2-CF via Recurrence Equations Guillermo De Ita Luna, J. Raymundo Marcial Romero, Fernando Zacarias Flores, Meliza Contreras González and Pedro Bello López Abstract

8. Matchings and Factors

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

Computer Algorithms. NP-Complete Problems. CISC 4080 Yanjun Li

Computer Algorithms NP-Complete Problems NP-completeness The quest for efficient algorithms is about finding clever ways to bypass the process of exhaustive search, using clues from the input in order

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

A characterization of trace zero symmetric nonnegative 5x5 matrices

A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the

Error Compensation in Leaf Power Problems

Error Compensation in Leaf Power Problems Michael Dom Jiong Guo Falk Hüffner Rolf Niedermeier April 6, 2005 Abstract The k-leaf Power recognition problem is a particular case of graph power problems: For

Markov random fields and Gibbs measures

Chapter Markov random fields and Gibbs measures 1. Conditional independence Suppose X i is a random element of (X i, B i ), for i = 1, 2, 3, with all X i defined on the same probability space (.F, P).

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 }

[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

A threshold for the Maker-Breaker clique game

A threshold for the Maker-Breaker clique game Tobias Müller Miloš Stojaković October 7, 01 Abstract We study the Maker-Breaker k-clique game played on the edge set of the random graph G(n, p. In this game,

MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive