# MATHEMATICAL ENGINEERING TECHNICAL REPORTS. The Independent Even Factor Problem

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Independent Even Factor Problem Satoru IWATA and Kenjiro TAKAZAWA METR April 2006 DEPARTMENT OF MATHEMATICAL INFORMATICS GRADUATE SCHOOL OF INFORMATION SCIENCE AND TECHNOLOGY THE UNIVERSITY OF TOKYO BUNKYO-KU, TOKYO , JAPAN WWW page:

2 The METR technical reports are published as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author s copyright. These works may not be reposted without the explicit permission of the copyright holder.

3 The Independent Even Factor Problem Satoru IWATA Kenjiro TAKAZAWA April, 2006 Abstract Cunningham and Geelen (1997) introduced the notion of independent path-matchings, which generalize both matchings and matroid intersection. Path-matchings are yet generalized to even factors in digraphs by Cunningham and Geelen (2001). Pap (2005) gave a combinatorial algorithm to find a maximum even factor in odd-cycle-symmetric digraphs, in which each arc in any odd dicycle has the reverse arc. The even factor problem, however, does not contain the matroid intersection problem. Cunningham and Geelen (2001) proposed the notion of basic even factors, which generalize both of even factors and matroid intersection, and showed a polynomial reduction of the basic even factor problem to the matroid intersection problem, which applies a maximum even factor algorithm in each oracle call for independence test. This paper deals with the independent even factor problem, which is a variant of the basic even factor problem. For odd-cycle-symmetric digraphs, a min-max formula is established as a common generalization of the Tutte-Berge formula for matchings and the min-max formula of Edmonds (1970) for matroid intersection. We devise a combinatorial efficient algorithm to find a maximum independent even factor in an odd-cycle-symmetric digraph accompanied with general matroids, which commonly extends two of the alternating-path type algorithms, the even factor algorithm and the matroid intersection algorithm. This algorithm gives a proof of the min-max formula, and contains a new operation on matroids, which corresponds to shrinking factor-critical components in the matching algorithm of Edmonds (1965). The running time of the algorithm is O(n 4 Q), where n is the number of vertices and Q is the time for an independence test. The algorithm also gives a common generalization of the Edmonds-Gallai decomposition for matchings and the principal partition for matroid intersection. 1 Introduction One of the most fundamental problems in combinatorial optimization is the matching problem. Tutte [20] characterized graphs that have a perfect matching. Then, Berge [1] showed that Tutte s characterization implies a min-max formula, now called the Tutte-Berge formula. Edmonds [5] gave a combinatorial algorithm to find a maximum matching. This algorithm implies a structural result, which is also found independently by Gallai [9], and now called the Edmonds-Gallai decomposition. The matroid intersection problem is also of importance. Edmonds [6] presented a min-max formula for that problem. Polynomial-time algorithms to find a maximum common independent set are known, such as those of Edmonds [7] and Lawler [13]. Research Institute for Mathematical Sciences, Kyoto University, Sakyo-ku, Kyoto, , Japan. E- mail: Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Bunkyo-ku, Tokyo , Japan. 1

4 As a common generalization of the matching and matroid intersection problems, Cunningham and Geelen [3] introduced the notion of independent path-matchings. They showed a min-max formula, a totally dual integral polyhedral description, and polynomial-time solvability of the independent path-matching problem, which generalize those in the matching and matroid intersection problems. The independent path-matching problem with free matroids is called the path-matching problem. For the path-matching problem, Frank and Szegő [8] simplified the min-max formula of Cunningham and Geelen [3] and provided its combinatorial proof. Spille and Szegő [18] showed that the path-matching problem has a property which generalizes the Edmonds-Gallai structure for matchings. The proof of polynomial-time solvability in Cunningham and Geelen [3] relies on the ellipsoid method. A combinatorial polynomial-time algorithm to find an optimal path-matching had been of interest. Spille and Weismantel [19] proposed to generalize Edmonds matching algorithm [5] to path-matchings. For the sake of a combinatorial approach to path-matchings, Cunningham and Geelen [4] introduced the even factor problem in digraphs, which is yet a generalization of the path-matching problem. While finding a maximum even factor is NP-hard in general digraphs, they showed that the problem is solvable in polynomial time in weakly symmetric digraphs with an algebraic approach. A digraph is said to be weakly symmetric if every arc in any dicycle has the reverse arc. In addition, they presented a min-max formula and generalized the Edmonds-Gallai decomposition to the even factor problem in weakly symmetric digraphs, followed by simplifications of Pap and Szegő [15]. These properties are known to hold in a broader class of digraphs, called odd-cyclesymmetric. A digraph is odd-cycle-symmetric if each arc in any odd dicycle has the reverse arc. Pap [14] devised a combinatorial algorithm to find a maximum even factor in odd-cycle-symmetric digraphs, which provides an algorithmic proof of the min-max formula and the Edmonds-Gallai type structure. This algorithm has some properties similar to Edmonds matching algorithm [5]. In fact, as mentioned above, the even factor problem leaves matroids out of consideration, or in other words, it only deals with free matroids. For a common generalization of matchings and matroid intersection, Cunningham and Geelen [4] proposed the notion of basic even factors. They showed a polynomial reduction of the basic even factor problem in weakly symmetric digraphs to the matroid intersection problem. In the resulting algorithm, one needs to compute the cardinality of a maximum even factor in a certain digraph for each independence test. In this paper, we deal with the independent even factor problem, which is a variant of the basic even factor problem. Extending the approach of Cunningham and Geelen [4], we obtain a min-max formula for the independent even factor problem in odd-cycle-symmetric digraphs, which commonly extends the Tutte-Berge formula for matchings and the min-max formula for matroid intersection of Edmonds [6]. For the independent even factor problem in odd-cyclesymmetric digraphs accompanied with general matroids, we devise a combinatorial algorithm to find a maximum independent even factor. The algorithm commonly extends the even factor algorithm [14] and the matroid intersection algorithms [7, 13], in both of which the notion of alternating-paths plays an essential part. The algorithm runs in O(n 4 Q) time, where n is the cardinality of the vertex set of the digraph and Q is the time needed to test if a given set is independent. By this algorithm, we obtain a different proof of the min-max formula. The algorithm also gives a common extension of the Edmonds-Gallai decomposition for matchings and the principal partition for matroid intersection (cf. [11,12]). Unlike the existing theorems on the Edmonds-Gallai type structure for path-matchings or even factors, we treat the two matroids equally to achieve a unified decomposition principle including the principal partition for matroid intersection. The maximum independent even factor algorithm includes a new operation on matroids, called 2

