# Finding and counting given length cycles

 To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video
Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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 graphs. Most of the bounds obtained depend solely on the number of edges in the graph in question, and not on the number of vertices. The bounds obtained improve upon various previously known results. 1 Introduction The main contribution of this paper is a collection of new bounds on the complexity of finding simple cycles of length exactly k, where k 3 is a fixed integer, in a directed or an undirected graph G = (V, E). These bounds are of the form O(E α k) or of the form O(E β k d(g) γ k), where d(g) is the degeneracy of the graph (see below). The bounds improve upon previously known bounds when the graph in question is relatively sparse or relatively degenerate. We let C k stand for a simple cycle of length k. When considering directed graphs, a C k is assumed to be directed. We show that a C k in a directed or undirected graph G = (V, E), if one exists, can be found in O(E k ) time, if k is even, and in O(E k+1 ) time, if k is odd. For finding triangles (C 3 s), we get the slightly better bound of O(E ω ω+1 ) = O(E 1.41 ), where ω <.376 is the exponent of matrix multiplication. Even cycles in undirected graphs can be found even faster. A C 4k in an undirected graph G = (V, E), if one exists, can be found in O(E 1 k (1+ 1 k ) ) time. A C 4k, if one exists, can be found in O(E ( 1 k 1 k+1 ) ) time. In particular, we can find an undirected C 4 in O(E 4/3 ) time and an undirected C 6 in O(E 13/8 ) time. The degeneracy d(g) of an undirected graph G = (V, E) is the largest minimal degree among the minimal degrees of all the subgraphs G of G (see Bollobás [Bol78], p. ). The degeneracy d(g) of a graph G is linearly related to the arboricity a(g) of the graph, i.e., a(g) = Θ(d(G)), where a(g) is the minimal number of forests needed to cover all the edges of G. The degeneracy of a directed graph G = (V, E) is defined to be the degeneracy of the undirected version of G. The degeneracy of a graph is an important parameter of the graph that appears in many combinatorial results. It is easy to see that for any graph G = (V, E) we have d(g) E 1/. For graphs with relatively low Work supported in part by THE BASIC RESEARCH FOUNDATION administrated by THE ISRAEL ACADEMY OF SCIENCES AND HUMANITIES. School of Mathematical Sciences, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, ISRAEL. 1

2 cycle complexity cycle complexity C 3 E 1.41 E d(g) C 7 E 1.75 E 3/ d(g) C 4 E 1.5 E d(g) C 8 E 1.75 E 3/ d(g) C 5 E 1.67 E d(g) C 9 E 1.8 E3/ d(g) 3/ C 6 E 1.67 E 3/ d(g) 1/ C 10 E 1.8 E5/3 d(g) /3 Table 1: Finding small cycles in directed graphs some of the new results cycle complexity cycle complexity C 4 E 1.34 C 8 E 1.7 C 6 E 1.63 C 10 E 1.78 Table : Finding small cycles in undirected graphs some of the new results degeneracy we can improve upon the previously stated results. A C 4k in a directed or undirected graph G = (V, E) that contains one can be found in O(E 1 k d(g)) time. A C 4k+1, if one exists, can be found in O(E 1 k d(g) 1+ 1 k ) time. Similar results are obtained for finding C 4k s and C 4k 1 s. In particular, C 3 s and C 4 s can be found in O(E d(g)) time and C 5 s in O(E d(g) ) time. Some of the results mentioned are summarized in Tables 1 and. As any planar graph has a vertex whose degree is at most 5, the degeneracy of any planar graph is at most 5. As a consequence of the above bounds we get, in particular, that C 3 s, C 4 s and C 5 s in planar graphs can be found in O(V ) time. This in fact holds not only for planar graphs but for any non-trivial minor-closed family of graphs. Another contribution of this paper is an O(V ω ) algorithm for counting the number of C k s, for k 7, in a graph G = (V, E). Comparison with previous works Monien [Mon85] obtained, for any fixed k 3, an O(VE) algorithm for finding C k s in a directed or undirected graph G = (V, E). In a previous work [AYZ94] we showed, using the color-coding method, that a C k, for any fixed k 3, if one exists, can also be found in O(V ω ) expected time or in O(V ω log V ) worst-case time, where ω <.376 is the exponent of matrix multiplication. Our new O(E k ) algorithm is better than both the O(VE) and the O(V ω ) algorithms when the input graph G = (V, E) is sufficiently sparse. It is interesting to note that for k 6, Monien s O(VE) bound is superseded by either the O(V ω ) algorithm, when the graph is dense, or by the O(E 1/ k ) algorithm, when the graph is sparse. For every k 7, each one of the four bounds (including the bound that involves the degeneracy) beats the others on an appropriate family of graphs. In a previous work [YZ94] we have also showed that cycles of an even length in undirected graphs can be found even faster. Namely, for any even k 4, if an undirected graph G = (V, E) contains a C k then such a C k can be found in O(V ) time. Our O(E 1 k (1+ 1 k ) ) bound for C 4k and O(E ( 1 k 1 k+1 ) )

