All 0-1 Polytopes are. Abstract. We study the facial structure of two important permutation polytopes

Size: px
Start display at page:

Download "All 0-1 Polytopes are. Abstract. We study the facial structure of two important permutation polytopes"

Transcription

1 All 0-1 Polytopes are Traveling Salesman Polytopes L.J. Billera and A. Sarangarajan y Abstract We study the facial structure of two important permutation polytopes in R n2, the Birkho or assignment polytope B n, dened as the convex hull of all n n permutation matrices, and the asymmetric traveling salesman polytope T n, dened as the convex hull of those n n permutation matrices corresponding to n-cycles. Using an isomorphism between the face lattice of B n and the lattice of elementary bipartite graphs, we show, for example, that every pair of vertices of is contained in a cubical face, showing faces of B n to be fairly B n special 0-1 polytopes. On the other hand, we show that T n has every 0-1 d-polytope as a face, for d = log n, by showing that every 0-1 d-polytope is the asymmetric traveling salesman polytope of some directed graph with n nodes. The latter class of polytopes is shown to have maximum diameter n 3. 1 Introduction The (asymmetric) traveling salesman problem, to nd the shortest (directed) Hamiltonian tour in a complete (directed) graph, is one of the widely studied problems in combinatorial optimization, both for its utility and for the fact that it represents, in a well-dened sense, all hard combinatorial problems. A standard approach to solving this problem is to consider it as a linear Department of Mathematics and School of Operations Research, Cornell University, Ithaca, New York, Partially supported by NSF grant DMS y Center for Applied Mathematics, Cornell University, Ithaca, New York,

2 programming problem over the (asymmetric) traveling salesman polytope, dened as the convex hull of all (directed) Hamiltonian tours, and to use known classes of bounding inequalities (facets) to try to nd an optimal tour. (See [4] for a discussion of this and other approaches to this problem.) The diculty with this approach is that the facets of these polytopes are not all known, and, it seems, not knowable. We give explicit evidence for this assertion for the asymmetric traveling salesman polytope (ATSP) by showing that, up to a certain dimension, all 0-1 polytopes are among its faces. In particular, we show that if P is a 0-1 polytope, then P appears as a face of an ATSP of suciently large dimension. The dimension of this ATSP is in general exponential in the dimension of P, and we show that it is not possible to get all 0-1 polytopes in R d as faces of an ATSP of a dimension that is polynomial in d. Another way of viewing the main result of this paper is that every 0-1 polytope is the AT SP of some directed graph. In section 2 we introduce the Birkho polytope and associate the faces of this polytope with elementary bipartite graphs. This establishes an isomorphism between the face lattice of the Birkho polytope and the lattice of elementary bipartite graphs. We use this isomorphism to show that every pair of vertices of the Birkho polytope is contained in a cubical face. Section 3 is devoted to proving our main result on the AT SP. In section 4 we study the asymmetric TSP of an arbitrary directed graph and give a tight bound on its diameter. We dene some terms that will be used for the rest of this paper. We denote the set f1; 2; : : : ; ng by [n]. The symmetric group of degree n is the set of all permutations of [n]. Permutations that are cycles of length k will be called k-cycles. If v = (v 1 ; v 2 ; : : : ; v n ) 2 R n then Supp(v) := fi : v i 6= 0g is the support of v. A 0-1 polytope is a polytope whose vertices have coordinates 0 or 1. K n;n is the complete bipartite graph with bipartition ([n]; [n]) and edge set f(i; j) : 1 i; j ng. If C = fc 1 ; : : : ; C d g is an ordered collection of permutations C 1 ; : : : ; C d and if S [d] then C(S) := Q s2s C s ; we write C[d] instead of C([d]). Throughout this paper, C will denote an ordered collection of disjoint cycles. The graph ~ G(P ) of a polytope P is the graph whose nodes are the vertices of P, and which has an edge joining two nodes if and only 2

3 if the corresponding vertices in P are adjacent on P. The diameter of P is dened as diam(p ) := diam( ~ G(P )) = maxfd(u; v) : u; v are nodes of ~ G(P )g where d(u; v) is the length of the shortest path between u and v in ~ G(P ). 2 The Birkho Polytope Let S n denote the symmetric group of degree n. Given 2 S n, we dene the corresponding n n permutation matrix X() 2 R n2 by X() ij := 1 if (i) = j 0 otherwise. We denote by B n the Birkho polytope (or the assignment polytope) of order n, given by B n := convfx() : 2 S n g: It is well known that B n is an (n?1) 2 dimensional polytope with the following inequality description: B n = fx 2 R n2 : x ij 0 ; 1 i ; j n; and nx i=1 x ij = 1 for j = 1; : : : ; ng: nx j=1 x ij = 1 for i = 1; : : : ; n A detailed study of this polytope is given in [2] (see also [3]). For convenience, we shall often denote a vertex X() by. With each vertex 2 B n, we associate the bipartite graph G() which is the matching on K n;n with the edge set f(i; (i)) : i = 1; : : : ; ng. If F is a face of B n, then G(F ) is the subgraph of K n;n which is the union of G() over all the vertices 2 F. G(F ) has the property that every edge of G(F ) is in some matching. Such graphs are called elementary graphs (see [5]; the denition of elementary graphs given there also requires them to be connected, but we will not require that here). Also if G K n;n is an elementary graph, dene F (G) := convf : G() Gg = B n \ fx 2 R n2 : x ij = 0 if (i; j) 62 Gg: 3