5 shrinking. For a matroid M and its independent set I, eliminate I and create a new element i to obtain a new matroid. We call this procedure shrinking I. Note that the resulting matroid differs from the one derived by contraction or deletion. This procedure corresponds to shrinking a factor-critical component in the matching algorithm of Edmonds [5] and the even factor algorithm of Pap [14]. Recently, Harvey [10] gave a new algebraic characterization of basic path-matchings, which achieved a maximum basic path-matching algorithm. His approach needs the matroids to be linearly represented over the same field. The algorithm runs in O(n ω ) time, where n is the number of vertices and ω is the exponent for matrix multiplication, bounded by ω < 2.38 (due to Coppersmith and Winograd [2]). One can easily extend this approach to obtain an O(n ω ) algorithm for independent even factor problems in which the matroids are linearly represented over the same field. Our algorithm, however, does not need the assumption, that is, it can deal with general matroids. Before closing this section, let us give some notations and definitions used in the following sections. A digraph G with the vertex set V and the arc set A is denoted by G = (V, A). For vertices u and v, let (u, v) denote an arc which starts in u and ends in v. For an arc a = (u, v), let + a (resp. a) denote the initial (resp. terminal) vertex of a, that is, + a = u and a = v. For a vertex v, define δ + v = a a A, + a = v}, and δ v = a a A, a = v}. For an arc set B, define + B = v v V, a B, v = + a}, and B = v v V, a B, v = a}. For a vertex set U, denote δ + U = a a A, + a U, a U}, and δ U = a a A, a U, + a U}. We denote the reverse arc of a by ā, i.e., ā = (v, u) for a = (u, v). An arc a A is called symmetric if ā A. A digraph is said to be symmetric if every arc is symmetric. For a subgraph H of G, the vertex set and the arc set of H are denoted by V (H) and A(H), respectively. We say H is odd (resp. even) if V (H) is odd (resp. even). A strongly connected component C with δ V (C) = (resp. δ + V (C) = ) is called a source-component (resp. sinkcomponent). For two vertex sets X + and X, let G[X +, X ] denote the subgraph whose vertex set is X + X and arc set is A[X +, X ] = a a A, + a X +, a X }. For a vertex set X, we abbreviate G[X, X] and A[X, X] as G[X] and A[X], respectively. We denote by odd + (X) (resp. odd (X)) the number of odd source-components (resp. odd sink-components) in G[X]. For v 0, v 1,..., v k V and a 1,..., a k A, a sequence W = (v 0, a 1, v 1, a 2, v 2,..., v k 1, a k, v k ) is called a walk if a i = (v i 1, v i ) for all i = 1,..., k. We denote the vertex set v 0,..., v k } = V (W ) and the arc set a 1,..., a k } = A(W ). For a walk W = (v 0, a 1, v 1,..., v k 1, a k, v k ), the length k of W is denoted by W. A walk W is said to be odd (resp. even) if W is odd (resp. even). A walk W = (v 0, a 1, v 1,..., v k 1, a k, v k ) is called a path if v 0, v 1,..., v k are pairwise distinct, and called a cycle if v 0, v 1,..., v k 1 are pairwise distinct and v 0 = v k. For a walk W = (v 0, a 1, v 1,..., v k 1, a k, v k ), let W denote the reverse walk of W (if exists), that is, W = (vk, ā k, v k 1,..., v 1, ā 1, v 0 ). Recall that a digraph is odd-cycle-symmetric if any odd cycle has the reverse cycle. For two vertex sets X + and X, we call (X +, X ) a stable pair if there is neither an arc a with + a X + \ X and a X, nor + a X + and a X \ X +. This definition generalizes that of Cunningham and Geelen [3], who first introduced the notion of stable pairs for the independent path-matching problem. The outline of this paper is as follows. Section 2 introduces even factors and matroid intersection, and describes some important results which are to be extended in independent even factors. Section 3 provides the operation of shrinking on matroids. Section 4 introduces independent even factors and proves a min-max formula structurally. Section 5 presents a new algorithm of ours. Finally, Section 6 reveals the Edmonds-Gallai type structure for independent even factors. 3

6 2 Even Factors and Matroid Intersection 2.1 Even Factors Let G = (V, A) be a digraph. An even factor is the arc set of a vertex-disjoint collection of some paths and even cycles. For a digraph G, let ν(g) denote the cardinality of a maximum even factor in G. One approach to computing ν(g) is extending the notion of the Tutte matrix in the matching problem [20]. Let x uv (u, v) A} be the indeterminates such that x uv = x vu for (u, v), (v, u) A. The Tutte matrix T = (t uv ) is defined by t uv = x uv ((u, v) A), 0 (otherwise), where rows and columns are both indexed by V. Cunningham and Geelen [4] asserted that ν(g) = rank T (2.1) if G is weakly symmetric. Based on this fact, the algorithm of Cunningham and Geelen [4] figures out ν(g) by computing rank T for a weakly symmetric digraph G. In fact, the proof of (2.1) in Cunningham and Geelen [4] is adaptable even for odd-cyclesymmetric digraphs. That is, (2.1) and their algorithm are valid for odd-cycle-symmetric digraphs. Theorem 2.1. Let G be an odd-cycle-symmetric digraph and let T be the Tutte matrix of G. Then ν(g) = rank T holds. Another approach to ν(g), proposed by Pap [14], is extending the matching algorithm of Edmonds [5]. Pap s algorithm finds a maximum even factor in an odd-cycle-symmetric digraph and brings about the following min-max formula. Theorem 2.2. For an odd-cycle-symmetric digraph G = (V, A), it holds that ν(g) = min (X +,X ) V \ X + + V \ X + X + X odd + (X + X ) }, where (X +, X ) runs over all stable pairs. This formula modestly extends that of Cunningham and Geelen [4, Theorem 1.3], in which the minimum is taken over all (X +, X ) such that G[X +, X ] is symmetric. One easily sees that such (X +, X ) forms a stable pair. 2.2 Matroid Intersection Let V be a finite set and its subset family I 2 V satisfy the following (I0) (I2): (I0) I, (I1) I J I I I, (I2) I, J I, I < J j J \ I, I j} I. 4

7 A set function ρ : 2 V Z + is defined by ρ(x) = max J J X, J I} (X V ). For V, I, and ρ defined above, we say M = (V, I, ρ) forms a matroid. We call V the ground set, I the independent set family, I I an independent set, and ρ the rank function. A subset of V is said to be dependent if it is not an independent set. Given a matroid (V, I, ρ), a subset B V is called a base if B is an inclusion-wise maximal independent set, and a subset C V is called a circuit if C is an inclusion-wise minimal dependent set. The closure function cl : 2 V 2 V is defined by cl(x) = j ρ(x j}) = ρ(x)} (X V ). For any I I and j cl(i) \ I, the union I j} contains a unique circuit, called the fundamental circuit denoted by C(I j). Let us be given two matroids on the same ground set, say M + = (V, I +, ρ + ) and M = (V, I, ρ ). The matroid intersection problem is a problem to find a maximum common independent set I I + I. A min-max formula for the matroid intersection problem is given by Edmonds [6]. Theorem 2.3 (Edmonds [6]). For two matroids M 1 = (V, I 1, ρ 1 ) and M 2 = (V, I 2, ρ 2 ), it holds that max I I V, I I 1 I 2 } = min X V ρ 1(V \ X) + ρ 2 (X)}. There are some combinatorial polynomial-time algorithms to find a maximum common independent set, such as Lawler s [13] and Edmonds [7]. We remark that the notion of alternatingpaths plays an essential part in those algorithms, as is the case with the matching algorithm of Edmonds [5] and the even factor algorithm of Pap [14]. 3 Shrinking of Matroids This section is devoted to the notion of shrinking of matroids. Note that it is different from the well-known notion of contraction of matroids. 3.1 Definition Let M = (V, I, ρ) be a matroid and W V be an independent set in M. Then, consider Ṽ = V \W w}, where w is a new element. Define a subset family Ĩ of Ṽ and a set function ρ : 2Ṽ Z + by Ĩ = I I V \ W, J W, J = W 1, I J I} I w} I V \ W, I W I}, ρ(x) = max J J X, J Ĩ} (X Ṽ ). Lemma 3.1. The tuple (Ṽ, Ĩ, ρ) forms a matroid. 5