3 bound for C 4k are again better when the graph is sparse enough. Itai and Rodeh [IR78] showed that a triangle (a C 3 ) in a graph G = (V, E) that contains one can be found in O(V ω ) or O(E 3/ ) time. We improve their second result and show that the same can be done, in directed or undirected graphs, in O(E ω ω+1 ) = O(E 1.41 ) time. Chiba and Nishizeki [CN85] showed that triangles (C 3 s) and quadrilaterals (C 4 s) in graphs that contain them can be found in O(E d(g)) time. As d(g) = O(E 1/ ) for any graph G, this extends the result of Itai and Rodeh. We extend the result of Chiba and Nishizeki and show that C 4k 1 s and C 4k s can be found in O(E 1 k d(g)) time. We also show that C 4k+1 s can be found in O(E 1 k d(g) 1+ 1 k ) time. This gives, in particular, an O(E d(g) ) algorithm for finding pentagons (C 5 s). Our results apply to both directed and undirected graphs. Itai and Rodeh [IR78] and also Papadimitriou and Yannakakis [PY81] showed that C 3 s in planar graphs can be found in O(V ) time. Chiba and Nishizeki [CN85] showed that C 3 s as well as C 4 s in planar graphs can be found in O(V ) time. Richards [Ric86] showed that C 5 s and C 6 s in planar graphs can be found in O(V log V ) time. We improve upon the result of Richards and show that C 5 s in planar graphs can be found in O(V ) time. In a previous work [AYZ94] we showed, using color-coding, that for any k 3, a C k in a planar graph, if one exists, can be found in either O(V ) expected time or O(V log V ) worst case time. Finally, the fact that the number of triangles in a graph can be counted in O(V ω ) time is trivial. In [AYZ94] we showed, using color-coding, that for any k 3, a C k, if one exists, can be found in either O(V ω ) expected time or in O(V ω log V ) worst case time. Here we show that for any k 7 the number of C k s in a graph can be counted in O(V ω ) time. The counting method used here yields, in particular, a way of finding C k s for k 7, in O(V ω ) worst case time. 3 Finding cycles in sparse graphs Monien [Mon85] obtained his O(VE) algorithm by the use of representative collections. collections are also used by our algorithms. In the sequel, a p-set is a set of size p. Definition 3.1 ([Mon85]) Let F be a collection of p-sets. A sub-collection ˆF F is q- representative for F, if for every q-set B, there exists a set A F such that A B = if and only if there exists a set A ˆF with this property. It follows from a combinatorial lemma of Bollobás [Bol65] that any collection F of p-sets, no matter how large, has a q-representative sub-collection of size at most ( p+q) p. Monien [Mon85] describes an O(pq q i=0 pi F ) time algorithm for finding a q-representative sub-collection of F whose size is at most q i=0 pi. Relying on Monien s result we obtain the following lemma: Lemma 3. Let F be a collection of p-sets and let G be a collection of q-sets. Consider p and q to be fixed. In O( F + G ) time, we can either find two sets A F and B G such that A B = or decide that no two such sets exist. Proof : We use Monien s algorithm to find a q-representative sub-collection ˆF of F whose size is at most p q and a p-representative sub-collection Ĝ of G whose size is at most qp. This takes only O( F + G ) time (as p and q are constants). Such 3