4 We see that F (G) is an intersection of facets of B n and therefore is a face of B n. Clearly, if F 1 ; F 2 are faces of B n, then F 1 F 2 if and only if G(F 1 ) G(F 2 ). This yields the following (see [5] for details). Theorem 2.1 The face lattice of B n is isomorphic to the lattice of all elementary subgraphs of K n;n ordered by inclusion. 2 Suppose F is a face of B n and G(F ) has components G 1 ; : : : ; G k. Suppose G i is bipartite with bipartition fi i ; J i g, so that the sets I 1 ; : : : ; I k (and J 1 ; : : : ; J k ) form a partition of [n]. Let B i be the Birkho polytope dened on the coordinates fx kl : k 2 I i ; l 2 J i g. Since G(F ) is elementary, each G i is elementary bipartite on fi i ; J i g. Hence, F i := F (G i ) is a face of B i. Then F = F 1 F 2 F k, embedded as block diagonal matrices in R n2 (up to permutation of rows and columns). This follows from the fact that v is a vertex of F if and only if v = v 1 v k where, for each i, v i is a vertex of F i for each i. If ; 2 S n, then G(; ) := G() [ G() is a union of two matchings which is a set of disjoint cycles and edges. Hence, by the above remark, F ; := F (G(; )) is a k dimensional cube where k is the number of cycles in the graph. If?1 = Q k C i=1 i 2 S n where C 1 ; : : : ; C k are disjoint cycles in S n, and if C = fc 1 ; : : : ; C k g then the vertices of F ; are given j by C(S) n over all subsets S [k]. We note that k can be at most 2k. We shall associate F ; with the unit k-cube with C(S) corresponding to the vertex with support S (so corresponds to the origin and to (1; 1; : : : ; 1)). For convenience, we shall often denote F ; by F (; C). This proves the following. Theorem 2.2 B n (or more generally, any face of B n ) has the property that any two of its vertices are contained in a cubical face of dimension at most b n 2 c. 2 We note here that the k-cube F ; is actually a zonotope (Minkowski sum of line segments) generated by k mutually orthogonal segments z i 2 R n2. Each z i is supported on a cycle of the graph G(; ) and has coordinates +1 or?1 alternately for edges of G() and G(). 4

5 3 The Asymmetric TSP Let T n := f 2 S n : is a cycle of length ng S n The asymmetric TSP of order n is dened by T n := convfx() : 2 T n g so that T n B n R n2 This means that if F is a face of B n, then F \ T n is a face of T n induced by F. We exploit this relationship between the faces of B n and T n to derive some results about the faces of T n. We rst describe the following procedure to generate some lower dimensional faces of T n : Let 2 S n and C = fc 1 ; : : : ; C k g where C 1 ; : : : ; C k 2 S n are disjoint cycles. Then F (; C) B n is a k-cube and if V is the set of AT SP vertices of this cube then conv(v ) = F (; C) \ T n is a face of T n. Call such a face F 0 (; C). We shall identify F 0 (; C) with a 0-1 polytope embedded in the k-cube. We note that if = C[k] = C 1 C k, then F (; C) = B n \ fx 2 R n2 : x ij = 0 if (i; j) 62 G(; )g and hence F 0 (; C) = T n \ fx 2 R n2 : x ij = 0 if (i; j) 62 G(; )g: Example 1: (Rao [6]) Let n = 9; = (1; 2; 3; 4; 5; 6; 7; 8; 9) and C = fc 1 ; C 2 ; C 3 g where C 1 = (1; 7; 4); C 2 = (2; 8; 5) and C 3 = (3; 9; 6). Then F (; C) B 9 is a 3-cube and the other vertices of this cube are given by 1 = C 1 = (1; 8; 9)(2; 3; 4)(5; 6; 7) (1; 0; 0) 2 = C 2 = (1; 2; 9)(3; 4; 5)(6; 7; 8) (0; 1; 0) 5

6 3 = C 3 = (1; 2; 3)(4; 5; 6)(7; 8; 9) (0; 0; 1) 12 = C 1 C 2 = (1; 8; 6; 7; 5; 3; 4; 2; 9) (1; 1; 0) 23 = C 2 C 3 = (1; 2; 9; 7; 8; 6; 4; 5; 3) (0; 1; 1) 13 = C 1 C 3 = (1; 8; 9; 7; 5; 6; 4; 2; 3) (1; 0; 1) 123 = C 1 C 2 C 3 = (1; 8; 6; 4; 2; 9; 7; 5; 3) (1; 1; 1) We note that 5 of the vertices of this cube are AT SP vertices and thus F 0 (; C) is a bipyramid over a triangle as shown in Figure Figure 1: F (; C) and F 0 (; C) for Example 1 It is natural to ask whether any 0-1 polytope can appear as a face of the AT SP in the above manner. Surprisingly, this turns out to be true; the remainder of this section is devoted to proving this assertion. Let I d denote the unit d-cube. We will usually refer to vertices of I d by their corresponding supports which are subsets of [d]. If V is a subset of vertices of I d, then by I d? V we mean the convex hull of the vertices of I d that are not in V. Proposition 3.1 I d is a face of T n for n = 3d. Proof: Let = (1; : : : ; n) and C = f(1; 2; 3); (4; 5; 6); : : : ; (n? 2; n? 1; n)g. Then for any S [d], C(S) = (a 1 ; : : : ; a n ) 2 T n where 3i? 2; 3i; 3i? 1 if i 2 S a 3i?2 ; a 3i?1 ; a 3i = 3i? 2; 3i? 1; 3i otherwise 6

7 This shows that F 0 (; C) = F (; C) = I d. 2 Next we show that I d? S is also a face of the T 3d for any vertex S 2 I d. We begin with S = [d]. Proposition 3.2 Let d be a positive integer, n = 3d; = (1; 2; : : : ; n) and let C = fc 1 ; C 2 ; : : : ; C d g = f(1; 3; 5); (4; 6; 8); : : : ; (n? 2; n; 2)g ( i.e. C i = (3i? 2; 3i; 3i + 2) for i < d and C d = (n? 2; n; 2)). Then F 0 (; C) = I d? [d] Proof: Since C[d] = (1; 4; 7; : : : ; n? 2)(3; 6; 9; : : : ; n)(n? 1; n? 4; : : : ; 2) 62 T n this implies that [d] 62 F 0 (; C). Now we need to show that all the other vertices of the cube F (; C) are also vertices of T n. For the rest of the proof, the numbers we indicate are modulo n. Let C[i; j] = C i C i+1 C j ( if i > j, then set C[i; j] = C i C d C 1 C j ). Let ij denote the sequence 3i?2; 3i+1; 3i+4; : : : ; 3j+1; 3j+2; 3j?1; 3j?4; : : : ; 3i?1; 3i; 3i+3; : : : ; 3j+3 that is ij increases from 3i? 2 to 3j + 1 in steps of 3 then decreases from 3j + 2 to 3i? 1 in steps of 3 and nally increases from 3i to 3j + 3 in steps of 3. Then C[i; j] = ( ij ; 3j + 4; 3j + 5; : : : ; 3i? 3) 2 T n ; that is C[i; j] is a cyclic permutation that diers from by inserting ij in the interval [3i? 2; 3j + 3]. Let S [d] be a proper subset of [d]. We write C(S) = C[i 1 ; j 1 ]C[i 2 ; j 2 ] C[i k ; j k ] 7

8 where i 1 < i 2 < < i k and the above representation for C(S) is minimal (i.e., C[i r ; j r ]C[i r+1 ; j r+1 ] 6= C[i r j r+1 ] for r = 1; : : : ; k ). Then, C(S) is a cyclic permutation that diers from by inserting the sequences irjr in the interval [3i r?2; 3j r +3] for r = 1; : : : ; k, hence C(S) 2 T n and we are done. 2 Proposition 3.2 generalizes to the following result. Proposition 3.3 If S [d]; S 6= ;; n = 3d and = (1; : : : ; n) then there is an ordered collection of disjoint cycles C = f C1 ; : : : ; Cd g S n such that F 0 (; C) = I d? S. Proof: Let C = fc 1 ; C 2 : : : ; C d g be the ordered set as dened in the last proposition. Let S = [d]? S. We show that there exists a 2 S n such that C i = (?1 C i i 2 S?1 C?1 i i 2 S: Since S is non empty, S 6= [d] and hence ^ := C( S) 2 Tn. Let ^C = f ^C 1 ; : : : ; ^C d g where Ci i 2 S ^C i = C?1 i i 2 S: Then F 0 (^; ^C) = I d? S. Since and ^ are both cycles of length n they are conjugate, that is, there is 2 S n such that =?1^ =?1 C( S). Conjugating the cycles ^C i by to get C i, we see that for any subset R [d] C(R) =?1^(?1^C(R)) =?1^^C(R) which has the same cycle structure as ^^C(R). Thus we must have F 0 (; C) = I d? S. 2 Example 2: Let v = (1; 0; 0; 0), = (1; : : : ; 12). We nd C = fc 1 ; C 2 ; C 3 ; C 4 g such that F 0 (; C) = I 4? v. By Proposition 3.2, if C = fc 1 ; C 2 ; C 3 ; C 4 g = f(1; 3; 5); (4; 6; 8); (7; 9; 11); (10; 12; 2)g 8 (1)

9 then F 0 (; C) = I 4? (1; 1; 1; 1). Let S = f1g = Supp(v), S = f2; 3; 4g, ^ = C( S) = C 2 C 3 C 4 = (1; 2; 11; 8; 5; 6; 9; 12; 3; 4; 7; 10) =: (a 1 ; a 2 ; : : : ; a 12 ) with a 1 = 1. Setting (i) = a i for i = 1; : : : ; 12 we get = (3; 11; 7; 9)(4; 8; 12; 10) and =?1^. Then C 1 =?1 C 1 = (1; 9; 5) Hence C 2 =?1 C?1 2 = (4; 6; 10) C 3 =?1 C?1 3 = (3; 7; 11) C 4 =?1 C?1 4 = (2; 8; 12) C = f(1; 9; 5); (4; 6; 10); (3; 7; 11); (2; 8; 12)g Using the same method, one can show that if C = f(2; 4; 12); (1; 5; 7); (6; 8; 10); (3; 9; 11)g; then F 0 (; C) = I 4? (0; 1; 1; 1). 2 Example 2 shows how we can nd C of Proposition 3.3. If ^ := C( S) = (a 1 ; : : : ; a n ) then setting (i) = a i for i = 1; : : : ; n we would get =?1^. This denes C i (by (1)) and hence C. Now we tackle the general case of removing any set of vertices. P R d be a 0-1 polytope. Assume without loss of generality that 0 2 P and let V := fs 1 ; : : : ; S k g be the set of vertices of I d that are not in P ( i.e. P = I d? V ). By Proposition 3.3, we can nd C i = fc i1 ; : : : ; C id g such that F 0 (; C i ) = I d? S i for i = 1; : : : ; k, where n = 3d; = (1; : : : ; n) and each C ij is a 3-cycle. The idea is to concatenate the cycles C 1j ; : : : ; C kj for j = 1; : : : ; d to eliminate S 1 ; : : : ; S k. For this, the cycles must be dened on distinct sets. So, assume that C i is dened on f(i? 1)n + 1; : : : ; ing and let i = ((i? 1)n + 1; : : : ; in) so that F 0 ( i ; C i ) = I d? S i for i = 1; : : : ; k (i.e. i C i (S) is an n-cycle for all S [d] except when S = S i ). Proposition 3.4 There is an integer N and an ordered set of disjoint cycles Y 0 = fy 0 ; : : : ; Y 0 1 dg S N such that if 0 = (1; : : : ; N) then F 0 ( 0 ; Y 0 ) = P. 9 Let

10 Proof: Dene the permutations Y j = C 1j C 2j C kj 2 S kn for j = 1; : : : ; d and let Y = fy 1 ; : : : ; Y d g, and N = kn + (k + 1)d. The following array illustrates how Y j is dened. C 1 C 11 C 1j C 1d F 0 ( 1 ; C 1 ) = I d? S C k C k1 C kj C kd F 0 ( k ; C k ) = I d? S k Y j We rst show that if S [d] then 0 Y(S) 2 T N, r C r (S) is an n-cycle for r = 1; : : : ; k (2) To see this, note that 0 Y(S) = 0 Y s2s Y s = 0 Y s2s(c 1s C ks ) = 0 C 1 (S) C k (S): Suppose r C r (S) = (x (r?1)n+1 ; : : : ; x rn ) is an n-cycle for r = 1; : : : ; k with x (r?1)n+1 = (r? 1)n + 1. Then it follows that 0 Y(S) = (x 1 ; x 2 ; : : : ; x kn ; kn + 1; kn + 2; : : : ; N) 2 T N since 0 Y(S)(l) = 0 C r (S)(l) = r C r (S)(l) if (r? 1)n < l rn; l 6= x rn and 0 Y(S)(x rn ) = 0 (rn) = rn + 1 = x rn+1 for r = 1; : : : ; k. Conversely, suppose that for some r, r C r (S) = C 0 is not an n-cycle where C 0 is a cycle not involving (r? 1)n + 1. Then, as above 0 Y(S) has C 0 as a cycle, so is not in T N proving (2). It follows from (2) that 0 Y(S) 2 T N if and only if S 62 V, i.e., if and only if S is a vertex of P. We now modify the permutations Y 1 ; : : : ; Y d to dene cycles Y 0 ; : : : ; Y 0 1 d such that 0 Y(S) 2 T N, 0 Y 0 (S) 2 T N for all S [d]. Suppose the 3-cycle C ij = (a ij ; b ij ; c ij ) and let ij denote the sequence a ij ; b ij ; c ij. For j = 1; : : : ; d dene Y 0 j = (r j + k + 1; kj ; r j + k; (k?1)j ; : : : ; r j + 2; 1j ; r j + 1) = (r j + k + 1; a kj ; b kj ; c kj ; r j + k; : : : ; r j + 2; a 1j ; b 1j ; c 1j ; r j + 1): 10

11 where r j = kn + (j? 1)(k + 1). Let S [d]. Let = 0 Y(S) and 0 = 0 Y 0 (S) and write and 0 as products of disjoint cycles. Noting that Y j = (a kj ; b kj ; c kj ) (a 1j ; b 1j ; c 1j ), we see that for i = 1; : : : ; k and j 2 S, the sequence c ij ; a ij +1 in is replaced by the sequence c ij ; r j +i+1; a ij +1 in 0 and the sequence r j +1; : : : ; r j +k+2 in is replaced by r j + 1; r j + k + 2 in 0. Thus if is an N-cycle then 0 is a rearranged N-cycle and conversely. Therefore, 0 = 0 Y(S) 2 T N, = 0 Y 0 (S) 2 T N (3) It follows from (2) and (3) that F 0 ( 0 ; Y 0 ) = P and N = kn + (k + 1)d = 3kd + (k + 1)d = (4k + 1)d. 2 The following is a direct consequence of Proposition 3.4. Theorem 3.1 If P R d is a 0-1 polytope with 2 d? k vertices, k > 1, then P appears as a face of T n for n (4k + 1)d. 2 Example 3: Let P = I 4? fv 1 ; v 2 g where v 1 = (1; 0; 0; 0) ; v 2 = (0; 1; 1; 1). In Example 2, we found C 1 and C 2 such that if = (1; : : : ; 12) then F 0 (; C 1 ) = I 4? v 1 and F 0 (; C 2 ) = I 4? v 2. Now we add 12 to every number in C 2 to get the permutations in dierent sets. Let 1 = (1; : : : ; 12) ; C 1 = f(1; 9; 5); (4; 6; 10); (3; 7; 11); (2; 8; 12)g 2 = (13; : : : ; 24) ; C 2 = f(14; 16; 24); (13; 17; 19); (18; 20; 22); (15; 21; 23)g so that F 0 ( 1 ; C 1 ) = I 4? v 1 and F 0 ( 2 ; C 2 ) = I 4? v 2 : Now dene Y 1 = (1; 9; 5)(14; 16; 24) ; Y 0 1 = (27; 14; 16; 24; 26; 1; 9; 5; 25) Y 2 = (4; 6; 10)(13; 17; 19) ; Y 0 2 = (30; 13; 17; 19; 29; 4; 6; 10; 28) Y 3 = (3; 7; 11)(18; 20; 22) ; Y 0 3 = (33; 18; 20; 22; 32; 3; 7; 11; 31) Y 4 = (2; 8; 12)(15; 21; 23) ; Y 0 4 = (36; 15; 21; 23; 35; 2; 8; 12; 34) 11

12 where we have underlined the new elements in each Yi 0. Let 0 = (1; : : : ; 36) and Y 0 = fy 0 ; Y 0 ; Y 0 ; Y g. Then for example while and 0 Y 3 = (1; 2; 3; 8; 9; 10; 11; 4; 5; 6; 7; 12; 13; : : : ; 18; 21; 22; 19; 20; 23; 24; : : : ; 31; 32; 33; 34; 35; 36) 2 T 36 0 Y 0 3 = (1; 2; 3; 8; 9; 10; 11; 32; 4; 5; 6; 7; 12; 13; : : : ; 18; 21; 22; 33; 19; 20; while 23; 24; : : : ; 31; 34; 35; 36) 2 T 36 0 Y 2 Y 3 Y 4 = (14; 15; 22; 19) 62 T 36 0 Y 0 2 Y 0 3 Y 0 4 = (14; 15; 22; 33; 19; 30) 62 T 36 where we have underlined the places where the permutations dier. Similarly multiplying 0 with all subsets of cycles of Y 0 we get F 0 ( 0 ; Y 0 ) = P. 2 Remarks: (1) The above result is not valid for B n since B n has the property that every pair of its vertices is contained in a cubical face. For instance, the bipyramid over a triangle (of Example 1), cannot be a face of B n. (2) A natural question to ask is whether the bound for n can be improved. We ask this question in two dierent forms. Given d, is there n d k such that (i) All 0-1 polytopes in R d appear as faces of T n? The answer is no for the following reason: The number of 0-1 polytopes in R d is 2 2d, since I d has 2 d vertices and the convex hull of any subset of these vertices is a 0-1 polytope. If f i is the number of i-dimensional faces of T n, then f i (n? 1)! i + 1! (n? 1)! i+1 n (i+1)n n n3 since i < n 2? 1 12

13 Hence, if f is the total number of faces of T n, then f n 2 n n3 = d 2k d kd3k if n = d k : Then log(f) 2k log(d) + kd 3k log(d) which is a polynomial in d, whereas log(2 2d ) = 2 d log(2) is an exponential in d. Hence, n cannot be a polynomial in d. (ii) All (combinatorially) distinct 0-1 polytopes in R d appear as faces of T n? This question remains open as we do not have a good estimate of the number of distinct 0-1 polytopes in R d. (3) Theorem 3.1 does not hold for all \hard" 0-1 problems: For example, the polytope associated with the quadratic assignment problem cannot have every 0-1 polytope among its faces since it is neighborly, i.e., every pair of its vertices are adjacent. This is so since, choosing a hyperplane containing any pair of vertices of B n, and no others, its normal can be used (by forming a tensor product with itself) to dene a supporting hyperplane to the desired edge of the quadratic assignment polytope. See [1; 2.2.3] for some background. (This fact and its proof was pointed out to us by A.I. Barvinok.) 4 The Asymmetric TSP of a Directed Graph For the rest of this section D will be a directed graph on the node set [n]. A Hamiltonian tour < i 1 ; : : : ; i n > in D (i.e. a tour comprising the edges (i 1 ; i 2 ); (i 2 ; i 3 ); : : : ; (i n ; i 1 )) corresponds to the cyclic permutation = (i 1 ; : : : ; i n ) 2 T n and hence to the permutation matrix X(). The asymmetric TSP of the graph D is given by T D := convfx()j corresponds to a tour in Dg If D is the complete directed graph, then T D section. Hence, for a general directed graph D = T n as dened in the last T D = T n \ fx 2 R n2 jx ij = 0 whenever (i; j) 62 Dg (4) 13

14 Since the nonnegativity constraints dene facets of T n, this shows that T D is a face of T n. Let ; 2 S n be permutations with no xed points (i.e. for each i 2 [n]; (i) 6= i and (i) 6= i). Let D(; ) be the directed graph with the edge set f(i; j) : (i) = j or (i) = jg. Lemma 4.1 Suppose C = fc 1 ; : : : ; C k g where?1 = C 1 C k. F 0 (; C) = T D(;). Then Proof: We have seen earlier that if G(; ) is the bipartite graph which is the union of the matchings corresponding to and then the face F (; C) = B n \ fx 2 R n2 : x ij = 0 if (i; j) 62 G(; )g is a k-cube and F 0 (; C) = F (; C) \ T n : Since the edge (i; j) 62 G(; ) if and only if the directed edge (i; j) 62 D(; ), it follows from (4) that F 0 (; C) = T D(;). 2 We showed that any 0-1 polytope appeared as a face of the AT SP. In proving this result we saw that the face was of the form F 0 (; C) where was our generic cycle (1; : : : ; n). The following theorem is therefore a direct consequence of Lemma 4.1: Theorem 4.1 Every 0-1 polytope in R d is the asymmetric TSP of some directed graph. In fact, if the polytope has a pair of diametrically opposite vertices, (vertices with disjoint supports such that the union of their supports is [d]) then the graph is the union of two tours. Otherwise the graph is the union of a tour and disjoint cycles that cover the graph. 2 Finally, we obtain some bounds on the diameter of T D. following preliminary results: We need the Lemma 4.2 Let ; 2 T n correspond to tours in D. If?1 = C 1 C k and C = fc 1 ; : : : ; C k g, then F 0 (; C) is a face of T D. 14

15 Proof: Since F 0 (; C) = T D(;) T D T n and F 0 (; C) is a face of T n, it follows that F 0 (; C) is a face of T D, proving the lemma. 2 The following is probably a well known result: Proposition 4.1 Let P R d be a 0-1 polytope and let v 1 ; v 2 be vertices of P such that (i) Supp(v 1 ) Supp(v 2 ) and (ii) If v is a vertex of P such that Supp(v 1 ) Supp(v) Supp(v 2 ), then v = v 1 or v = v 2. Then v 1 and v 2 are adjacent on P. Proof: Consider the face F of I d spanned by the vertices v 1 and v 2. The vertices of F are all the vertices v 2 I d such that Supp(v 1 ) Supp(v) Supp(v 2 ). By our assumption, the only vertices of P that lie on F are v 1 and v 2. Hence F \ P = convfv 1 ; v 2 g, i.e. v 1 is adjacent to v 2 on P. 2 Theorem 4.2k The maximum diameter of T D over all directed graphs D on. n nodes is j n 3 Proof: Dene (n) := maxfdiam(t D ) : D is a directed graph on [n]g: Let d = b n c and let D be any directed graph on [n]. We rst show that 3 diam(t D ) d. Let ; 2 T n be vertices of T D. Let?1 = C 1 C 2 C k and C = fc 1 ; : : : ; C k g. Let i = C 1 C i and 0 =. Choose 0 = i 0 < i 1 < < i m = k so that fi 1 ; : : : ; i m g = fj 2 [k] : j 2 T n g: We assume that the cycles C 1 ; : : : ; C k are arranged in such a way that if S [k] such that [i j ] S [i j+1 ] and C(S) 2 T n then S = [i j ] or S = [i j+1 ]. Then by Proposition 4.1, the vertices ij and ij+1 are adjacent on F 0 (; C) (and hence on T D since F 0 (; C) is a face of T D by Lemma 4.2) for j = 0; 1; : : : ; m? 1. 15

16 Since?1 i j ij+1 = C ij +1 C ij+1 is an even permutation, it follows that for j = 0; : : : ; m? 1 l ij l ij+1 3 where l i is the length of the cycle C i. Adding these m inequalities, we get 3m l 1 + l l k n i.e. m d. We have exhibited a path from to of length at most d which shows that diam(t D ) d. This implies that (n) d. To show that (n) = d, we have to nd a nd a directed graph D such that diam(t D ) = d. Let = (1; : : : ; n); C = fc 1 ; : : : ; C d g where C i = (3i? 2; 3i? 1; 3i) for i = 1; : : : ; d. Let = C 1 C d. Then, T D(;) = F 0 (; C) is a d-cube by Proposition 3.1, and hence has diameter d. 2 REFERENCES [1] A.I. Barvinok, \Combinatorial complexity of orbits in representations of the symmetric group", Advances in Soviet Mathematics, vol. 9, 1992, pp [2] R. Brualdi and P. Gibson, \Convex polyhedra of doubly stochastic matrices, I, II, III", Journal of Combinatorial Theory, A22 (1977), pp ; B22 (1977), pp ; A22 (1977), pp [3] V.A. Emelichev, M.M. Kovalev and M.K. Kravtsov, Polytopes, Graphs and Optimization, Cambridge University Press, New York, 1984, pp [4] E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York, [5] L.L. Lovasz and M.D. Plummer, Matching Theory, Elsevier Science Pub. Co., New York, [6] M.R. Rao, \Adjacency of the traveling salesman tours and 0-1 vertices", SIAM J. Appl. Math., vol. 30, No. 2, March 1976, pp

arxiv: v1 [math.co] 25 Sep 2015

arxiv: v1 [math.co] 25 Sep 2015 A BASIS FOR SLICING BIRKHOFF POLYTOPES TREVOR GLYNN arxiv:1509.07597v1 [math.co] 25 Sep 2015 Abstract. We present a change of basis that may allow more efficient calculation of the volumes of Birkhoff

More information

Vertex-Colouring Edge-Weightings

Vertex-Colouring Edge-Weightings Vertex-Colouring Edge-Weightings L. Addario-Berry a, K. Dalal a, C. McDiarmid b, B. A. Reed a and A. Thomason c a School of Computer Science, McGill University, University St. Montreal, QC, H3A A7, Canada

More information

The strong chromatic number of a graph

The strong chromatic number of a graph The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same

More information

MATH 890 HOMEWORK 2 DAVID MEREDITH

MATH 890 HOMEWORK 2 DAVID MEREDITH MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet

More information

Monotone Paths in Geometric Triangulations

Monotone Paths in Geometric Triangulations Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation

More information

LATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS

LATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS LATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS TIMOTHY L. VIS Abstract. A significant problem in finite optimization is the assignment problem. In essence, the assignment

More information

Localization in Graphs. Richardson, TX Azriel Rosenfeld. Center for Automation Research. College Park, MD

Localization in Graphs. Richardson, TX Azriel Rosenfeld. Center for Automation Research. College Park, MD CAR-TR-728 CS-TR-3326 UMIACS-TR-94-92 Samir Khuller Department of Computer Science Institute for Advanced Computer Studies University of Maryland College Park, MD 20742-3255 Localization in Graphs Azriel

More information

Winning Positions in Simplicial Nim

Winning Positions in Simplicial Nim Winning Positions in Simplicial Nim David Horrocks Department of Mathematics and Statistics University of Prince Edward Island Charlottetown, Prince Edward Island, Canada, C1A 4P3 dhorrocks@upei.ca Submitted:

More information

The NP-Completeness of Some Edge-Partition Problems

The NP-Completeness of Some Edge-Partition Problems The NP-Completeness of Some Edge-Partition Problems Ian Holyer y SIAM J. COMPUT, Vol. 10, No. 4, November 1981 (pp. 713-717) c1981 Society for Industrial and Applied Mathematics 0097-5397/81/1004-0006

More information

Graphic TSP in cubic graphs

Graphic TSP in cubic graphs Graphic TSP in cubic graphs arxiv:1608.07568v2 [cs.dm] 30 Aug 2016 Zdeněk Dvořák Daniel Král Bojan Mohar Abstract We prove that every simple 2-connected cubic n-vertex graph contains a spanning closed

More information

Chapter 4. square sum graphs. 4.1 Introduction

Chapter 4. square sum graphs. 4.1 Introduction Chapter 4 square sum graphs In this Chapter we introduce a new type of labeling of graphs which is closely related to the Diophantine Equation x 2 + y 2 = n and report results of our preliminary investigations

More information

arxiv: v2 [math.co] 23 Jan 2018

arxiv: v2 [math.co] 23 Jan 2018 CONNECTIVITY OF CUBICAL POLYTOPES HOA THI BUI, GUILLERMO PINEDA-VILLAVICENCIO, AND JULIEN UGON arxiv:1801.06747v2 [math.co] 23 Jan 2018 Abstract. A cubical polytope is a polytope with all its facets being

More information

[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra

[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra Apex graphs with embeddings of face-width three Bojan Mohar Department of Mathematics University of Ljubljana Jadranska 19, 61111 Ljubljana Slovenia bojan.mohar@uni-lj.si Abstract Aa apex graph is a graph

More information

6. Lecture notes on matroid intersection

6. Lecture notes on matroid intersection Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans May 2, 2017 6. Lecture notes on matroid intersection One nice feature about matroids is that a simple greedy algorithm

More information

Combinatorial Geometry & Topology arising in Game Theory and Optimization

Combinatorial Geometry & Topology arising in Game Theory and Optimization Combinatorial Geometry & Topology arising in Game Theory and Optimization Jesús A. De Loera University of California, Davis LAST EPISODE... We discuss the content of the course... Convex Sets A set is

More information

Belt diameter of some class of space lling zonotopes

Belt diameter of some class of space lling zonotopes Belt diameter of some class of space lling zonotopes Alexey Garber Moscow State University and Delone Laboratory of Yaroslavl State University, Russia Alexandro Readings, Moscow State University May 22,

More information

Star Forests, Dominating Sets and Ramsey-type Problems

Star Forests, Dominating Sets and Ramsey-type Problems Star Forests, Dominating Sets and Ramsey-type Problems Sheila Ferneyhough a, Ruth Haas b,denis Hanson c,1 and Gary MacGillivray a,1 a Department of Mathematics and Statistics, University of Victoria, P.O.

More information

ACTUALLY DOING IT : an Introduction to Polyhedral Computation

ACTUALLY DOING IT : an Introduction to Polyhedral Computation ACTUALLY DOING IT : an Introduction to Polyhedral Computation Jesús A. De Loera Department of Mathematics Univ. of California, Davis http://www.math.ucdavis.edu/ deloera/ 1 What is a Convex Polytope? 2

More information

Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1

Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1 CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) January 11, 2018 Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1 In this lecture

More information

A graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.

A graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial. 2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from

More information

Restricted Delivery Problems on a Network. December 17, Abstract

Restricted Delivery Problems on a Network. December 17, Abstract Restricted Delivery Problems on a Network Esther M. Arkin y, Refael Hassin z and Limor Klein x December 17, 1996 Abstract We consider a delivery problem on a network one is given a network in which nodes

More information

Convex Geometry arising in Optimization

Convex Geometry arising in Optimization Convex Geometry arising in Optimization Jesús A. De Loera University of California, Davis Berlin Mathematical School Summer 2015 WHAT IS THIS COURSE ABOUT? Combinatorial Convexity and Optimization PLAN

More information

Discrete Applied Mathematics. A revision and extension of results on 4-regular, 4-connected, claw-free graphs

Discrete Applied Mathematics. A revision and extension of results on 4-regular, 4-connected, claw-free graphs Discrete Applied Mathematics 159 (2011) 1225 1230 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam A revision and extension of results

More information

The Fibonacci hypercube

The Fibonacci hypercube AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 187 196 The Fibonacci hypercube Fred J. Rispoli Department of Mathematics and Computer Science Dowling College, Oakdale, NY 11769 U.S.A. Steven

More information

A PROOF OF THE LOWER BOUND CONJECTURE FOR CONVEX POLYTOPES

A PROOF OF THE LOWER BOUND CONJECTURE FOR CONVEX POLYTOPES PACIFIC JOURNAL OF MATHEMATICS Vol. 46, No. 2, 1973 A PROOF OF THE LOWER BOUND CONJECTURE FOR CONVEX POLYTOPES DAVID BARNETTE A d polytope is defined to be a cz-dimensional set that is the convex hull

More information

A simple exact separation algorithm for 2-matching inequalities

A simple exact separation algorithm for 2-matching inequalities A simple exact separation algorithm for 2-matching inequalities Julián Aráoz Simón Bolívar University, Venezuela Technical University of Catalonia, Spain Elena Fernández Technical University of Catalonia,

More information

Pebble Sets in Convex Polygons

Pebble Sets in Convex Polygons 2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon

More information

arxiv: v1 [math.co] 27 Feb 2015

arxiv: v1 [math.co] 27 Feb 2015 Mode Poset Probability Polytopes Guido Montúfar 1 and Johannes Rauh 2 arxiv:1503.00572v1 [math.co] 27 Feb 2015 1 Max Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103 Leipzig, Germany,

More information

Face covers and the genus of apex graphs Bojan Mohar Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia

Face covers and the genus of apex graphs Bojan Mohar Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia Face covers and the genus of apex graphs Bojan Mohar Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia bojan.mohar@uni-lj.si Abstract A graph G is an apex graph if it contains

More information

FACES OF CONVEX SETS

FACES OF CONVEX SETS FACES OF CONVEX SETS VERA ROSHCHINA Abstract. We remind the basic definitions of faces of convex sets and their basic properties. For more details see the classic references [1, 2] and [4] for polytopes.

More information

Let v be a vertex primed by v i (s). Then the number f(v) of neighbours of v which have

Let v be a vertex primed by v i (s). Then the number f(v) of neighbours of v which have Let v be a vertex primed by v i (s). Then the number f(v) of neighbours of v which have been red in the sequence up to and including v i (s) is deg(v)? s(v), and by the induction hypothesis this sequence

More information

Two Characterizations of Hypercubes

Two Characterizations of Hypercubes Two Characterizations of Hypercubes Juhani Nieminen, Matti Peltola and Pasi Ruotsalainen Department of Mathematics, University of Oulu University of Oulu, Faculty of Technology, Mathematics Division, P.O.

More information

ON THE STRONGLY REGULAR GRAPH OF PARAMETERS

ON THE STRONGLY REGULAR GRAPH OF PARAMETERS ON THE STRONGLY REGULAR GRAPH OF PARAMETERS (99, 14, 1, 2) SUZY LOU AND MAX MURIN Abstract. In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we

More information

9.5 Equivalence Relations

9.5 Equivalence Relations 9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same

More information

Average D-distance Between Edges of a Graph

Average D-distance Between Edges of a Graph Indian Journal of Science and Technology, Vol 8(), 5 56, January 05 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 OI : 07485/ijst/05/v8i/58066 Average -distance Between Edges of a Graph Reddy Babu

More information

Theorem 2.9: nearest addition algorithm

Theorem 2.9: nearest addition algorithm There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used

More information

Acyclic Edge Colorings of Graphs

Acyclic Edge Colorings of Graphs Acyclic Edge Colorings of Graphs Noga Alon Ayal Zaks Abstract A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G,

More information

Vertex Magic Total Labelings of Complete Graphs 1

Vertex Magic Total Labelings of Complete Graphs 1 Vertex Magic Total Labelings of Complete Graphs 1 Krishnappa. H. K. and Kishore Kothapalli and V. Ch. Venkaiah Centre for Security, Theory, and Algorithmic Research International Institute of Information

More information

On the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments

On the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments Electronic Journal of Graph Theory and Applications 3 (2) (2015), 191 196 On the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments Rafael Del Valle

More information

{ 1} Definitions. 10. Extremal graph theory. Problem definition Paths and cycles Complete subgraphs

{ 1} Definitions. 10. Extremal graph theory. Problem definition Paths and cycles Complete subgraphs Problem definition Paths and cycles Complete subgraphs 10. Extremal graph theory 10.1. Definitions Let us examine the following forbidden subgraph problems: At most how many edges are in a graph of order

More information

Polytopes Course Notes

Polytopes Course Notes Polytopes Course Notes Carl W. Lee Department of Mathematics University of Kentucky Lexington, KY 40506 lee@ms.uky.edu Fall 2013 i Contents 1 Polytopes 1 1.1 Convex Combinations and V-Polytopes.....................

More information

Lecture 12 March 4th

Lecture 12 March 4th Math 239: Discrete Mathematics for the Life Sciences Spring 2008 Lecture 12 March 4th Lecturer: Lior Pachter Scribe/ Editor: Wenjing Zheng/ Shaowei Lin 12.1 Alignment Polytopes Recall that the alignment

More information

Lower Bounds for Insertion Methods for TSP. Yossi Azar. Abstract. optimal tour. The lower bound holds even in the Euclidean Plane.

Lower Bounds for Insertion Methods for TSP. Yossi Azar. Abstract. optimal tour. The lower bound holds even in the Euclidean Plane. Lower Bounds for Insertion Methods for TSP Yossi Azar Abstract We show that the random insertion method for the traveling salesman problem (TSP) may produce a tour (log log n= log log log n) times longer

More information

Lecture 2 - Introduction to Polytopes

Lecture 2 - Introduction to Polytopes Lecture 2 - Introduction to Polytopes Optimization and Approximation - ENS M1 Nicolas Bousquet 1 Reminder of Linear Algebra definitions Let x 1,..., x m be points in R n and λ 1,..., λ m be real numbers.

More information

The Restrained Edge Geodetic Number of a Graph

The Restrained Edge Geodetic Number of a Graph International Journal of Computational and Applied Mathematics. ISSN 0973-1768 Volume 11, Number 1 (2016), pp. 9 19 Research India Publications http://www.ripublication.com/ijcam.htm The Restrained Edge

More information

Definition: A graph G = (V, E) is called a tree if G is connected and acyclic. The following theorem captures many important facts about trees.

Definition: A graph G = (V, E) is called a tree if G is connected and acyclic. The following theorem captures many important facts about trees. Tree 1. Trees and their Properties. Spanning trees 3. Minimum Spanning Trees 4. Applications of Minimum Spanning Trees 5. Minimum Spanning Tree Algorithms 1.1 Properties of Trees: Definition: A graph G

More information

PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS

PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed

More information

Decreasing the Diameter of Bounded Degree Graphs

Decreasing the Diameter of Bounded Degree Graphs Decreasing the Diameter of Bounded Degree Graphs Noga Alon András Gyárfás Miklós Ruszinkó February, 00 To the memory of Paul Erdős Abstract Let f d (G) denote the minimum number of edges that have to be

More information

REGULAR GRAPHS OF GIVEN GIRTH. Contents

REGULAR GRAPHS OF GIVEN GIRTH. Contents REGULAR GRAPHS OF GIVEN GIRTH BROOKE ULLERY Contents 1. Introduction This paper gives an introduction to the area of graph theory dealing with properties of regular graphs of given girth. A large portion

More information

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,

More information

Signed domination numbers of a graph and its complement

Signed domination numbers of a graph and its complement Discrete Mathematics 283 (2004) 87 92 www.elsevier.com/locate/disc Signed domination numbers of a graph and its complement Ruth Haas a, Thomas B. Wexler b a Department of Mathematics, Smith College, Northampton,

More information

Star Decompositions of the Complete Split Graph

Star Decompositions of the Complete Split Graph University of Dayton ecommons Honors Theses University Honors Program 4-016 Star Decompositions of the Complete Split Graph Adam C. Volk Follow this and additional works at: https://ecommons.udayton.edu/uhp_theses

More information

Enumeration of Full Graphs: Onset of the Asymptotic Region. Department of Mathematics. Massachusetts Institute of Technology. Cambridge, MA 02139

Enumeration of Full Graphs: Onset of the Asymptotic Region. Department of Mathematics. Massachusetts Institute of Technology. Cambridge, MA 02139 Enumeration of Full Graphs: Onset of the Asymptotic Region L. J. Cowen D. J. Kleitman y F. Lasaga D. E. Sussman Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 Abstract

More information

Approximating the Maximum Quadratic Assignment Problem 1

Approximating the Maximum Quadratic Assignment Problem 1 Approximating the Maximum Quadratic Assignment Problem 1 Esther M. Arkin Refael Hassin 3 Maxim Sviridenko 4 Keywords: Approximation algorithm; quadratic assignment problem 1 Introduction In the maximum

More information

Strong Chromatic Index of Subset Graphs

Strong Chromatic Index of Subset Graphs Strong Chromatic Index of Subset Graphs Jennifer J. Quinn DEPARTMENT OF MATHEMATICS OCCIDENTAL COLLEGE 1600 CAMPUS ROAD LOS ANGELES, CA 9004 I e-mail address: jquinnqoxy. edu Arthur T. Benjamin DEPARTMENT

More information

Modeling and Analysis of Hybrid Systems

Modeling and Analysis of Hybrid Systems Modeling and Analysis of Hybrid Systems Convex polyhedra Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October 2017 Ábrahám

More information

Modeling and Analysis of Hybrid Systems

Modeling and Analysis of Hybrid Systems Modeling and Analysis of Hybrid Systems 6. Convex polyhedra Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October 2017 Ábrahám

More information

Automorphism Groups of Cyclic Polytopes

Automorphism Groups of Cyclic Polytopes 8 Automorphism Groups of Cyclic Polytopes (Volker Kaibel and Arnold Waßmer ) It is probably well-known to most polytope theorists that the combinatorial automorphism group of a cyclic d-polytope with n

More information

Exercise set 2 Solutions

Exercise set 2 Solutions Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T

More information

MC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points

MC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you

More information

On the positive semidenite polytope rank

On the positive semidenite polytope rank On the positive semidenite polytope rank Davíd Trieb Bachelor Thesis Betreuer: Tim Netzer Institut für Mathematik Universität Innsbruck February 16, 017 On the positive semidefinite polytope rank - Introduction

More information

Assignment 4 Solutions of graph problems

Assignment 4 Solutions of graph problems Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of

More information

arxiv: v1 [cs.dm] 30 Apr 2014

arxiv: v1 [cs.dm] 30 Apr 2014 The stable set polytope of (P 6,triangle)-free graphs and new facet-inducing graphs Raffaele Mosca arxiv:1404.7623v1 [cs.dm] 30 Apr 2014 May 1, 2014 Abstract The stable set polytope of a graph G, denoted

More information

Graphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs

Graphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs Graphs and Network Flows IE411 Lecture 21 Dr. Ted Ralphs IE411 Lecture 21 1 Combinatorial Optimization and Network Flows In general, most combinatorial optimization and integer programming problems are

More information

From acute sets to centrally symmetric 2-neighborly polytopes

From acute sets to centrally symmetric 2-neighborly polytopes From acute sets to centrally symmetric -neighborly polytopes Isabella Novik Department of Mathematics University of Washington Seattle, WA 98195-4350, USA novik@math.washington.edu May 1, 018 Abstract

More information

Ray shooting from convex ranges

Ray shooting from convex ranges Discrete Applied Mathematics 108 (2001) 259 267 Ray shooting from convex ranges Evangelos Kranakis a, Danny Krizanc b, Anil Maheshwari a;, Jorg-Rudiger Sack a, Jorge Urrutia c a School of Computer Science,

More information

On Universal Cycles of Labeled Graphs

On Universal Cycles of Labeled Graphs On Universal Cycles of Labeled Graphs Greg Brockman Harvard University Cambridge, MA 02138 United States brockman@hcs.harvard.edu Bill Kay University of South Carolina Columbia, SC 29208 United States

More information

GEOMETRIC DISTANCE-REGULAR COVERS

GEOMETRIC DISTANCE-REGULAR COVERS NEW ZEALAND JOURNAL OF MATHEMATICS Volume 22 (1993), 31-38 GEOMETRIC DISTANCE-REGULAR COVERS C.D. G o d s i l 1 (Received March 1993) Abstract. Let G be a distance-regular graph with valency k and least

More information

On the packing chromatic number of some lattices

On the packing chromatic number of some lattices On the packing chromatic number of some lattices Arthur S. Finbow Department of Mathematics and Computing Science Saint Mary s University Halifax, Canada BH C art.finbow@stmarys.ca Douglas F. Rall Department

More information

Math 170- Graph Theory Notes

Math 170- Graph Theory Notes 1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory

More information

MA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:

MA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone: MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S14-04-25 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of

More information

Partitioning Complete Multipartite Graphs by Monochromatic Trees

Partitioning Complete Multipartite Graphs by Monochromatic Trees Partitioning Complete Multipartite Graphs by Monochromatic Trees Atsushi Kaneko, M.Kano 1 and Kazuhiro Suzuki 1 1 Department of Computer and Information Sciences Ibaraki University, Hitachi 316-8511 Japan

More information

The Structure of Bull-Free Perfect Graphs

The Structure of Bull-Free Perfect Graphs The Structure of Bull-Free Perfect Graphs Maria Chudnovsky and Irena Penev Columbia University, New York, NY 10027 USA May 18, 2012 Abstract The bull is a graph consisting of a triangle and two vertex-disjoint

More information

Treewidth and graph minors

Treewidth and graph minors Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under

More information

Three applications of Euler s formula. Chapter 10

Three applications of Euler s formula. Chapter 10 Three applications of Euler s formula Chapter 10 A graph is planar if it can be drawn in the plane R without crossing edges (or, equivalently, on the -dimensional sphere S ). We talk of a plane graph if

More information

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P. Title Author(s) The orientability of small covers and coloring simple polytopes Nishimura, Yasuzo; Nakayama, Hisashi Citation Osaka Journal of Mathematics. 42(1) P.243-P.256 Issue Date 2005-03 Text Version

More information

On graphs of minimum skew rank 4

On graphs of minimum skew rank 4 On graphs of minimum skew rank 4 Sudipta Mallik a and Bryan L. Shader b a Department of Mathematics & Statistics, Northern Arizona University, 85 S. Osborne Dr. PO Box: 5717, Flagstaff, AZ 8611, USA b

More information

Lecture 5: Graphs. Rajat Mittal. IIT Kanpur

Lecture 5: Graphs. Rajat Mittal. IIT Kanpur Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks

More information

MT5821 Advanced Combinatorics

MT5821 Advanced Combinatorics MT5821 Advanced Combinatorics 4 Graph colouring and symmetry There are two colourings of a 4-cycle with two colours (red and blue): one pair of opposite vertices should be red, the other pair blue. There

More information

Crossing Families. Abstract

Crossing Families. Abstract Crossing Families Boris Aronov 1, Paul Erdős 2, Wayne Goddard 3, Daniel J. Kleitman 3, Michael Klugerman 3, János Pach 2,4, Leonard J. Schulman 3 Abstract Given a set of points in the plane, a crossing

More information

Part II. Graph Theory. Year

Part II. Graph Theory. Year Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 53 Paper 3, Section II 15H Define the Ramsey numbers R(s, t) for integers s, t 2. Show that R(s, t) exists for all s,

More information

On the number of distinct directions of planes determined by n points in R 3

On the number of distinct directions of planes determined by n points in R 3 On the number of distinct directions of planes determined by n points in R 3 Rom Pinchasi August 27, 2007 Abstract We show that any set of n points in R 3, that is not contained in a plane, determines

More information

Independence and Cycles in Super Line Graphs

Independence and Cycles in Super Line Graphs Independence and Cycles in Super Line Graphs Jay S. Bagga Department of Computer Science Ball State University, Muncie, IN 47306 USA Lowell W. Beineke Department of Mathematical Sciences Indiana University

More information

CS261: A Second Course in Algorithms Lecture #16: The Traveling Salesman Problem

CS261: A Second Course in Algorithms Lecture #16: The Traveling Salesman Problem CS61: A Second Course in Algorithms Lecture #16: The Traveling Salesman Problem Tim Roughgarden February 5, 016 1 The Traveling Salesman Problem (TSP) In this lecture we study a famous computational problem,

More information

Interleaving Schemes on Circulant Graphs with Two Offsets

Interleaving Schemes on Circulant Graphs with Two Offsets Interleaving Schemes on Circulant raphs with Two Offsets Aleksandrs Slivkins Department of Computer Science Cornell University Ithaca, NY 14853 slivkins@cs.cornell.edu Jehoshua Bruck Department of Electrical

More information

Math 443/543 Graph Theory Notes

Math 443/543 Graph Theory Notes Math 443/543 Graph Theory Notes David Glickenstein September 8, 2014 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.

More information

arxiv: v1 [math.co] 12 Dec 2017

arxiv: v1 [math.co] 12 Dec 2017 arxiv:1712.04381v1 [math.co] 12 Dec 2017 Semi-reflexive polytopes Tiago Royer Abstract The Ehrhart function L P(t) of a polytope P is usually defined only for integer dilation arguments t. By allowing

More information

CHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism

CHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented

More information

Chapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:

Chapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below: Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have

More information

AMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12.

AMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12. AMS 550.47/67: Graph Theory Homework Problems - Week V Problems to be handed in on Wednesday, March : 6, 8, 9,,.. Assignment Problem. Suppose we have a set {J, J,..., J r } of r jobs to be filled by a

More information

Weak Dynamic Coloring of Planar Graphs

Weak Dynamic Coloring of Planar Graphs Weak Dynamic Coloring of Planar Graphs Caroline Accurso 1,5, Vitaliy Chernyshov 2,5, Leaha Hand 3,5, Sogol Jahanbekam 2,4,5, and Paul Wenger 2 Abstract The k-weak-dynamic number of a graph G is the smallest

More information

GEODETIC DOMINATION IN GRAPHS

GEODETIC DOMINATION IN GRAPHS GEODETIC DOMINATION IN GRAPHS H. Escuadro 1, R. Gera 2, A. Hansberg, N. Jafari Rad 4, and L. Volkmann 1 Department of Mathematics, Juniata College Huntingdon, PA 16652; escuadro@juniata.edu 2 Department

More information

Bounds on the signed domination number of a graph.

Bounds on the signed domination number of a graph. Bounds on the signed domination number of a graph. Ruth Haas and Thomas B. Wexler September 7, 00 Abstract Let G = (V, E) be a simple graph on vertex set V and define a function f : V {, }. The function

More information

Vertex Magic Total Labelings of Complete Graphs

Vertex Magic Total Labelings of Complete Graphs AKCE J. Graphs. Combin., 6, No. 1 (2009), pp. 143-154 Vertex Magic Total Labelings of Complete Graphs H. K. Krishnappa, Kishore Kothapalli and V. Ch. Venkaiah Center for Security, Theory, and Algorithmic

More information

Rearrangement of DNA fragments: a branch-and-cut algorithm Abstract. In this paper we consider a problem that arises in the process of reconstruction

Rearrangement of DNA fragments: a branch-and-cut algorithm Abstract. In this paper we consider a problem that arises in the process of reconstruction Rearrangement of DNA fragments: a branch-and-cut algorithm 1 C. E. Ferreira 1 C. C. de Souza 2 Y. Wakabayashi 1 1 Instituto de Mat. e Estatstica 2 Instituto de Computac~ao Universidade de S~ao Paulo e-mail:

More information

Geometry. Tropical Secant Varieties of Linear Spaces. Mike Develin. 1. Introduction

Geometry. Tropical Secant Varieties of Linear Spaces. Mike Develin. 1. Introduction Discrete Comput Geom 35:117 129 (2006) DOI: 101007/s00454-005-1182-2 Discrete & Computational Geometry 2005 Springer Science+Business Media, Inc Tropical Secant Varieties of Linear Spaces Mike Develin

More information

An Algorithm for Solving the Traveling Salesman Problem

An Algorithm for Solving the Traveling Salesman Problem JKAU: Eng. Sci.. vol. 4, pp. 117 122 (1412 A.H.l1992 A.D.) An Algorithm for Solving the Traveling Salesman Problem M. HAMED College ofarts and Science, Bahrain University, [sa Town, Bahrain ABSTRACT. The

More information

1 Variations of the Traveling Salesman Problem

1 Variations of the Traveling Salesman Problem Stanford University CS26: Optimization Handout 3 Luca Trevisan January, 20 Lecture 3 In which we prove the equivalence of three versions of the Traveling Salesman Problem, we provide a 2-approximate algorithm,

More information

Theory of Computing. Lecture 10 MAS 714 Hartmut Klauck

Theory of Computing. Lecture 10 MAS 714 Hartmut Klauck Theory of Computing Lecture 10 MAS 714 Hartmut Klauck Seven Bridges of Königsberg Can one take a walk that crosses each bridge exactly once? Seven Bridges of Königsberg Model as a graph Is there a path

More information

Hamiltonian cycles in bipartite quadrangulations on the torus

Hamiltonian cycles in bipartite quadrangulations on the torus Hamiltonian cycles in bipartite quadrangulations on the torus Atsuhiro Nakamoto and Kenta Ozeki Abstract In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple

More information