8 Proof. It is easily seen that Ĩ satisfies (I0) and (I1). We prove (I2) by showing that for any Ĩ, J Ĩ with Ĩ < J, there exists an element v such that v J \ Ĩ, Ĩ v} Ĩ. (3.1) Suppose w Ĩ, i.e., Ĩ = Ĩ w} with Ĩ V \ W. As Ĩ, J Ĩ, it follows that I = Ĩ W I, and there exists J I with J = J + W 1 and J \ J W. Then, I < J holds, which implies that there exists v J \ I such that I v} I. Hence, it holds that Ĩ v} I and v J \ Ĩ. Thus, v satisfies (3.1). Suppose w Ĩ. Then, there exists W I W such that W I = W 1 and I = Ĩ W I I. Define J and v as mentioned above. If v W, we have that v satisfies (3.1). So, we may assume v W, which implies W = W I v} and Ĩ w} Ĩ. If w J, then w satisfies (3.1). Otherwise, let W J = J \ J. Note that W J = W 1 and W J W. Then, it holds that I = Ĩ W J Ĩ W. Hence, by (I1) we have I I, and I = Ĩ < J. Therefore, there exists an element u J \ I J \ Ĩ such that I u} I, which implies (3.1) holds for u. We denote the new matroid (Ṽ, Ĩ, ρ) defined above by M W. The procedure to obtain M W is called shrinking W, and we say that W is shrunk into w. Conversely, given an independent set I W in M W, there exists an independent set I I such that I W \ w} I and I = I W + W 1. The procedure of obtaining I is said to be expanding W. Lemma 3.1 can also be confirmed through combining well-known operations in matroid theory, induction through a bipartite graph and contraction. Let M = (V, I, ρ) be a matroid and W V be its independent set. Make a copy M = (V, I, ρ ) of M. We denote the copy of v V (resp. U V ) by v (resp. U ). Then, construct a bipartite graph G = (V, V ; A), where A = (u, v) u, v W } (v, v) v V \ W }. Associated with I and G, define a subset family I of V : a subset I V belongs to I if and only if there exists a matching M A in G such that M = I and + M I. Perfect [16] observed that I satisfies (I0) (I2). We denote the resulting matroid by M = (V, I, ρ ). Next, choose an arbitrary subset S of W with S = W 1 and contract S in M to obtain a new matroid M. By denoting the unique element in W \ S by w, one easily checks that M is the same as M W. From this construction, we obtain an explicit description of ρ. Theorem 3.2. Let M = (V, I, ρ) be a matroid, W V be an independent set in M, and M W = (Ṽ, Ĩ, ρ) be the matroid obtained by shrinking W. Then, for X Ṽ, it holds that ρ(x W ) W + 1 (w X), ρ(x) = minρ(x), ρ(x W ) W + 1} (w X). Proof. Given M = (V, I, ρ) and W I, define G = (V, V ; A) and M = (V, I, ρ ) as above and let S be a subset of W with S = W 1. Then, for X Ṽ, it holds that ρ(x) = ρ (X S) ρ (S) = min ρ(γ(y )) + X S \ Y } W + 1, Y X S where Γ(Y ) = u u V, (u, v) A, v Y } for Y V. 6

9 Suppose w X. In this case, we have ρ(x) = min ρ(γ(y )) + X S \ Y } W + 1 Y X S = min min ρ(y ) + X S \ Y }, min Y X\w} Y X S, Y W = min ρ(x \ w}) + W, ρ(x W )} W + 1 = ρ(x W ) W + 1, where the third equality can be seen through putting Y = X \ w}, X S. Suppose w X. In this case, ρ(y W ) + X S \ Y } W + 1 ρ(x) = min ρ(γ(y )) + X S \ Y } W + 1 Y X S = min min ρ(y ) + X S \ Y }, min ρ(y W ) + X S \ Y } Y X W + 1 Y X S, Y S = minρ(x) + W 1, ρ(x W )} W + 1 = minρ(x), ρ(x W ) W + 1}, where the third equality can be seen through putting Y = X, X S. 3.2 Independence Test Here we describe how to test independence in matroids obtained by repeated shrinking. Suppose we have an independence oracle for a matroid M = (V, I, ρ), and we obtained a matroid M = (Ṽ, Ĩ, ρ) by applying to M the procedure shrinking repeatedly. Let w 1,..., w k be the newly created elements in Ṽ, that is, w 1,..., w k } = Ṽ \V, and denote the set of vertices shrunk into the pseudo-vertex w i by W i V (i = 1,..., k). Assume that we have an independent set Ĩ Ĩ, and we know how to expand W i (i = 1,..., k) to obtain an independent set I I. We focus on testing whether Ĩ v} is independent for all v Ṽ \ Ĩ. Moreover, if Ĩ v} Ĩ, we enumerate all u Ĩ such that (Ĩ \ u}) v} Ĩ. These independence tests can be performed efficiently through constructing an auxiliary graph. Construct an auxiliary bipartite graph G = (V, A ; S 1, S 2 ) as follows. The vertex set V = V 1 V 2, where V 1 and V 2 are copies of V. The copy of v V (resp. W V ) in V i is denoted by v i (resp. W i ), for i = 1, 2. The arc set A consists of A = A V A M J, where ( k A V = (u 1, v 2 } ) ) u, v W i (v 1, v 2 ) v V \ (W 1 W k ) }, i=1 A M = (v 2, v 1 ) v I}, J = (u 2, v 2 ) u cl(i) \ I, v I, I \ v} u} I }. The two subsets S 1 V 1 and S 2 V 2 are defined by S 1 = v 1 v V \ I}, S 2 = v 2 v V \ I, I v} I}. 7