4 It is easy to see that if there exist A F and B G such that A B =, then there also exist A ˆF and B Ĝ such that A B =. To see this note that if A B = then by the definition of q-representatives, there must exist a set A ˆF such that A B = and then, there must exist a set B Ĝ such that A B = as required. After finding the representative collections ˆF and Ĝ it is therefore enough to check whether they contain two disjoint sets. This can be easily done in constant time (as p and q are constants). We also need the following lemma obtained by Monien [Mon85]. Lemma 3.3 ([Mon85]) Let G = (V, E) be a directed or undirected graph, let v V and let k 3. A C k that passes through v, if one exists, can be found in O(E) time. We are finally able to present our improved algorithm. Theorem 3.4 Deciding whether a directed or undirected graph G = (V, E) contains simple cycles of length exactly k 1 and of length exactly k, and finding such cycles if it does, can be done in O(E 1 k ) time. Proof : We describe an O(E 1 k ) time algorithm for finding a C k in a directed graph G = (V, E). The details of all the other cases are similar. Let = E 1 k. A vertex in G whose degree is at least is said to be of high degree. The graph G = (V, E) contains at most E/ = O(E 1 1 k ) high degree vertices. We check, using Monien s algorithm (Lemma 3.3), whether any of these high degree vertices lies on a simple cycle of length k. For each vertex this costs O(E) operations and the total cost is O(E / ) = O(E 1 k ). If one of these vertices does lie on a cycle of length k we are done. Otherwise, we remove all the high degree vertices and all the edges adjacent to them from G and obtain a subgraph G that contains a C k if and only if G does. The maximum degree of G is at most = E 1 k and there are therefore at most E k 1 = E 1 k simple directed paths of length k in G. We can find all these simple path in O(E k) 1 time. We divide these paths into groups according to their endpoints. This can be done using radix sort in O(E k) 1 time and space. We get a list of all the pairs of vertices connected by simple directed paths of length exactly k. For each such pair u, v, we get a collection F u,v of k 1-sets. Each k 1-set in F u,v corresponds to the k 1 intermediate vertices that appear on simple directed paths of length k from u to v. For each pair u, v that appears on the list, we check whether there exist two directed paths of length k, one from u to v and the other from v to u, that meet only at their endpoints. Such two paths exist if there exist A F u,v and B F v,u such that A B =. This can be checked, as shown in Lemma 3., in O( F u,v + F v,u ) time. As the sum of the sizes of all these collections is O(E 1 k ), the total complexity is again O(E 1 k ). This completes the proof. In the case of triangles, we can get a better result by using fast matrix multiplication. Theorem 3.5 Deciding whether a directed or an undirected graph G = (V, E) contains a triangle, and finding one if it does, can be done is O(E ω ω+1 ) = O(E 1.41 ) time. Proof : Let = E ω 1 ω+1. A vertex is said to be of high degree if its degree is more than and of low degree otherwise. Consider all directed paths of length two in G whose intermediate vertex is of 4

5 low degree. There are at most E such paths and they can be found in O(E ) time. For each such path, check whether its endpoints are connected by an edge in the appropriate direction. If no triangle is found in this way, then any triangle in G must be composed of three high degree vertices. As there are at most E/ high degree vertices, we can check whether there exists such a triangle using matrix multiplication in O((E/ ) ω ) time. The total complexity of the algorithm is therefore O(E + (E/ ) ω ) = O(E ω ω+1 ). This completes the proof. We have not been able to utilize matrix multiplication to improve upon the result of Theorem 3.4 for k 4. This constitutes an interesting open problem. 4 Finding cycles in graphs with low degeneracy An undirected graph G = (V, E) is d-degenerate (see Bollobás [Bol78], p. ) if there exists an acyclic orientation of it in which d out (v) d for every v V. The smallest d for which G is d- degenerate is called the degeneracy or the max-min degree of G and is denoted by d(g). It can be easily seen (see again [Bol78]) that d(g) is the maximum of the minimum degrees taken over all the subgraphs of G. The degeneracy d(g) of a graph G is linearly related to the arboricity a(g) of the graph, i.e., a(g) = Θ(d(G)), where a(g) is the minimal number of forests needed to cover all the edges of G. The degeneracy of a directed graph G = (V, E) is defined to be the degeneracy of the undirected version of G. It is easy to see that the degeneracy of any planar graph is at most 5. Clearly, if G is d-degenerate then E d V. The following simple lemma, whose proof is omitted, is part of the folklore (see, e.g., [MB83]). Lemma 4.1 Let G = (V, E) be a connected undirected graph G = (V, E). An acyclic orientation of G such that for every v V we have d out (v) d(g) can be found in O(E) time. Theorem 4. Let G = (V, E) be a directed or an undirected graph. (i) Deciding whether G contains a simple cycle of length exactly 4k, and finding such a cycle if it does, can be done in O(E 1 k d(g) 1 1 k ) time. (ii) Deciding whether G contains simple cycles of length exactly 4k 1 and of length exactly 4k, and finding such cycles if it does, can be done in O(E 1 k d(g)) time. (iii) Deciding whether G contains a simple cycle of length exactly 4k + 1, and finding such a cycle if it does, can be done in O(E 1 k d(g) 1+ 1 k ) time. Proof : We show how to find a C 4k+1 in a directed graph G = (V, E), if one exists, in O(E 1 k d(g) 1+ 1 k ) time. The proofs of the other claims are easier. If d(g) E 1 k+1, we can use the algorithm of Theorem 3.4 whose complexity is O(E 1 k+1 ) O(E 1 k d(g) 1+ 1 k ). Assume therefore that d(g) E 1 k+1. Let = E 1 k /d(g) 1+ 1 k. As d(g) E 1 k+1, we have that d(g). A vertex is said to be of high degree if its degree is more than and of low degree otherwise. As in the proof of Theorem 3.4, 5