10 We refer to S 1 and S 2 as the set of source-vertices and sink-vertices, respectively, and refer to a path which starts from S 1 and ends in S 2 as a source-sink path. Fix v V \ I. Assume v is not a pseudo-vertex. If there exists a source-sink path in G which starts from v 1, then Ĩ v} Ĩ. If not, one can find all elements u Ĩ which satisfies (Ĩ \ u}) v} Ĩ as follows: for a vertex u Ĩ \ w 1,..., w k }, it holds that (Ĩ \ u}) v} Ĩ if and only if there exists a path in G which starts from v 1 and ends in u 2 ; for a pseudo-vertex w i Ĩ, it holds that (Ĩ \ w i}) v} Ĩ if and only if there exists a path in G which starts from v 1 and ends in w 2 with w W i. Assume v is a pseudo-vertex, say v = w 1, and let w be the unique vertex in W 1 \I. In that case, if there exists a source-sink path in G which starts from w, then Ĩ v} Ĩ. If not, one can find all elements u Ĩ which satisfies (Ĩ \ u}) v} Ĩ as follows: for a vertex u Ĩ \ w 1,..., w k }, it holds that (Ĩ \ u}) v} Ĩ if and only if there exists a path in G which starts from w 1 and ends in u 2 ; for a pseudo-vertex w i Ĩ, it holds that (Ĩ \ w i}) v} Ĩ if and only if there exists a path in G which starts from w 1 and ends in w 2 with w W i. 4 The Independent Even Factor Problem From now on, we deal with the independent even factor problem, which is a variant of the basic even factor problem [4]. Definition 4.1. Let G = (V, A) be a digraph and M + = (V, I +, ρ + ), M = (V, I, ρ ) be matroids. An even factor M in G is called an independent even factor in (G, M +, M ) if + M I + and M I. If + M and M are bases of M + and M, respectively, M is called a basic even factor. For a digraph G = (V, A) and matroids M + = (V, I + ), M = (V, I ), let ν(g, M +, M ) denote the cardinality of a maximum independent even factor in (G, M +, M ). The independent even factor problem contains the even factor problem and the matroid intersection problem as special cases. Even Factor Problem: If M + and M are free, an arc set is an independent even factor in (G, M +, M ) if and only if it is an even factor in G. Matroid Intersection Problem: Let M 1 = (V, I 1, ρ 1 ) and M 2 = (V, I 2, ρ 2 ) be an instance of the matroid intersection problem. Then, construct an associated bipartite digraph G = (V 1, V 2 ; A) as follows. The vertex set V 1 and V 2 are copies of V, respectively, and the arc set A is given by A = (v 1, v 2 ) v V }, where v 1 V 1 (resp. v 2 V 2 ) denotes the copy of v V. On the vertex set V 1 V 2, define matroids M + = (V 1 V 2, I +, ρ + ) and M = (V 1 V 2, I, ρ ) by the following rank functions ρ +, ρ : 2 V 1 V 2 Z + : ρ + (X) = ρ 1 (X V 1 ), ρ (X) = ρ 2 (X V 2 ). Then, a subset I V belongs to I 1 I 2 if and only if the arc set (v 1, v 2 ) v I} is an independent even factor in (G, M +, M ). 8

11 For any independent even factor in (G, M +, M ) and any stable pair in G, the following inequality holds. Lemma 4.2. Let G = (V, A) be a digraph and M + = (V, I +, ρ + ), M = (V, I, ρ ) be matroids. Then, for any independent even factor M in (G, M +, M ) and any stable pair (X +, X ) in G, it holds that M ρ + (V \ X + ) + ρ (V \ X ) + X + X odd + (X + X ). (4.1) Proof. As (X +, X ) is a stable pair, it holds that M = M 1 M 2 M 3, where M 1 = a a M, + a V \ X +}, (4.2) M 2 = a a M, a V \ X }, (4.3) M 3 = a a M, a A[X + X ] }. (4.4) Note that M 1 and M 2 are not necessarily disjoint. We accomplish the proof by showing M 1 ρ + (V \ X + ), M 2 ρ (V \ X ), M 3 X + X odd + (X + X ). (4.5) First, as M is an independent even factor, it follows that + M I +, especially + M 1 I +. By the definition of M 1, we have + M 1 V \ X +, which implies M 1 ρ + (V \ X + ). Next, a similar argument shows that M 2 ρ (V \ X ). Finally, let us estimate M 3 by counting M 3. For a source-component C in G[X + X ], it holds that V (C) M 3 = A(C) M 3. Hence, if C is odd and V (C) M 3 = C, then A(C) M 3 would contain an odd cycle, which contradicts that M is an even factor in G. Thus, for every odd source-component C in X + X, it holds that V (C) M 3 C 1, which implies M 3 = M 3 X + X odd + (X + X ). A stable pair (X +, X ) is called minimizing if (X +, X ) minimizes the right hand side of (4.1). In fact, for a maximum independent even factor M and a minimizing stable pair (X +, X ), (4.1) holds with equality if G is odd-cycle-symmetric. Theorem 4.3. For an odd-cycle-symmetric digraph G = (V, A) and matroids M + = (V, I +, ρ + ), M = (V, I, ρ ), it holds that ν(g, M +, M ) = min (X +,X ) ρ + (V \ X + ) + ρ (V \ X ) + X + X odd + (X + X ) }, (4.6) where (X +, X ) runs over all stable pairs. One easily sees that Theorem 4.3 generalizes Theorems 2.2 and 2.3. Theorem 4.3 can be proved by extending Cunningham and Geelen s approach [4]. Let G = (V, A) be an odd-cycle-symmetric digraph, M + = (V, I +, ρ + ) and M = (V, I, ρ ) be matroids, and T be the Tutte matrix of G. Let us denote by T [I +, I ] the submatrix of T whose row set is I + V and column set I V. Note that the submatrix T [I +, I ] is the Tutte matrix of the subgraph G[I +, I ]. By Theorem 2.1, we have that if a submatrix T [I +, I ] such that I + I + and I I + is nonsingular, there exists an independent even factor M with + M = I + and M = I. As for such submatrices, there exists a min-max formula, which is a special case of Schrijver s one for linking systems [17, Theorem 3.6]. 9

12 Theorem 4.4. Let T be a matrix whose row set and column set are both indexed by V. and let M + = (V, I +, ρ + ) and M = (V, I, ρ ) be matroids. Then, it holds that max I + I + I +, I I, T [I +, I ] is nonsingular } = min U +,U V ρ + (V \ U + ) + ρ (V \ U ) + rank T [U +, U ] }. We remark here that Schrijver [17] proved the min-max formula using Theorem 2.3. Combining Theorems 2.2 and 4.4 procures us a proof of Theorem 4.3. Proof of Theorem 4.3. Let T be the Tutte matrix of G. By Theorem 4.4, we have ν(g, M +, M ) = min U +,U V ρ + (V \ U + ) + ρ (V \ U ) + rank T [U +, U ] }. Moreover, we know by Theorems 2.1 and 2.2 that rank T [U +, U ] = ν(g[u +, U ]) = min U + \ X + + U \ X + X + X odd + (X + X ) }, (X +,X ) where (X +, X ) runs over all stable pairs in G[U +, U ]. Note that the second equality follows from a variant of Theorem 2.2, which can also be proved by Pap s even factor algorithm [14]. Therefore, we have that ν(g, M +, M ) = min ρ + (V \ U + ) + ρ (V \ U ) U +,U V + min U + \ X + + U \ X + X + X odd + (X + X ) }} (X +,X ) = min min ρ + (V \ U + ) + ρ (V \ U ) + U + \ X + + U \ X } (X +,X ) U +,U } + X + X odd + (X + X ), where U + and U satisfy that (X +, X ) is a stable pair in G[U +, U ]. The inner minimum in the right hand side is achieved when U + = X + and U = X. Hence, it follows that ν(g, M +, M ) = min (X +,X ) ρ + (V \ X + ) + ρ (V \ X ) + X + X odd + (X + X ) }, where (X +, X ) runs over all stable pairs. 5 An Alternating-Path Algorithm In this section, we describe a combinatorial algorithm to find a maximum independent even factor in (G, M +, M ), where G is odd-cycle-symmetric. This algorithm is a natural generalization of the maximum even factor algorithm [14] and the matroid intersection algorithms [7,13], in both of which the notion of alternating-path plays an essential part. The algorithm also finds a minimizing stable pair which certificates (4.6). 10

13 5.1 The Algorithm Let G = (V, A) be an odd-cycle-symmetric digraph, and M + = (V, I +, ρ + ) and M = (V, I, ρ ) be matroids, whose closure functions and fundamental circuits are denoted by cl + ( ), cl ( ) and C + ( ), C ( ), respectively. Assume we have an independent even factor M in (G, M +, M ). We show a procedure to find an independent even factor M with M = M + 1, or determine that M is a maximum independent even factor. For an independent even factor M, construct an auxiliary graph G M = (V, A ; S +, S ) as follows. The vertex set V is given by V = V + V, where V + and V are two copies of V. For a vertex v V, we denote the copy of v in V + (resp. V ) by v + (resp. v ). The arc set A is composed of A = A M J + J, where A = (u +, v ) (u, v) A } (copy of A), M = (v, u + ) (u, v) M } (reverse copy of M), J + = (u +, v + ) u + M, v cl + ( + M) \ + M, + M \ u} v} I +}, J = (u, v ) u cl ( M) \ M, v M, M \ v} u} I }. We call the arcs in J + and J the jumping arcs. The two subsets S + V + and S V are defined by S + = v + v V \ + M, + M v} I + }, S = v v V \ M, M v} I }. We refer to S + and S as the set of source-vertices and sink-vertices, respectively. A vertex v V is called source-reachable if there exists a path which starts in S + and ends in v, and called sink-reachable if there exists a path which starts in v and ends in S. A path P is called a source-sink path if P starts in S + and ends in S. For a path P in G M, we denote the master copy of A(P ) (A M ) by A (P ) (that is, A (P ) A). Suppose that G M has source-sink paths. Let P be the shortest source-sink path and A (P ) = a 1, m 1, a 2,..., a k, m k, a k+1 }, which is in order of appearance in P. Note that a 1,..., a k+1 A\M and m 1,..., m k M. Then, we obtain an independent even factor M with M = M + 1 by putting M = M A (P ) = (M \ m 1,..., m k }) a 1,..., a k+1 }, if M does not contain odd cycles. We refer to this procedure as Augment(M, P ). If there exist odd cycles in M, we avoid the creation of the cycles as follows. Denote a 1, m 1, a 2,..., a i, m i } = A (P i ) for each i k. Let j be the largest number such that M A (P j ) does not contain odd cycles. If j = k, it follows that there exists a unique odd cycle in M A (P ), which contains a k+1. Else, there exists a unique odd cycle in M A (P j+1 ). Let us denote such an odd cycle by C, and note that V (C) I + I. In those cases, take the symmetric difference of M and A (P j ), say N = M A (P j ) = (M \ m 1,..., m j }) a 1,..., a j }. Let us remark that N is an independent even factor with N = M and N A(C) = C 1. Then, shrink V (C) into a new vertex v C to obtain a new digraph G = (Ṽ, Ã) and matroids M +, M. In need of explicit representation of the shrunk odd cycle, we shall denote G, Ṽ, and Ã by G C, V C, and A C, respectively. Note that the arc set Ñ = N Ã is an independent even factor in ( G, M +, M ) with Ñ = N C + 1. We call this procedure Shrink(M, P, C). We show the validity of the procedure Shrink(M, P, C) by the propositions below. First, the following proposition assures the odd-cycle-symmetry of G. 11

14 Proposition 5.1 (Pap [14]). Let G = (V, A) be an odd-cycle-symmetric digraph. For an odd cycle C, it holds that G C = (V C, A C ) is also odd-cycle-symmetric. By Lemma 3.1 and Proposition 5.1, it is ensured that the algorithm also runs in ( G, M +, M ). Next, for an independent even factor M in (G C, M + V (C), M V (C)), we describe how to obtain an independent even factor M in (G, M +, M ) with M = M + C 1. We only discuss the case where v C + M M. Similar arguments hold in the other cases. Since v C + M M, we have that + M = ( + M \ vc }) V (C) I + and M = ( M \ vc }) V (C) I. In this case, it suffices to add C 1 arcs in A(C) A( C) to M so that the resulting arc set forms an even factor. Let us denote by a + (resp. a ) Ã the unique arc in δ + v C M (resp. δ v C M). As C is odd and G is odd-cycle-symmetric, there exists an even path P from a to + a + in C or C. In addition, there exist cycles of length two that cover every vertex v V (C) exposed by P exactly once. The union of M, A(P ) and the arcs in these cycles is an independent even factor in (G, M +, M ) of size M + C 1. We call this procedure Expand( M, C). The procedure Expand( M, C) ensures that for every independent even factor M in (G C, M + V (C), M V (C) ), there exists an independent even factor M in (G, M +, M ) with M = M + C 1. Hence, the following proposition holds. Proposition 5.2. Let G = (V, A) be an odd-cycle-symmetric digraph, and M +, M be two matroids on V. For an odd cycle C with V (C) I + I, it follows that ν ( G, M +, M ) ( ) ν G C, M + V (C), M V (C) + C 1. We are now ready to describe the steps to find an independent even factor of cardinality larger than M by one. Step 1: Construct the auxiliary graph G M. If there exists a source-sink path in G M, then go to Step 2. Otherwise, go to Step 4. Step 2: Let P be the shortest source-sink path. If M A (P ) does not contain any odd cycle, apply Augment(M, P ), and then go to Step 4. Otherwise, go to Step 3. Step 3: Apply Shrink(M, P, C), and (G, M +, M ) := ( G, M +, M ), M := Ñ. Then, go to Step 1. Step 4: Apply Expand(M, C) while there exists a pseudo-vertex v C. In the case that no source-sink path is found in Step 1, the algorithm determines that M is a maximum independent even factor. We certify this by showing that there exists a stable pair (X +, X ) such that M and (X +, X ) certificate (4.6). Algorithmic Proof of Theorem 4.3. Let (G, M +, M ) be the tuple in which no source-sink path was found in Step 1. Let R be the set of the source-reachable vertices in G M, X + = v v + R}, and X = v v R}. Then, we can easily see that (X +, X ) is a stable pair, M 1 M 2 =, and M 3 =. Moreover, A[X + X ] =, which implies that X + X = odd + (X + X ). Pick up v (V \ X + ) \ + M. As v + is not source-reachable, v + is not a source-vertex, that is, + M v} I +. Then, consider the fundamental circuit C + ( + M v). If C + ( + M v) and X + intersect at some vertex u, there would be a jumping arc from u + to v +, which contradicts that v + is not source-reachable. Hence, we have that C + ( + M v) V \ X + for all v (V \ X + ) \ + M, which implies that M 1 = ρ + (V \ X + ). A similar argument shows that M 2 = ρ (V \ X ). Therefore, it holds that M = ρ + (V \ X + ) + ρ (V \ X ) + X + X odd + (X + X ). 12