6 we can check in O(E / ) time whether any of the high degree vertices lies on a C 4k+1. If none of them lies on a C 4k+1, we can remove all the high degree vertices along with the edges adjacent to them from G and obtain a graph whose maximal degree is at most. The degeneracy of a graph can only decrease when vertices and edges are deleted and d(g) is therefore an upper bound on the degeneracy of the graph obtained. Suppose therefore that G is a graph with maximal degree and degeneracy d(g). To find a C 4k+1 in G, it is enough to find all directed simple paths of length k and k+1 in G and then check, using the algorithm described in the proof of Lemma 3., whether there exist a path of length k and a path of length k + 1 that meet only at their endpoints. In O(E) time we can get an acyclically oriented version G of G in which the out-degree of each vertex is at most d(g ) d(g). The orientations of the edges in G and G may be completely different. The number of paths, not necessarily directed, of length k + 1 in G, is at most E k i=0 k i d(g) k i = O(E k d(g) k ). i To see this, consider the orientations, in G, of the edges on a k + 1-path in G. In at least one direction, at most k of the edges are counter directed. The number of paths of length k+1 in which ) exactly i among the last k edges are counter directed is at most E (k i i d(g) k i. The binomial coefficient ( k) i stands for the possible choices for the position of the counter directed edges in the path. Similarly, the number of paths of length k in G is O(E k d(g) k 1 ). We can lower the number of paths of length k + 1 and k we have to consider by utilizing the fact that a C 4k+1 can be broken into two paths of length k + 1 and k in many different ways. In particular, let C be a directed C 4k+1 in G and consider the orientations of its edges in G. As 4k + 1 is odd and as G is acyclic, C must contain three consecutive edges e k, e k+1 and e k+, the first two of which have the same orientation while the third one has an opposite orientation. It is therefore enough to consider all k + 1-paths that start with at least two backward oriented edges and all k-paths that start with at least one backward oriented edge. The orientations referred to here are in G. The number of paths of length k + 1 in G whose first two edges are backward oriented in G is O(E k 1 d(g) k+1 ). To see this, note that any such path is composed of a directed path {e k, e k+1 } of length two, attached to an arbitrarily oriented path {e 1,...,e k 1 } of length k 1. The number of paths of length k 1 is, as shown earlier, at most O(E k 1 d(g) k 1 ) and the number of directed path of length two with a specified starting point is at most d(g). Similarly, there are at most O(E k 1 d(g) k ) k-paths that start with a backward oriented edge. It should be clear from the above discussion that all the required k + 1- and k-paths, whose total number is O(E k 1 d(g) k+1 ), can be found in O(E k 1 d(g) k+1 ) time. Paths which are not properly directed, in G, are thrown away. Properly directed paths are sorted, using radix sort, according to their endpoints. Using Lemma 3. we then check whether there exist a directed k + 1-path and a directed k-path that close a directed simple cycle. All these operations can again be performed in O(E k 1 d(g) k+1 ) time. 6

7 Recalling that = E 1 k /d(g) 1+ 1 k, we get that the over all complexity of the algorithm is This completes the proof of the Theorem. O( E + E k 1 d(g) k+1 ) = O(E 1 k d(g) 1+ 1 k ). As an immediate corollary we get: Corollary 4.3 If a directed or undirected planar graph G = (V, E) contains a pentagon (a C 5 ), then such a pentagon can be found in O(V ) worst-case time. By combining the ideas of this section, the O(E ω ω+1 ) algorithm of Theorem 3.5 and the color-coding method [AYZ94] we can also obtain the following result. Theorem 4.4 Let G = (V, E) be a directed or undirected graph. A C 6 in G, if one exists, can be found in either O((E d(g)) ω ω+1 ) = O((E d(g)) 1.41 ) expected time or O((E d(g)) ω ω+1 log V ) = O((E d(g)) 1.41 log V ) worst case time. Proof : We show how to find a C 6 in an undirected graph G = (V, E), if one exists, in O((Ed(G)) ω ω ω+1 ) expected time, or O((Ed(G)) ω+1 log V ) worst case time. The proof of the directed case is similar. In O(E) time we can get an acyclically oriented version G of G in which the out-degree of each vertex is at most d(g). There are exactly six possible non-isomorphic orientations of a C 6 of G in G as shown in Figure 1. We refer to these orientations as A 1,...,A 6. Our algorithm outputs, for each i = 1,...6, whether G contains an A i, thereby having an algorithm for detecting a C 6 in G. We show how to detect an A 1 in G, if it exists. The other cases are easier. As in [AYZ94], we color the vertices of G randomly using 6 colors (i.e. every vertex receives a number between 1 and 6, all numbers equally likely). Let c(v) denote the color of vertex v. Let A be a specific copy of an A 1 in G. We say that A is well-colored if its vertices are consecutively colored by 1 through 6, and the color 1 is assigned to one of the three vertices having only outgoing edges in A. (By consecutively colored we mean that each v A with c(v) < 6 has a neighbor u A with c(u) = c(v) + 1). The probability that A is well-colored is = We now show how to detect a well-colored copy of an A 1 deterministically, if it exists. Create a new undirected graph G = (V, E ) defined as follows: V = {v G : c(v) {, 4, 6}} E = {(u, v) : c(u) =, c(v) = 6 w G c(w) = 1, (w, u), (w, v) G } {(u, v) : c(u) =, c(v) = 4 w G c(w) = 3, (w, u), (w, v) G } {(u, v) : c(u) = 4, c(v) = 6 w G c(w) = 5, (w, u), (w, v) G }. Clearly, V V. To create G, we examine each edge (w, u) G with c(w) odd. Suppose c(w) = 1 and c(u) =. We create edges in G between u and all vertices v such that (w, v) G and c(v) = 6. There are at most d(g) 1 such vertices. We therefore have E < Ed(G) and G can be constructed 7

8 A 1 A A 3 A 4 A 5 A 6 Figure 1: The possible orientations of C 6 in G. in O(Ed(G)) time from G. Clearly, there exists an undirected triangle in G iff there exists a wellcolored A 1 in G. We can detect such a triangle in G in O((E ) ω ω ω+1 ) = O((Ed(G)) ω+1 ) time using the algorithm of Theorem 3.5. Notice that we have shown how to detect an A 1 in G, if it exists, in expected time O(6 5 (Ed(G)) ω ω ω+1 ) = O((Ed(G)) ω+1 ). As shown in [AYZ94], such a coloring scheme can be derandomized at the price of an O(log V ) factor. 5 Finding cycles in sparse undirected graphs To obtain the results of this section we rely on the following combinatorial lemma of Bondy and Simonovits [BS74]. Lemma 5.1 ([BS74]) Let G = (V, E) be an undirected graph. If E 100k V 1+ 1 k then G contains a C l for every integer l [k, n 1/k ]. By combining the algorithm described in the proof of Theorem 4. with an algorithm given in [YZ94] we obtain the following theorem. Theorem 5. Let G = (V, E) be an undirected graph. (i) A C 4k in G, if one exists, can be found in O(E 1 k (1+ 1 k ) ) time. (ii) A C 4k in G, if one exists, can be found in O(E ( 1 k 1 k+1 ) ) time. Proof : We prove the second claim. The proof of the first claim is similar. Let d = 00k E 1 k+1. If d(g) d then, by the definition of degeneracy, there is a subgraph G = (V, E ) of G in which the minimal degree is at least d. Such a subgraph can be easily found in O(E) time (see, e.g., [MB83]). Clearly E dv / 100k V E 1 k+1 and therefore E (100k V ) 1+ 1 k 100k (V ) 1+ 1 k. By Lemma 5.1 we get that G contains a C 4k and such a C 4k can be found in O(V ) = O(E k+1 ) time using the algorithm given in [YZ94]. If, on the other hand, d(g) d, then a C 4k in G, if one exists, can be found in O(E 1 k d) = O(E ( 1 k 1 k+1 ) ) time using the algorithm of Theorem 4.. It is easy to check that E k+1 E ( 1 k 1 k+1 ) with equality holding only if k = 1. In both cases, the complexity is therefore O(E ( 1 k 1 k+1 ) ) as required. 8

9 6 Counting small cycles A graph H = (V H, E H ) is called k-cyclic for k 3, if it contains a sequence of vertices (v 1,...v k, v k+1 ) where (v i, v i+1 ) E H for i = 1...k, v k+1 = v 1 and k i=1 {(v i, v i+1 )} = E H. The number of such sequences is denoted by c k (H). For example, an undirected triangle is k-cyclic for all k 3 except for k = 4. Clearly, c 3 (C 3 ) = 6. It is also not difficult to see that c 5 (C 3 ) = 30. In fact, c k (C k ) = k and for a directed C k we have c k (C k ) = k. Let A = A G be the adjacency matrix of a graph G = (V, E). Assume for simplicity that V = {1,...,n}. Denote by a (k) ij = (A k ) ij the elements of the k-th power of A. The trace tr(a k ) of A k, which is the sum of the entries along the diagonal of A k, gives us the number of closed walks of length k in G. For a graph H, let n G (H) be the number of subgraphs of G isomorphic to H. Clearly, tr(a k ) = n G (H)c k (H). H If c k (H) 0 then H is connected and has at most k edges. Also, H cannot be a tree on k + 1 vertices since each bridge must appear twice in a sequence. Hence, V H k. In fact, V H < k unless H = C k. We therefore obtain, for an undirected graph G = (V, E) : n G (C k ) = 1 k [tr(ak ) V H <k n G (H)c k (H)]. (1) (For a directed graph, replace the 1 k factor by 1 k.) It follows that, for fixed k, if we can compute n G (H) in O(f(n)) time for all k-cyclic graphs H with less than k vertices, and we can also compute tr(a k ) in O(f(n)) time, then n G (C k ) can also be computed in O(f(n)) time. We will show that for all k-cyclic graphs H, where 3 k 7, we can compute n G (H) in O(n ω ) time, and hence we obtain: Theorem 6.1 The number of C k s, for 3 k 7 in a directed or undirected graph G = (V, E) can be found in O(V ω ) time. Proof : We prove the Theorem for the undirected case. The proof of the directed case is simpler. Clearly, tr(a k ) can be computed in O(V ω ) time using fast matrix multiplication. It remains to show how to compute n G (H) for all k-cyclic graphs H, where 3 k 7 in O(V ω ) time, where H is not a C k. Figure lists all these graphs, ordered by their number of vertices. We have named these graphs H 1,...,H 15 as reference. The only 3-cyclic graph is C 3. The 4-cyclic graphs are H 1, H and C 4. The 5-cyclic graphs are C 3, H 5 and C 5. The 6-cyclic graphs are H 1, H, C 3, H 3, H 4, C 4, H 6, H 9, H 11 and C 6. The 7-cyclic graphs are C 3, H 5, H 6, C 5, H 7, H 8, H 10, H 1, H 13, H 14, H 15 and C 7. The following list shows how to obtain n G (H i ). In all cases, the formulae reference at most O(V ) values of a (p) ij for some 1 p k and hence can be computed in O(V ω ) time. We put d i = a () ii to denote the degree of vertex i. 1. n G (C 3 ) = 1 6 tr(a3 ). 9

10 n G (H 1 ) = E = n G (H ) = 1 i<j n i=1 di. a (1) ij. n G (C 4 ) = 1 8 [tr(a4 ) 4n G (H ) n G (H 1 )]. n G (H 3 ) = (d i 1)(d j 1) 3n G (C 3 ). n G (H 4 ) = n G (H 5 ) = 1 [ n i=1 i=1 di. 3 a (3) ii (d i )]. Note that a (3) ii is twice the number of triangles that pass through vertex i. n G (C 5 ) = 1 10 [tr(a5 ) 10n G (H 5 ) 30n G (C 3 )]. n G (H 6 ) = () a ij. Note that a () ij is the number of common neighbors of i and j. n G (H 8 ) = n G (H 7 ) = 1 [ n i=1 a (3) ii di ]. a () ij (d i )(d j ) n G (H 6 ). Note that we must subtract n G (H 6 ) to avoid the case when the two degree-one vertices of H 8 are, actually, the same vertex. 1. n G (H 9 ) = i ) i=1(d j i () a ij. Note that ( () a ) ij j i is exactly the number of quadrilaterals in which i participates. 10

11 13. n G (H 10 ) = ( 1 a(3) ii )( i=1 j i a () ij ) 6n G(C 3 ) n G (H 5 ) 4n G (H 6 ). Note that ( 1 a(3) ii )( j i a() ij ) is simply the number of triangles through i times the number of paths of length two that begin with i. However, we must only count such a triangle and such a path if they are disjoint, so we must subtract appropriate occurrences of C 3, H 5 and H n G (H 11 ) = i=1 1 a(3) ii n G (H 6 ). 15. Since we have already shown how to compute n G (H) for all 6-cyclic graphs, H, that are not C 6, we can use equation (1) to compute n G (C 6 ). 16. n G (H 1 ) = a () ij a (3) ij 9n G (C 3 ) n G (H 5 ) 4n G (H 6 ). Here we count the number of triangles through (i, j) and multiply each triangle by the number of walks of length 3 between i and j. Since these walks need not be simple, or may intersect the triangle, we may be actually counting C 3, H 5 or H 6. Therefore, we subtract the appropriate values n G (H 13 ) = () a ij. 3 n G (H 14 ) = (d i ) B i n G (H 1 ) i=1 where B i is the number of C 5 passing through i. The expression for B i is: B i = 1 [a(5) ii 5a (3) ii a (3) ii (d i ) n G (H 15 ) = ( 1 a(3) ii )( i=1 j i a () ij (d j ) ( 1 a(3) jj a() () a ij ) 6n G (H 6 ) n G (H 1 ) 6n G (H 13 ). ij )]. Similar formulae can be obtained, of course, for the number of octagons (C 8 s) and even larger cycles. To compute the number of octagons, however, we have to compute first the number of K 4 s in the graph, since a K 4 is 8-cyclic. We do not know how to do this is less than O(V ω+1 ) time. 11

12 H 1 H H 3 H 4 H 5 H 6 H 7 H 8 H 9 H 11 H 10 H 1 H 13 H 14 H 15 Figure : The k-cyclic graphs for 3 k 7. References [AYZ94] N. Alon, R. Yuster, and U. Zwick. Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. In Proceedings of the 6th Annual ACM Symposium on Theory of Computing, Montréal, Canada, To appear. [Bol65] B. Bollobás. On generalized graphs. Acta Math. Acad. Sci. Hungar., 16:447 45, [Bol78] B. Bollobás. Extremal graph theory. Academic Press, [BS74] [CN85] [IR78] J.A. Bondy and M. Simonovits. Cycles of even length in graphs. Journal of Combinatorial Theory, Series B, 16:97 105, N. Chiba and L. Nishizeki. Arboricity and subgraph listing algorithms. SIAM Journal on Computing, 14:10 3, A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7:413 43, [MB83] D.W. Matula and L.L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM, 30:417 47, [Mon85] B. Monien. How to find long paths efficiently. Annals of Discrete Mathematics, 5:39 54,

13 [PY81] [Ric86] [YZ94] C.H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13: , D. Richards. Finding short cycles in a planar graph using separators. Journal of Algorithms, 7:38 394, R. Yuster and U. Zwick. Finding even cycles even faster. In Proceedings of the 1st International Colloquium on Automata, Languages and Programming, Jerusalem, Israel, To appear. 13

### 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

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

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

### 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

### 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 degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### 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

### 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

### 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

### 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:

### On an anti-ramsey type result

On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element

### Embedding nearly-spanning bounded degree trees

Embedding nearly-spanning bounded degree trees Noga Alon Michael Krivelevich Benny Sudakov Abstract We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of

### 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

### 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

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### 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].

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

### 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 }

### 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

### 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

### Euler Paths and Euler Circuits

Euler Paths and Euler Circuits An Euler path is a path that uses every edge of a graph exactly once. An Euler circuit is a circuit that uses every edge of a graph exactly once. An Euler path starts and

### 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

### 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

### 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

### 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

### 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

### 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

### 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

### 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

### 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

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

### 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

### 10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

### 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

### Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study

### 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

### Offline sorting buffers on Line

Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com

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

### 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

### Homework Exam 1, Geometric Algorithms, 2016

Homework Exam 1, Geometric Algorithms, 2016 1. (3 points) Let P be a convex polyhedron in 3-dimensional space. The boundary of P is represented as a DCEL, storing the incidence relationships between the

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

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

### Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

### 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

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### 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

### 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

### Stationary random graphs on Z with prescribed iid degrees and finite mean connections

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

### Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices

MATHEMATICAL COMMUNICATIONS 47 Math. Commun., Vol. 15, No. 2, pp. 47-58 (2010) Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices Hongzhuan Wang 1, Hongbo Hua 1, and Dongdong Wang

### 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

### The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge,

The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge, cheapest first, we had to determine whether its two endpoints

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### 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

### 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

### 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

### 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

### Strictly Localized Construction of Planar Bounded-Degree Spanners of Unit Disk Graphs

Strictly Localized Construction of Planar Bounded-Degree Spanners of Unit Disk Graphs Iyad A. Kanj Ljubomir Perković Ge Xia Abstract We describe a new distributed and strictly-localized approach for constructing

### Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

### 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

### 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

### 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

### Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs

Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs Artur Czumaj Asaf Shapira Christian Sohler Abstract We study graph properties which are testable for bounded degree graphs in time independent

### 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

### Exact Polynomial-time Algorithm for the Clique Problem and P = NP for Clique Problem

xact Polynomial-time Algorithm for the Clique Problem and P = NP for Clique Problem Kanak Chandra Bora Department of Computer Science & ngineering Royal School of ngineering & Technology, Betkuchi, Guwahati-7810,

### Randomized algorithms

Randomized algorithms March 10, 2005 1 What are randomized algorithms? Algorithms which use random numbers to make decisions during the executions of the algorithm. Why would we want to do this?? Deterministic

### Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs Leah Epstein Magnús M. Halldórsson Asaf Levin Hadas Shachnai Abstract Motivated by applications in batch scheduling of jobs in manufacturing

### Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.

7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,

### Spring 2007 Math 510 Hints for practice problems

Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an -chessboard There are doors between all adjacent cells A prisoner in one

### 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

### 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

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

### 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

### Clique coloring B 1 -EPG graphs

Clique coloring B 1 -EPG graphs Flavia Bonomo a,c, María Pía Mazzoleni b,c, and Maya Stein d a Departamento de Computación, FCEN-UBA, Buenos Aires, Argentina. b Departamento de Matemática, FCE-UNLP, La

### Removing Even Crossings

EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,

### 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

### ! 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

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

### 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

### 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

### Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs

Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs Stavros Athanassopoulos, Ioannis Caragiannis, and Christos Kaklamanis Research Academic Computer Technology Institute

### 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

### 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 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

### Tools for parsimonious edge-colouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR-2010-10

Tools for parsimonious edge-colouring of graphs with maximum degree three J.L. Fouquet and J.M. Vanherpe LIFO, Université d Orléans Rapport n o RR-2010-10 Tools for parsimonious edge-colouring of graphs

### THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan

### 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

### INTERSECTION OF LINE-SEGMENTS

INTERSECTION OF LINE-SEGMENTS Vera Sacristán Discrete and Algorithmic Geometry Facultat de Matemàtiques i Estadística Universitat Politècnica de Catalunya Problem Input: n line-segments in the plane,

### An Empirical Study of Two MIS Algorithms

An Empirical Study of Two MIS Algorithms Email: Tushar Bisht and Kishore Kothapalli International Institute of Information Technology, Hyderabad Hyderabad, Andhra Pradesh, India 32. tushar.bisht@research.iiit.ac.in,

### 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

### 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

### What s next? Reductions other than kernelization

What s next? Reductions other than kernelization Dániel Marx Humboldt-Universität zu Berlin (with help from Fedor Fomin, Daniel Lokshtanov and Saket Saurabh) WorKer 2010: Workshop on Kernelization Nov

### The Open University s repository of research publications and other research outputs

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:

### Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques. My T. Thai

Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques My T. Thai 1 Overview An overview of LP relaxation and rounding method is as follows: 1. Formulate an optimization

### A simpler and better derandomization of an approximation algorithm for Single Source Rent-or-Buy

A simpler and better derandomization of an approximation algorithm for Single Source Rent-or-Buy David P. Williamson Anke van Zuylen School of Operations Research and Industrial Engineering, Cornell University,

### Lecture 1: Course overview, circuits, and formulas

Lecture 1: Course overview, circuits, and formulas Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: John Kim, Ben Lund 1 Course Information Swastik

### 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

### DETERMINANTS. b 2. x 2

DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in