15 The argument above just assures that (4.6) holds in (G, M +, M ), which may be achieved as a result of applying Shrink(,, ) repeatedly. We show below that (4.6) holds before the repeated Shrink(,, ). Suppose that (G, M +, M ) is the tuple obtained by applying Shrink( ˆM, P, C) to (Ĝ, ˆM +, ˆM ), where Ĝ = ( ˆV, Â), ˆM+ = ( ˆV, Î+, ˆρ + ), and ˆM = ( ˆV, Î, ˆρ ). Associated with X + and X mentioned above, define ˆX +, ˆX ˆV as the inverse-image of X +, X, respectively, that is, ˆX + X + (v C X + ), = X + V (C) (v C X + ), and so is ˆX. Now we prove that ( ˆX +, ˆX ) is a stable pair which certificates (4.6). Firstly, one can easily see that ( ˆX +, ˆX ) forms a stable pair in Ĝ, which follows from the fact that (X +, X ) is a stable pair in G. Secondly, we estimate the value ˆρ + ( ˆV \ ˆX + ) + ˆρ ( ˆV \ ˆX ) + ˆX + ˆX odd + ( ˆX + ˆX ). One can easily see that v C is a source-vertex in G M, which implies that v C X +. Then, by Theorem 3.2, we have ˆρ + ( ˆV \ ˆX + ) = ρ(v \ X + ), since ˆρ + ( ˆV \ ˆX + ) ˆρ (( + ˆV \ ˆX ) + ) V (C) C + 1 follows that we can extend M with C 1 arcs in A(C) A( C) to obtain an independent even factor in (Ĝ, ˆM +, ˆM ). Assume v C X + X. Then, we have ˆρ ( ˆV \ ˆX ) = ρ (V \X ) from an argument similar to the above one. Moreover, the equation ˆX + ˆX odd + ( ˆX + ˆX ) = X + X odd + (X + X ) + C 1 follows the equations: ˆX + ˆX = X + X + C 1; odd + ( ˆX + ˆX ) = odd + (X + X ). Assume v C X + \ X. In this case, Theorem 3.2 implies that ˆρ ( ˆV \ ˆX ) = ρ (V \ X ) + C 1, and it is obvious that ˆX + ˆX odd + ( ˆX + ˆX ) = X + X odd + (X + X ). Therefore, in any case we have ˆρ + ( ˆV \ ˆX + ) + ˆρ ( ˆV \ ˆX ) + ˆX + ˆX odd + ( ˆX + ˆX ) = ρ + (V \ X + ) + ρ (V \ X ) + X + X odd + (X + X ) + C 1. (5.1) Hence, combining Proposition 5.2 and (5.1), we have that (4.6) holds for (Ĝ, ˆM +, ˆM ). 5.2 Complexity We discuss the complexity of the algorithm described in 5.1. Let (G, M +, M ), where G = (V, A), M + = (V, I +, ρ + ) and M = (V, I, ρ ), be the original instance. Recall that n = V and Q is the time needed to test if a given set U V is independent in M + or M. The most time-consuming part of the algorithm is the construction of the auxiliary graphs G M = (V, A ; S +, S ). We can identify the source-vertices S +, sink-vertices S, and jumping arcs J +, J by searching paths in the auxiliary graphs G described in 3.2. The construction of the auxiliary graph G takes O(n 2 Q) time. In the procedure Shrink(,, ), the number of vertices decreases at least by two, which implies that we have to construct O(n) auxiliary graphs G M between augmentations. Since there are at most n augmentations, the total time complexity of the algorithm is O(n 4 Q). We remark that the auxiliary graph G helps us finding which vertices in V (C) one should choose to be in + M and M in the procedure Expand(M, C). 13

16 6 An Edmonds-Gallai Type Structure In this section, we show that independent even factors have a structure which generalizes both of the Edmonds-Gallai decomposition for matchings or even factors, and the principal partition for matroid intersection. Theorem 6.1. Let G = (V, A) be an odd-cycle-symmetric digraph and M + = (V, I +, ρ + ), M = (V, I, ρ ) be matroids. Define V + D = v v V, maximum independent even factor M, v cl+ ( + M)}, V + A = v v V, maximum independent even factor M, v is source-reachable in G M }, V D = v v V, maximum independent even factor M, v cl ( M)}, V A = v v V, maximum independent even factor M, v+ is sink-reachable in G M }. Then, the following (i) (iv) hold. (i) The pair (V + D, V \ V + A ) is a minimizing stable pair (i.e., minimizes the right hand side of (4.1) among all stable pairs). Similarly, (V \ V A, V D ) is a stable pair which minimizes ρ + (V \ Y + ) + ρ (V \ Y ) + Y + Y odd (Y + Y ), (6.1) where (Y +, Y ) runs over all stable pairs. (ii) Every strongly connected component C in G[V + D (V \ V + A )] or in G[V D (V \ V A )] is an odd component with V (C) I + I. (iii) If M is a maximum independent even factor in (G, M +, M ), then the following (a) (c) hold. (a) For every strongly connected component C in G[V + D (V \ V + A )] or in G[V D (V \ V A )], M A(C) = C 1. (b) (V \ V + D ) + M = ρ + (V \ V + D ), V + A M = ρ (V + A ), V A + M = ρ + (V A ), and (V \ V D ) M = ρ (V \ V D ). (c) For a vertex v V + A M, there exists a vertex u V + D with (u, v) M, and for a vertex v V A + M, there exists a vertex u V D with (v, u) M. (iv) Any minimizing stable pair (X +, X ) satisfies that V + D X+ and V D X. Similarly, any stable pair (Y +, Y ) that minimizes (6.1) satisfies that V + D Y + and V D Y. Proof. Here we only show the statements on the stable pair (V + D, V \ V + A ). Those on (V \ V A, V D ) can be proved similarly by exchanging the roles of M + and M in the maximum independent even factor algorithm. Assertions (i) and (ii) follow from the fact that (V + D, V \ V + A ) is the minimizing stable pair which the algorithm finds. For a maximum independent even factor M, define M 1, M 2, M 3 by (4.2) (4.4), where X + = V + D and X = V \ V + A. As M is a maximum independent even factor and (X+, X ) is a minimizing stable pair, Inequations (4.5) hold with equalities and M 1 M 2 =. One checks that these conditions induce (iii) (cf. the proof of Lemma 4.2). We show (iv). Suppose there exists a minimizing stable pair (X +, X ) such that there is a vertex u with u V + D \ X+. As u V + D, there is a maximum independent even factor M with u cl + ( + M). Then, the stable pair (X +, X ) and M satisfy (4.5) with equality. The equation M 1 = ρ + (V \X + ), however, contradicts that u V \X + and u cl + ( + M). Therefore, for any minimizing stable pair (X +, X ), it holds that V + D X+. 14

17 Let us describe how Theorem 6.1 generalizes the Edmonds-Gallai decomposition for matchings and the principal partition for matroid intersection. Edmonds-Gallai Decomposition for Matchings Let G = (V, E) be an undirected graph with the vertex set V and the edge set E, and G = (V, A) be a symmetric digraph whose arc set is A = (u, v), (v, u) edge between u and v in E}. Consider an instance of matching problem G and an instance of the independent even factor problem ( G, M +, M ) where M + and M are free matroids. Then, it follows that V + D = V D = V D, V + A = V A = V A, where V D = v v V, maximum matching which does not cover v}, V A = v v V \ V D, v is adjacent to some vertex in V D }. By Theorem 6.1, the following statements on the undirected graph G hold. The cardinality of a maximum matching in G is equal to 1 2 ν( G, M +, M ) = 1 ( V \ V + D 2 + V + A + V + D (V \ V + A ) odd+ (V + D (V \ V + A ))) = 1 2 ( V + V A odd(v D )), where odd(x) denotes the number of odd component in G[X] (X V ). Every connected component C in G[V D ] is odd and factor-critical. If M is a maximum matching, then it holds that for every connected component C in G[V D ], C has ( C 1)/2 edges in M, every vertex in V \ V D is covered by M, for a vertex v V A, there exists a vertex u V D such that an edge in M connects u and v. For any V D V which minimizes V A odd(v D ), it follows that V D V D. These statements are exactly the statements of the Edmonds-Gallai decomposition. Principal Partition for Matroid Intersection Let M 1 = (V, I 1, ρ 1 ) and M 2 = (V, I 2, ρ 2 ) be an instance of the matroid intersection problem, and define V 1 D = v v V, maximum common independent set I, v cl 1 (I)}, V 2 D = v v V, maximum common independent set I, v cl 2 (I)}. Recalling the instance of the independent even factor problem (G, M +, M ) to which we reduced the matroid intersection instance in 4, we have that V + D = V + A = v 1, v 2 }, V D = V A = v 1, v 2 }. v V 1 D v V 2 D Applying Theorem 6.1 to (G, M +, M ), we obtain the following statements. 15

18 The cardinality of a maximum common independent set in I 1 I 2 is equal to ν(g, M +, M ) = ρ 1 (V \ V 1 D) + ρ 2 (V 1 D) = ρ 1 (V 2 D) + ρ 2 (V \ V 2 D). If I is a maximum common independent set, then it holds that (V \V 1 D ) I = ρ 1(V \V 1 D ), V 1 D I = ρ 2(V 1 D ), V 2 D I = ρ 1(V 2 D ), and (V \ V 2 D ) I = ρ 2(V \ V 2 D ). Any subset X V that minimizes ρ 1 (V \ X) + ρ 2 (X) satisfies that VD 1 X and VD 2 V \ X. That is, V D 1 (resp. V D 2 ) is the minimal (resp. maximal) subset minimizing the submodular function ρ 1 (V \ X) + ρ 2 (X). Acknowledgements The authors are thankful to Kazuo Murota for his helpful comments. References [1] Berge, C.: Sur le couplage maximum d un graphe, Comptes Rendus Hebdomadaires des Séances de l Académie de Sciences, 247 (1958), [2] Coppersmith, D., and Winograd, S.: Matrix multiplication via arithmetic progressions, Journal of Symbolic Computation, 9 (1990), [3] Cunningham, W. H., and Geelen, J. F.: The optimal path-matching problem, Combinatorica, 17 (1997), [4] Cunningham, W. H., and Geelen, J. F.: Vertex-disjoint dipaths and even dicircuits, manuscript, [5] Edmonds, J.: Paths, trees, and flowers, Canadian Journal of Mathematics, 17 (1965), [6] Edmonds, J.: Submodular functions, matroids and certain polyhedra, in Guy, R., Hanani, H., Sauer, N., and Schönheim, J., eds., Combinatorial Structures and Their Applications, New York, 1970, Grodon and Breach, [7] Edmonds, J.: Matroid intersection, Annals of Discrete Mathematics, 4 (1979), [8] Frank, A., and Szegő, L.: Note on the path-matching formula, Journal of Graph Theory, 41 (2002), [9] Gallai, T.: Maximale Systeme unabhänginger Kanten, A Magyar Tudományos Akadémia Matematikai Kutató Intézetének Közlémenyei, 9 (1964), [10] Harvey, N. J. A.: Algebraic structures and algorithms for matching and matroid problems, available from [11] Iri, M.: A review of recent work in Japan on principal partitions of matroids and their applications, Annals of the New York Academy of Sciences, 319 (1979), [12] Iri, M., and Fujishige, S.: Use of matroid theory in operations research, circuits and systems theory, International Journal of Systems Science, 12 (1981),

19 [13] Lawler, E. L.: Matroid intersection algorithms, Mathematical Programming, 9 (1975), [14] Pap, G.: A combinatorial algorithm to find a maximum even factor, in Jünger, M., and Kaibel, V., eds., Integer Programming and Combinatorial Optimization: Proceedings of the 11th International IPCO Conference, LNCS 3509, Springer-Verlag, 2005, [15] Pap, G., and Szegő, L.: On the maximum even factor in weakly symmetric graphs, Journal of Combinatorial Theory, Series B, 91 (2004), [16] Perfect, H.: Independence spaces and combinatorial problems, Proceedings of the London Mathematical Society, 19 (1969), [17] Schrijver, A.: Matroids and linking systems, Journal of Combinatorial Theory, Series B, 26 (1979), [18] Spille, B., and Szegő, L.: A Gallai-Edmonds-type structure theorem for path-matchings, Journal of Graph Theory, 46 (2004), [19] Spille, B., and Weismantel, R.: A generalization of Edmonds matching and matroid intersection algorithms, in Cook, W. J., and Schulz, A. S., eds., Integer Programming and Combinatorial Optimization: Proceedings of the 9th International IPCO Conference, LNCS 2337, Springer-Verlag, 2002, [20] Tutte, W. T.: The factorization of linear graphs, The Journal of the London Mathematical Society, 22 (1947),

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

### 3. Linear Programming and Polyhedral Combinatorics

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

### Week 5 Integral Polyhedra

Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory

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

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

### Greedy Algorithm And Matroid Intersection Algorithm. Summer Term Talk Summary Paul Wilhelm

Greedy Algorithm And Matroid Intersection Algorithm Summer Term 2010 Talk Summary Paul Wilhelm December 20, 2011 1 Greedy Algorithm Abstract Many combinatorial optimization problems can be formulated in

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

### Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest.

2 Trees What is a tree? Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest. Theorem 2.1 If G is a forest, then comp(g) = V (G) E(G). Proof: We proceed by induction on E(G).

### Two General Methods to Reduce Delay and Change of Enumeration Algorithms

ISSN 1346-5597 NII Technical Report Two General Methods to Reduce Delay and Change of Enumeration Algorithms Takeaki Uno NII-2003-004E Apr.2003 Two General Methods to Reduce Delay and Change of Enumeration

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

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

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

### 1 Polyhedra and Linear Programming

CS 598CSC: Combinatorial Optimization Lecture date: January 21, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im 1 Polyhedra and Linear Programming In this lecture, we will cover some basic material

### Solutions to Exercises 8

Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.

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

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

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

### Graphical degree sequences and realizations

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

### Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

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

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

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

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

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

### DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

Professor Kindred Math 04 Graph Theory Homework 7 Solutions April 3, 03 Introduction to Graph Theory, West Section 5. 0, variation of 5, 39 Section 5. 9 Section 5.3 3, 8, 3 Section 7. Problems you should

### Divisor graphs have arbitrary order and size

Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G

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

### Minimize subject to. x S R

Chapter 12 Lagrangian Relaxation This chapter is mostly inspired by Chapter 16 of [1]. In the previous chapters, we have succeeded to find efficient algorithms to solve several important problems such

### Relations Graphical View

Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Introduction Recall that a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). A binary

### Degree Hypergroupoids Associated with Hypergraphs

Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

### Theorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.

Chapter 3 Trees Section 3. Fundamental Properties of Trees Suppose your city is planning to construct a rapid rail system. They want to construct the most economical system possible that will meet the

### Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS

Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS 1.1.25 Prove that the Petersen graph has no cycle of length 7. Solution: There are 10 vertices in the Petersen graph G. Assume there is a cycle C

### Applied Algorithm Design Lecture 5

Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design

### Good luck, veel succes!

Final exam Advanced Linear Programming, May 7, 13.00-16.00 Switch off your mobile phone, PDA and any other mobile device and put it far away. No books or other reading materials are allowed. This exam

### Permutation Betting Markets: Singleton Betting with Extra Information

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

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

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

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

### 5.1 Bipartite Matching

CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson

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

### SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE

SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE 2012 SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH (M.Sc., SFU, Russia) A THESIS

### On end degrees and infinite cycles in locally finite graphs

On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel

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

### Coloring Eulerian triangulations of the projective plane

Coloring Eulerian triangulations of the projective plane Bojan Mohar 1 Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia bojan.mohar@uni-lj.si Abstract A simple characterization

### Discrete Applied Mathematics. The firefighter problem with more than one firefighter on trees

Discrete Applied Mathematics 161 (2013) 899 908 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The firefighter problem with

### A simple criterion on degree sequences of graphs

Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree

### Graph Theory Notes. Vadim Lozin. Institute of Mathematics University of Warwick

Graph Theory Notes Vadim Lozin Institute of Mathematics University of Warwick 1 Introduction A graph G = (V, E) consists of two sets V and E. The elements of V are called the vertices and the elements

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

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

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

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

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

### Graph theoretic techniques in the analysis of uniquely localizable sensor networks

Graph theoretic techniques in the analysis of uniquely localizable sensor networks Bill Jackson 1 and Tibor Jordán 2 ABSTRACT In the network localization problem the goal is to determine the location of

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

### AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.

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

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

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

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

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

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

### Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Minimally Infeasible Set Partitioning Problems with Balanced Constraints

Minimally Infeasible Set Partitioning Problems with alanced Constraints Michele Conforti, Marco Di Summa, Giacomo Zambelli January, 2005 Revised February, 2006 Abstract We study properties of systems of

### Graph Theory. Introduction. Distance in Graphs. Trees. Isabela Drămnesc UVT. Computer Science Department, West University of Timişoara, Romania

Graph Theory Introduction. Distance in Graphs. Trees Isabela Drămnesc UVT Computer Science Department, West University of Timişoara, Romania November 2016 Isabela Drămnesc UVT Graph Theory and Combinatorics

### Chapter 4. Trees. 4.1 Basics

Chapter 4 Trees 4.1 Basics A tree is a connected graph with no cycles. A forest is a collection of trees. A vertex of degree one, particularly in a tree, is called a leaf. Trees arise in a variety of applications.

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

### (a) (b) (c) Figure 1 : Graphs, multigraphs and digraphs. If the vertices of the leftmost figure are labelled {1, 2, 3, 4} in clockwise order from

4 Graph Theory Throughout these notes, a graph G is a pair (V, E) where V is a set and E is a set of unordered pairs of elements of V. The elements of V are called vertices and the elements of E are called

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

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

### Diameter and Treewidth in Minor-Closed Graph Families, Revisited

Algorithmica manuscript No. (will be inserted by the editor) Diameter and Treewidth in Minor-Closed Graph Families, Revisited Erik D. Demaine, MohammadTaghi Hajiaghayi MIT Computer Science and Artificial

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

### Characterizations of Arboricity of Graphs

Characterizations of Arboricity of Graphs Ruth Haas Smith College Northampton, MA USA Abstract The aim of this paper is to give several characterizations for the following two classes of graphs: (i) graphs

### Basic Notions on Graphs. Planar Graphs and Vertex Colourings. Joe Ryan. Presented by

Basic Notions on Graphs Planar Graphs and Vertex Colourings Presented by Joe Ryan School of Electrical Engineering and Computer Science University of Newcastle, Australia Planar graphs Graphs may be drawn

### . P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2

4. Basic feasible solutions and vertices of polyhedra Due to the fundamental theorem of Linear Programming, to solve any LP it suffices to consider the vertices (finitely many) of the polyhedron P of the

### Math 443/543 Graph Theory Notes 4: Connector Problems

Math 443/543 Graph Theory Notes 4: Connector Problems David Glickenstein September 19, 2012 1 Trees and the Minimal Connector Problem Here is the problem: Suppose we have a collection of cities which we

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

### 1 Local Brouwer degree

1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.

### A note on properties for a complementary graph and its tree graph

A note on properties for a complementary graph and its tree graph Abulimiti Yiming Department of Mathematics Institute of Mathematics & Informations Xinjiang Normal University China Masami Yasuda Department

### Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions

Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions D. R. Wilkins Copyright c David R. Wilkins 2016 Contents 3 Functions 43 3.1 Functions between Sets...................... 43 3.2 Injective

### Linear Codes. Chapter 3. 3.1 Basics

Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length

### 1 Basic Definitions and Concepts in Graph Theory

CME 305: Discrete Mathematics and Algorithms 1 Basic Definitions and Concepts in Graph Theory A graph G(V, E) is a set V of vertices and a set E of edges. In an undirected graph, an edge is an unordered

### Math 4707: Introduction to Combinatorics and Graph Theory

Math 4707: Introduction to Combinatorics and Graph Theory Lecture Addendum, November 3rd and 8th, 200 Counting Closed Walks and Spanning Trees in Graphs via Linear Algebra and Matrices Adjacency Matrices

### On the representability of the bi-uniform matroid

On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large

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

### GRAPH THEORY and APPLICATIONS. Trees

GRAPH THEORY and APPLICATIONS Trees Properties Tree: a connected graph with no cycle (acyclic) Forest: a graph with no cycle Paths are trees. Star: A tree consisting of one vertex adjacent to all the others.

### Resource Allocation with Time Intervals

Resource Allocation with Time Intervals Andreas Darmann Ulrich Pferschy Joachim Schauer Abstract We study a resource allocation problem where jobs have the following characteristics: Each job consumes

### Chapter 6 Planarity. Section 6.1 Euler s Formula

Chapter 6 Planarity Section 6.1 Euler s Formula In Chapter 1 we introduced the puzzle of the three houses and the three utilities. The problem was to determine if we could connect each of the three utilities

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

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

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

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

### Nan Kong, Andrew J. Schaefer. Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA

A Factor 1 2 Approximation Algorithm for Two-Stage Stochastic Matching Problems Nan Kong, Andrew J. Schaefer Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA Abstract We introduce

### Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

### Lecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002

Lecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002 Eric Vigoda Scribe: Varsha Dani & Tom Hayes 1.1 Introduction The aim of this

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

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

### Permutation Betting Markets: Singleton Betting with Extra Information

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

### The Line Connectivity Problem

Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany RALF BORNDÖRFER MARIKA NEUMANN MARC E. PFETSCH The Line Connectivity Problem Supported by the DFG Research