HAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS Margaret H. Forbush, Elizabeth Hanson, Susan Kim, Andrew Mauer-Oats, Rhian Merris, Jennifer Oats-Sargent
|
|
- Aubrey Arnold
- 5 years ago
- Views:
Transcription
1 HAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS Margaret H. Forbush, Elizabeth Hanson, Susan Kim, Andrew Mauer-Oats, Rhian Merris, Jennifer Oats-Sargent, Seth Oldham, Kate Sharkey, and Dave Witte Abstract. Place a checker in some square of an nn checkerboard. The checker is allowed to step either to the east or to the north, and is allowed to step o the edge of the board in a manner suggested by the usual identication of the edges of the square to form a projective plane. We give an explicit description of all the routes that can be taken by the checker to visit each square exactly once. 1. Introduction Place a checker in some square of an n n checkerboard. The checker is allowed to step (a distance of one square) either to the east or to the north in particular, it does not move diagonally. We ask whether it is possible to move the checker in this manner through a route that visits each square exactly once. We feel free to adopt graph-theoretic terminology whenever it is convenient, so we refer to such a route as a hamiltonian path. It is traditional to allow the checker to step o the edge of the board (otherwise, it is clear that no hamiltonian path exists). Namely, when the checker steps o the east edge of the board, it moves to the westernmost square of the same row; when the checker steps o the north edge of the board, it moves to the southernmost square of the same column. This can be described succinctly by saying that the checkerboard has been made into a torus, by gluing each of its edges to the opposite edge. For these toroidal checkerboards, it is not dicult to see that every square is the starting point of some hamiltonian path, and several authors have studied more delicate properties of paths and cycles in toroidal checkerboards [1], [2], [4], [5], [6], [7]. In this paper, we do not study toroidal checkerboards. Instead, the checker is allowed to step o the edge of the board in a somewhat dierent manner, corresponding to the usual procedure for creating a projective plane by applying a twist when gluing each edge of a square to the opposite edge Denition. The squares of the nn checkerboard can be naturally identied with the set B n of ordered pairs (p; q) of integers with 0 p; q n? 1. Dene E: B n! B n and N: B n! B n by (p; q)e = (p + 1; q) if p < n? 1 (0; n? 1? q) if p = n? 1 Corresponding author: D. Witte. Received September Revised December 1996, August 1997, and February Typeset by AMS-TEX
2 2 MARGARET H. FORBUSH ET AL. (0; 8) (8; 8) (0; 0) (8; 0) (0; 8) (8; 8) (0; 0) (8; 0) and Figure 1. Locations of the initial () and terminal ( ) squares of hamiltonian paths on the 9 9 projective checkerboard. (p; q)n = (p; q + 1) if q < n? 1 (n? 1? p; 0) if q = n? 1 The n n projective checkerboard B n is the digraph whose vertex set is B n, with a directed edge from to E and from to N, for each 2 B n. We usually refer to the vertices of B n as squares. For these projective checkerboards, we show that only certain squares can be the initial square of a hamiltonian path, and only certain squares can be the terminal square. The form of the answer depends on the parity of n; illustrative examples appear in Figures 1 and Notation. For convenience, we let 6n = bn=2c and 6n? = b(n? 1)=2c. Thus, if n is odd, we have 6n = 6n? = (n? 1)=2, whereas, if n is even, we have 6n = n=2 and 6n? = 6n? Theorem. A square (p; q) of B n (with 0 p; q n? 1) is the initial square of a hamiltonian path if and only if either (1) q = 0 and p 6n? ; or (2) q = 6n? and p 6n; or (3) q = 6n and p 6n? ; or (4) p = 0 and q 6n? ; or (5) p = 6n? and q 6n; or (6) p = 6n and q 6n?. It is the terminal square of a hamiltonian path if and only if either (1) q = n? 1 and p 6n; or (2) q = 6n and p 6n? ; or (3) q = 6n? and p 6n; or (4) p = n? 1 and q 6n; or (5) p = 6n and q 6n? ; or (6) p = 6n? and q 6n. Furthermore, we give an explicit description of all the hamiltonian paths in B n. This more detailed result is stated in Section 2, after the necessary terminology has been introduced. The proof is in Section 3.
3 HAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS 3 (0; 9) (9; 9) (0; 0) (9; 0) (0; 9) (9; 9) (0; 0) (9; 0) Figure 2. Locations of the initial () and terminal ( ) squares of hamiltonian paths on the projective checkerboard. 2. Direction-forcing diagonals 2.1. Denition. Dene a symmetric, reexive relation on the set of squares by if fe; Ng \ fe; Ng 6= ;: The equivalence classes of the transitive closure of are direction-forcing diagonals. For short, we refer to them simply as diagonals. Thus, the diagonal containing is f; NE?1 ; (NE?1 ) 2 ; : : : ; EN?1 g: 2.2. Notation. For 2 B n, we let x and y be the components of, that is, = ( x ; y ) Notation. For 0 i 2n? 2, let S i = f 2 B n j x + y = ig Proposition. For each i with 0 i 2n? 3, the set D i = S i [ S 2n?3?i is a diagonal. The only other diagonal D 2n?2 consists of the single square (n? 1; n? 1). Notice that D i = D 2n?3?i if 0 i 2n? Notation. Let D be a diagonal, other than D 2n?2. Then, from Proposition 2.4, we may write D = S a [ S b with a < b. We let D? = S a and D + = S b. To nd the hamiltonian paths in B n, it is helpful to focus attention on the following class of subgraphs of B n, which contains all the hamiltonian paths Denition. A spanning quasi-path is a spanning subdigraph H of B n, such that exactly one component of H is a (directed) path, and each of the other components of H is a (directed) cycle. We usually use to denote the initial square of the path, and to denote the terminal square. Thus, a spanning quasi-path has two distinguished vertices and, such that every square except has indegree 1, and every square except has outdegree 1. The square has indegree 0, and the square has outdegree 0.
4 4 MARGARET H. FORBUSH ET AL Denition. If H is a spanning quasi-path, then the diagonal containing the terminal square is called the terminal diagonal of H. All other diagonals are non-terminal diagonals. The following fundamental propositions, which are used throughout the paper, justify the name direction-forcing diagonal, and reveal the special status of the terminal diagonal. The results are adapted from ideas of Housman [3] Denition. Let H be a spanning quasi-path in B n. A square travels east (in H) if the edge from to E is in H. Similarly, travels north (in H) if the edge from to N is in H Proposition (cf. [1, Lemma 6.4c]). If H is a spanning quasi-path in B n, then, for each non-terminal diagonal D, either every square in D travels north, or every square in D travels east. For short, we say that either D travels north or D travels east Proposition (cf. [1, Lemma 6.4b]). Let T be the terminal diagonal of a spanning quasi-path H in B n, with initial vertex and terminal vertex, and let 2 T. (1) if N 6=, then NE?1 travels east; (2) if E 6=, then EN?1 travels north; (3) if travels east and N 6=, then NE?1 travels east; (4) if travels east, then EN?1 does not travel north; (5) if travels north and E 6=, then EN?1 travels north; and (6) if travels north, then NE?1 does not travel east Corollary (cf. [1, Lemma 6.4a]). If H is a spanning quasi-path in B n, then the diagonal that contains E?1 and N?1 is the terminal diagonal. The following corollary follows from Proposition 2.10 by induction Corollary. Let T be the terminal diagonal of a spanning quasi-path H in B n, with initial vertex and terminal vertex, and let jt j denote the cardinality of T. For each 2 T, there is a unique integer u() 2 f1; 2; : : : ; jt jg with = (NE?1 ) u() ; the square travels east if and only if u() < u(e?1 ). (Similarly, there is a unique integer v() 2 f1; 2; : : : ; jt jg with = E?1 (EN?1 ) v() ; the square travels east if and only if v() < v().) From Corollary 2.12, we see that the location of the initial square and terminal square determine which vertices in the terminal diagonal travel east, and which of them travel north, so we have the following corollary Corollary. A hamiltonian path (or, more generally, a spanning quasi-path) is uniquely determined by specifying (1) its initial vertex; (2) its terminal vertex; and (3) which of its non-terminal diagonals travel east. Our main results determine precisely which choices of (1), (2), and (3) lead to a hamiltonian path, rather than some other spanning quasi-path. The following theorem shows that, to nd the possible initial squares and terminal squares of hamiltonian paths, one need only consider hamiltonian paths of two special types: those in which all non-terminal diagonals travel east, and those in which all non-terminal diagonals travel north.
5 HAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS 5 initial vertex terminal vertex path directions (n? k; 0) 1 k 6n (n? k; 0) 1 k 6n + 1 (6n? k; 6n) (E 2n?1 N) 6n E n?1 (6n + k? 1; 6n) (E 2n?1 N) k?1 E? 2k?2 NE 2i?1 NE 2(n?k?i+1) NE 2k?2 6n?k+1 i=1 (0; n? 1) (6n; 6n) (E 2n?1 N) 6n E n?1 (0; n? 1) (6n; 6n? 1)? N 2 E 2i NE 2(n?i)?1 6n i=1 Figure 3. Some hamiltonian paths in B n, when n is odd (where 6n = (n? 1)=2). All non-terminal diagonals travel east. initial vertex terminal vertex path directions (n? k; 0) 1 k 6n (6n? k; 6n? 1) (E2n?1 N) 6n?1 E 2n?1 (n? k; 0) 1 k 6n (6n + k? 2; 6n) (E 2n?1 N) k?1 E? 2k?2 NE 2i?1 NE 2(n?k?i+1) NE 2k?2 6n?k NE n?2k+1 NE 2k?2 (6n? 1; 0) (n? 1; 6n) (E 2n?1 N) 6n?1 E 2n?1 (0; n? 1) (6n? 1; 6n? 1)? N 2 E 2i NE 2n?2i?1 6n?1 i=1 N 2 E n?1 (0; n? 1) (6n; 6n? 1) (E 2n?1 N) 6n?1 E 2n?1 i=1 Figure 4. Some hamiltonian paths in B n, when n is even (where 6n = n=2). All non-terminal diagonals travel east Theorem. If there is a hamiltonian path from to, then there is a hamiltonian path from to, such that either all non-terminal diagonals travel east, or all non-terminal diagonals travel north. Figures 3 and 4 list several hamiltonian paths. We now dene some simple transformations that can be applied to create additional hamiltonian paths from these Denition. For = ( x ; y ) 2 B n, let ~ = (n? 1? x ; n? 1? y ) be the inverse of, and let = ( y ; x ) be the transpose of Proposition. Let [ 0 ; : : : ; m ] be the sequence of squares visited by a hamiltonian path H in B n, from = 0 to = m. Then the following are also hamiltonian paths in B n : the inverse of H from ~ to ~: [~ m ; ~ m?1 ; : : : ; ~ 0 ]; the transpose of H from to : [ 0 ; : : : ; m];
6 6 MARGARET H. FORBUSH ET AL. the inverse-transpose of H from ~ to ~ : [~ m ; ~ m?1 ; : : : ; ~ 0]. Our main theorem can be stated as follows Main Theorem. If H is any hamiltonian path in B n, such that all nonterminal diagonals travel east, then either H is one of the hamiltonian paths listed in Figures 3 and 4, or H is the inverse of one of these hamiltonian paths. By considering the transposes of these paths, we obtain the following corollary Corollary. If H is any hamiltonian path in B n, such that all non-terminal diagonals travel north, then H is either the transpose or the inverse-transpose of one of the hamiltonian paths listed in Figures 3 and 4. The Main Theorem and its corollary, combined with Theorem 3.6 0, suce to determine all the initial and terminal squares of hamiltonian paths. These conclusions are detailed in Theorem 1.3. By combining the Main Theorem with Proposition 3.3 and Theorem 3.5 below, we obtain the following precise description of the hamiltonian paths in B n, not just those in which all non-terminal diagonals travel the same direction. The point is that all hamiltonian paths can be derived by applying certain simple transformations to the basic paths listed in Figures 3 and Corollary. The following construction always results in a hamiltonian path in B n, and every hamiltonian path can be constructed in this manner. (1) Start with a basic hamiltonian path H 1 from Figure 3 or 4. (2) Write the terminal diagonal of H 1 in the form S a [ S b (with a < b), and let N be any subset of fd j j 0 j < ag. (3) Let H 2 be the spanning quasi-path of B n in which the non-terminal diagonals in N travel north, all the other non-terminal diagonals travel east, and each square in the terminal diagonal travels exactly the same way as it does in H 1. (4) Let H be H 2, or the inverse, or transpose, or inverse-transpose of H 2. Then H is a hamiltonian path in B n.
7 HAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS 7 3. The Main Theorem In this section, we prove Main Theorem Notation. We use [](X 1 X 2 : : : X m ), where X i 2 fe; Ng, to denote the path (or cycle) in B n that visits the squares ; X 1 ; X 1 X 2 ; : : : ; X 1 X 2 : : : X m : Note that a 2 2 projective checkerboard has hamiltonian cycles, namely, the cycles (NNNN) and (EEEE). However, the following theorem shows that this is the only such board; for n > 2, there is no hamiltonian cycle in B n Theorem. On an n n projective checkerboard with n 3, there are no hamiltonian paths with initial square = (0; 0). Therefore, D 2n?2 is not the terminal diagonal of any hamiltonian path in B n. Proof. Suppose H is a hamiltonian path in B n, with initial square = (0; 0). From Corollary 2.11, we see that the terminal square must be (n? 1; n? 1). Let [ 0 ; 1 ; : : : ; m ] be the sequence of squares visited by H. By induction on i, we show that m?i = ~ i (the inverse of i ) for 0 i m. Assume inductively that m?i = ~ i. Suppose, without loss of generality, that i travels east in H. From Proposition 2.4, it is not dicult to see, for all 2 B n, that the squares and ~E?1 are in the same diagonal. Therefore, ~ i E?1 must travel east, as i does. Then, since (~ i E?1 )E = ~ i = m?i, we conclude that ~ i E?1 = m?i?1. Therefore, m?i?1 = ~ i E?1 = g i E = ~ i+1 ; as desired. It is clear that H steps o the edge of the board somewhere, for, otherwise, it could not visit more than 2n? 1 squares. Let (p; q) be the square from which H steps o the edge of the board (the rst time). We may assume, without loss of generality, that p = n? 1, and that H steps east, from n?1+q = (n? 1; q) to n+q = (0; n? 1? q). Then, from the conclusion of the preceding paragraph, we have m?(n?1+q) = ~ n?1+q = (n? 1; q) = (0; n? 1? q) = n+q : Therefore, m? (n? 1 + q) = n + q. Since (p; q) 6= = (n? 1; n? 1) and p = n? 1, we must have q n? 2, so this implies that m = 2n? 1 + 2q 4n? 5. Because n 3, we have 4n? 5 < n 2? 1, so this contradicts the fact that the length of a hamiltonian path must be n 2? 1. Henceforth, we may (and do) always assume that the terminal diagonal T of a hamiltonian path H is not D 2n?2. Therefore, Proposition 2.4 implies that we may write T in the form T = S a [ S b, with a < b Proposition. Suppose the terminal diagonal of a hamiltonian path H is S a [ S b, with a < b. Then all D j, where a < j < b, travel in the same direction. Proof by induction. Given k with a < k < n? 2, suppose that all D j, where k < j n? 2, travel in the same direction, but D k travels in the other direction. Assume without loss of generality that D k travels north and all D j with j > k travel east. Then, letting = (k + 1; 0) 2 S k+1, we see that H contains the cycle [](E 2(n?k)?3 N). This contradicts the fact that H is a path.
8 8 MARGARET H. FORBUSH ET AL. The preceding proposition shows that the \middle" diagonals (that is, those D j with a < j < b) must all travel in the same direction. Theorem 3.5 shows that the other non-terminal diagonals have no eect on whether a spanning quasi-path is a hamiltonian path or not. First, we prove a lemma Lemma. Let H be a spanning quasi-path, with terminal diagonal S a [ S b (where a < b). Let (p; q) 2 S b+1, and let P be the unique path in H that starts at (p; q) and ends in S a, without passing through S a. Then the terminal vertex of P is (n? 1? p; n? 1? q), which is the inverse of (p; q). Proof. Let us begin by showing that P steps o the edge of the board exactly once. Since steps that do not go o the edge of the board move from S k to S k+1, and a < b + 1, it is clear that P steps o the edge of the board at least once. Let be the square from which P steps o the edge of the board (the rst time). If 2 S k, then the square immediately immediately after on P belongs to S 2n?2?k. Since k b + 1 = 2n? 2? a, we have 2n? 2? k a. Therefore, because a < n? 1, we know that P reaches S a before it reaches S n?1, which is the rst subdiagonal from which it is possible to step o the edge of the board. Let [ 0 ; 1 ; ; m ] be the sequence of squares visited by P. We now show that m is odd, that P steps o the edge of the board from (m?1)=2, and that, for 0 i m? 1, the squares i and m?1?i lie on the same diagonal. If P steps o the edge of the board from k, then k 2 S b+1+k, so k+1 2 S 2n?2?(b+1+k). On the other hand, because m 2 S a (and P does not step o the edge of the board between k+1 and m ), we must have k+1 2 S a?(m?k?1). Therefore, 2n? 2? (b k) = a? (m? k? 1): We know, from Proposition 2.4, that a + b = 2n? 3, so this implies m = 2k + 1, which means that m is odd, and that P steps o the edge of the board from (m?1)=2. Furthermore, for i < k, we have i 2 S b+1+i and m?1?i 2 S a?1?i. Since a + b = 2n? 3, we have (b i) + (a? 1? i) = 2n? 3, which means that i and m?1?i lie on the same diagonal, as desired. We are now ready to prove that the terminal square of P is (n? 1? p; n? 1? q). Assume, without loss of generality, that (m?1)=2 travels east. From the preceding paragraph, we know that P steps o the edge of the board from (m?1)=2, so (m?1)=2 must be of the form (m?1)=2 = (n? 1; y). Thus, exactly n? 1? p of the squares 0 ; 1 ; : : : ; (m?3)=2 travel east. Since i and m?1?i are on the same diagonal, then exactly n? 1? p of the squares (m+1)=2 ; (m+3)=2 ; : : : ; m?1 travel east. Similarly, exactly y? q of the squares (m+1)=2 ; : : : ; m?1 travel north. Because (m?1)=2 travels east, o the edge of the board, we have (m+1)=2 = (0; n? 1? y). Then n? 1? p steps east and y? q steps north result in the square (n? 1? p; n? 1? q), as desired Theorem. Let H be a hamiltonian path in B n, with terminal diagonal S a [S b (where a < b), and let H 0 be any spanning quasi-path in B n, with the same initial and terminal squares as H and such that each non-terminal diagonal D j, with a < j < b, travels exactly the same way in H 0 as it does in H. Then H 0 is also a hamiltonian path. Proof. From Proposition 2.10, we see that each square in the terminal diagonal travels exactly the same way in H 0 as it does in H. To show that H 0 is a hamiltonian path, it suces to show that H 0 has no cycles.
9 HAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS 9 Suppose that there is a cycle C 0 in H 0. This cycle cannot be contained in H, so it is not dicult to see that it must contain at least one square in S b+1. We may write C 0 as the concatenation C 0 = P 1 + Q P r + Q 0 r of paths, such that each P i is contained in H \ H 0, and each Q 0 j starts in S b+1 and ends in S a, without passing through S a. Lemma 3.4 shows that, for each j, there is a path Q j in H that starts in S b+1 and ends in S a, without passing through S a, and has the same endpoints as Q 0 j. Then the concatenation C = P 1 + Q P r + Q r is a cycle in H. This is a contradiction Corollary. If there is a hamiltonian path H from an initial square to a terminal square, then there is a hamiltonian path H 0 from to, such that all non-terminal diagonals travel in the same direction. Proof. We may write the terminal diagonal of H in the form T = S a [ S b, with a < b. We know from Proposition 3.3 that all D j where a < j < b travel in the same direction. Assume without loss of generality that they travel east. Let H 0 be the spanning quasi-path of B n in which every non-terminal diagonal travels east, and each square in the terminal diagonal travels exactly the same way as it does in H. Theorem 3.5 shows that H 0 is a hamiltonian path from to. We now embark on the proof of Main Theorem Thus, our goal is to describe precisely which squares can be joined by a hamiltonian path (in which all non-terminal diagonals travel east). To streamline the required case-by-case analysis, we start with a few lemmas. These preliminary results provide helpful information on the locations of initial and terminal squares of hamiltonian paths Lemma. Let T be the terminal diagonal of a hamiltonian path from to, let be the square on T + with y = n? 1, and let be the square on T? with y = 0. (1) Suppose 2 T + and y < n? 1. If some square 2 T? travels east, then both and travel east. (2) Suppose N?1 2 T?. If some square in T + travels east, then both and travel east. (3) Suppose 2 T?. If some square in T + travels north, then travels north. (4) Suppose E?1 2 T +. If some square in T? travels north, then travels north. Proof. We prove only (1), because the other cases are similar. In the notation of Corollary 2.12, it is not dicult to see that u() = n? 1? y = u()? 1 < u() = u()? y u(): Since travels east, we know from Corollary 2.12 that u() < u(e?1 ), so this implies u(); u() < u(e?1 ), so both and travel east Lemma. Let H be a hamiltonian path in B n from to, such that every nonterminal diagonal travels east. Assume n is odd. Let T be the terminal diagonal of H, and let be the square on T + with y = n? 1. Then either: (1) y = 6n; or (2) y = 6n; or (3) travels north, and there is a square on T? with y = 6n, such that = EN?1 ; or
10 10 MARGARET H. FORBUSH ET AL. (4) travels north, and there is a square on T + with y = 6n, such that = N. Proof. Let be the square on T + with y = 6n, if such a square exists; otherwise, let = (n? 1; 6n). Let be the square on T? with y = 6n, if such a square exists; otherwise, let = (0; 6n). We may assume y 6= 6n and y 6= 6n; in particular, f; g \ f; ; E; Eg = ;. Case 1. travels east. Because 6=, the square must travel north, for, otherwise, H contains the cycle [](E n ). (Note that, because all non-terminal diagonals travel east, this implies 2 T +.) Since 6= E, we see from Proposition 2.10 that EN?1 must also travel north. Therefore 6= (n? 1; 6n), for, otherwise, H contains the cycle [](NENE n?1 ). Therefore n? x? 2 0, so (n? x? 2; 6n) is a square of B n. Then Proposition 2.4 implies (n? x? 2; 6n) 2 T?, so we have 2 T?. We must have EN?1 =, for, otherwise, Proposition 2.10 implies that EN?1 travels east, which would mean that H contains the cycle [](NE n+1 NE n?1 ). Hence Lemma 3.7(3) implies conclusion (3) holds. Case 2. travels north. (Note that 2 T?, so Proposition 2.4 implies (n? x? 2; 6n) 2 T +, which means 2 T +.) Since 6= E, we see from Proposition 2.10 that EN?1 travels north, as does. Then, since 6=, we see that must travel east, for, otherwise, H contains the cycle [E](E x?x?1 NE n?x+x+1 N): However, NE?1 does not travel east, for, otherwise, H contains the cycle [](NE n+1 NE n?1 ): Therefore, Proposition 2.10 implies N =. Hence Lemma 3.7(4) implies conclusion (4) holds Lemma. Let H be a hamiltonian path in B n, such that every non-terminal diagonal travels east. Assume n is even. Let T be the terminal diagonal of H, let be the square on T + with y = n? 1, and let be the square on T? with y = 0. Then either: (1) y = 6n and x 6n? 1; or (2) y = 6n? 1 and x 6n; or (3) y = 6n and x 6n? 1; or (4) y = 6n? 1 and x 6n; or (5) T 6= D n?1, and both and travel east. Proof. Let be the square on T + with y = 6n, if such a square exists; otherwise, let = (n? 1; 6n). Let be the square on T? with y = 6n? 1, if such a square exists; otherwise, let = (0; 6n? 1). We may assume f; g \ f; g = ;, for, otherwise, one of conclusions (1){(4) holds. Case 1. travels north. Note that we must have 2 T?, because all nonterminal diagonals travel east. Then we conclude from Proposition 2.4 that (n? 2? x ; 6n) 2 T +, so 2 T + and x < n? 1. The square must travel north, for, otherwise, H contains the cycle [](NE n ). We may assume that EN?1 travels north, as does, for, otherwise, we see from Proposition 2.10 that = E, which implies that conclusion (2) holds. Similarly,
11 HAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS 11 we may assume that EN?1 travels north, as does, for, otherwise, we must have = E, which implies that conclusion (1) holds. Hence, H contains the cycle [](NE x?x NE n?x+x+1 NE x?x NE n?x+x?1 ): Case 2. travels east. Let 0 be the square on T + with 0 y = 6n? 1, if such a square exists; otherwise, let 0 = (n? 1; 6n? 1). Suppose 0 =. (Note that Proposition 2.4 then implies (n?1? 0 x ; 6n?1) 2 T?, so 2 T?.) We may assume T 6= D n?1, for, otherwise, this implies that = (6n; 6n? 1), so conclusion (4) holds. Furthermore, we may assume that 0 NE?1 travels east, for, otherwise, Proposition 2.10 implies = 0 N, in which case conclusion (1) holds. Therefore, Lemma 3.7(1) implies that and also travel east, so conclusion (5) holds. We may now assume 0 6=. Then 0 must travel east, for, otherwise, H contains the cycle [ 0 ](NE n ). Suppose NE?1 does not travel east. Then 2 T?, and, because travels east, we must have = N. Therefore, we may assume T 6= D n?1, for, otherwise, we have = (6n? 1; 6n), so conclusion (1) holds. Since 2 T?, Proposition 2.4 implies (n? 1? x ; 6n? 1) 2 T +, so 0 2 T +. Therefore, Lemma 3.7(2) implies that conclusion (5) holds. We may now assume NE?1 travels east. Furthermore, we may assume that 0 NE?1 travels east, as 0 does, for, otherwise, we see from Proposition 2.10 that 0 N =, which implies that conclusion (1) holds. Also, we may assume that 0 N travels north, for, otherwise, either conclusion (3) holds (if 0 N = ) or H contains the cycle [](E 2n ) (if 0 N travels east). Because all non-terminal diagonals travel east, this implies 0 N 2 T +, so 0 N =. Then it is clear that 0 62 T +, so we must have 0 = (n? 1; 6n? 1), which means = (n? 1; 6n). Therefore, E = 6=, so Proposition 2.10 implies that N?1 = EN?1 travels north, as does. Therefore, H contains the cycle [](E 2n?1 NEN) Lemma. Let H be a hamiltonian path in which all non-terminal diagonals travel east, and = (n? 1; 0). If n is odd, then 2 f(6n; 6n); (6n; 6n + 1)g. If n is even, then 2 f(6n? 1; 6n); (6n; 6n)g. Proof. We consider two cases. Case 1. n is odd. Let = (6n? 1; 6n) and = (6n; 6n). We have y = 0 6= 6n and 6= EN?1, so we see from Lemma 3.8 that either y = 6n or = N = (6n; 6n + 1). Thus, we may assume y = 6n, and we wish to show = (6n; 6n). Because 2 D n?1, we see from Corollary 2.11 that N?1 2 D n?1 = S n?2 [ S n?1. Thus, 2 f(6n; 6n); (6n + 1; 6n)g. If = (6n + 1; 6n), then H contains the cycle [E?1 ](NE n N). Case 2. n is even. If n = 2, the desired conclusion may be veried directly, so we may assume n > 2. Since y = 0 6= 6n, and x = n? 1 > 6n, and T = D n?1, we see that either (1) or (2) of Lemma 3.9 holds. Then, since we must have N?1 2 D n?1, we conclude that 2 f(6n; 6n); (6n? 1; 6n); (6n; 6n? 1)g. However, if = (6n; 6n? 1), then H contains the cycle [E?1 ](NE n ). By considering the inverses of these hamiltonian paths, we obtain the following corollary.
12 12 MARGARET H. FORBUSH ET AL Corollary. Let H be a hamiltonian path in which all non-terminal diagonals travel east, and = (0; n? 1). If n is odd, then 2 f(6n; 6n); (6n; 6n? 1)g. If n is even, then 2 f(6n? 1; 6n? 1); (6n; 6n? 1)g Main Theorem. Let and be two squares on the nn projective checkerboard B n, with n 3. There is a hamiltonian path from to in which all nonterminal diagonals travel east if and only if is in the diagonal containing N?1 and either: (1) n is odd and: (a) y = 0 and x 6n and y = 6n; or (b) = (0; n? 1) and 2 f(6n; 6n); (6n; 6n? 1)g; or (c) y = n? 1 and x 6n and y = 6n; or (d) = (n? 1; 0) and 2 f(6n; 6n); (6n; 6n + 1)g; or (2) n is even and: (a) y = 0 and x 6n? 1 and either: (i) y = 6n? 1 and x 6n? 1; or (ii) y = 6n and x 6n? 1; or (b) = (0; n? 1) and 2 f(6n? 1; 6n? 1); (6n; 6n? 1)g; or (c) y = n? 1 and x 6n and either: (i) y = 6n and x 6n; or (ii) y = 6n? 1 and x 6n; or (d) = (n? 1; 0) and 2 f(6n? 1; 6n); (6n; 6n)g. Furthermore, such a hamiltonian path is unique, if it exists. Proof. If and are as specied, then the desired hamiltonian path from to either appears explicitly in Figure 3 or Figure 4 (in cases 1a, 1b, 2a, and 2b), or is the inverse of a hamiltonian path in Figure 3 or Figure 4 (in cases 1c, 1d, 2c, and 2d). The uniqueness follows from Corollary Now suppose there is a hamiltonian path H from to, such that all nonterminal diagonals travel east. Let T be the terminal diagonal of H, let be the square on T + with y = n?1, and let = (n?1; 0). From Corollary 2.11, we know that N?1 2 T. From Lemmas 3.8 and 3.9, we see that it is not possible to have both = and y = 0, so we may assume 6=. (If =, replace H with its inverse ~ H. Note that if ~ H satises condition 1a or 2a, then H satises condition 1c or 2c, respectively.) Case 1. T 6= D n?1. The square must travel east, for, otherwise, H contains the cycle [](NE 2x+1 ). Let be the square on T? with y = 0. We see that does not travel east, for, otherwise, H contains the cycle [](E 2n ). Then, since EN?1 = travels east, but does not, we conclude from Proposition 2.10 that = E. (In particular, y = 0.) Suppose n is odd. Then, because does not travel north, we see from Lemma 3.8 that y = 6n. Therefore, since 0 x n?1, we have x + y 6n and 2n?3?( x + y ) 6n? 1. Then, since 2 T, and y = 0, Proposition 2.4 implies x 6n? 1, so x 6n. Hence, conclusion 1a holds. Now suppose n is even. Note that 62 f(6n; 6n? 1); (6n? 1; 6n); (6n? 1; 6n? 1)g;
13 HAMILTONIAN PATHS IN PROJECTIVE CHECKERBOARDS 13 because T 6= D n?1. Then, because y = 0 =2 f6n; 6n? 1g and does not travel east, we see from Lemma 3.9 that either (1) y = 6n and x 6n; or (2) y = 6n? 1 and x 6n? 2. Therefore, x + y 6n? 1 and 2n? 3? ( x + y ) 6n? 2. Then, since E?1 2 T (and y = 0), Proposition 2.4 implies x?1 6n?2. Therefore, conclusion 2a holds. Case 2. T = D n?1 and travels north. Note that = (0; n? 1). We know that does not travel east, for otherwise H contains the cycle [](NE). If =, then Lemma 3.10 implies that conclusion 1d or 2d holds. We may now assume travels north. We see immediately that N?1 does not travel north, for, otherwise, H contains the cycle [](NNEN). Thus, E?1 = travels north, but N?1 does not, so Proposition 2.10 implies =. Hence, Corollary 3.11 implies that conclusion 1b or 2b holds. Case 3. T = D n?1 and travels east. We may assume 6=, for, otherwise, Lemma 3.10 implies that conclusion 1d or 2d holds. Therefore, travels either north or east. Suppose =. If n is odd, then Lemma 3.8 implies that conclusion 1a holds, whereas, if n is even, then Lemma 3.9 implies either that conclusion 2a holds, or that = (6n; 6n? 1). (If n is even, note that 6= (6n; 6n), because (6n; 6n) =2 D n?1.) However, in the latter case, H would contain the cycle [E?1 ](NE n ). Thus, we henceforth assume 6=. Suppose travels east. Let = E?1. Since the square EN?1 = travels east, and E = 6=, we see from Proposition 2.10 that that also travels east. Thus, H contains the cycle [](E 2n ). We may now assume travels north. Furthermore, we may assume 6=, for, otherwise, Corollary 3.11 implies that conclusion 1b or 2b holds. Then, since travels north, and E = 6=, Proposition 2.10 implies that EN?1 also travels north. Similarly, since travels east, and N = 6=, it must be the case that NE?1 also travels east. Thus, H contains the cycle [](E 2n?1 NEN). Acknowledgments. This research was partially supported by grants from the National Science Foundation and the New England Consortium for Undergraduate Science Education. Many helpful comments on the manuscript were received from Stephen Curran and an anonymous referee. References 1. S. J. Curran and D. Witte, Hamilton paths in cartesian products of directed cycles, Ann. Discrete Math. 27 (1985), 35{ J. A. Gallian and D. Witte, When the cartesian product of directed cycles is hyperhamiltonian, J. Graph Theory 11 (1987), 21{ D. Housman, Enumeration of hamiltonian paths in Cayley diagrams, Aequationes Math. 23 (1981), 80{ D. S. Jungreis, Generalized hamiltonian circuits in the cartesian product of two directed cycles, J. Graph Theory 12 (1988), 113{ L. E. Penn and D. Witte, When the cartesian product of directed cycles is hypohamiltonian, J. Graph Theory 7 (1983), 441{ W. T. Trotter and P. Erdos, When the cartesian product of directed cycles is hamiltonian, J. Graph Theory 2 (1978), 137{142.
14 14 MARGARET H. FORBUSH ET AL. 7. A. M. Wilkinson, Circuits in Cayley digraphs of nite abelian groups,, J. Graph Theory 14 (1990), 111{116. Department of Mathematics, Williams College, Williamstown, MA Department of Mathematics, Virginia Military Institute, Lexington, VA Department of Mathematics, Williams College, Williamstown, MA Department of Mathematics, Williams College, Williamstown, MA Department of Mathematics, Williams College, Williamstown, MA Department of Mathematics, Williams College, Williamstown, MA Department of Mathematics, Middlebury College, Middlebury, VT Department of Mathematics, Williams College, Williamstown, MA Department of Mathematics, Williams College, Williamstown, MA Current address: Department of Mathematics, Oklahoma State University, Stillwater, OK address:
On non-hamiltonian circulant digraphs of outdegree three
On non-hamiltonian circulant digraphs of outdegree three Stephen C. Locke DEPARTMENT OF MATHEMATICAL SCIENCES, FLORIDA ATLANTIC UNIVERSITY, BOCA RATON, FL 33431 Dave Witte DEPARTMENT OF MATHEMATICS, OKLAHOMA
More informationHamiltonian circuits in Cayley digraphs. Dan Isaksen. Wayne State University
Hamiltonian circuits in Cayley digraphs Dan Isaksen Wayne State University 1 Digraphs Definition. A digraph is a set V and a subset E of V V. The elements of V are called vertices. We think of vertices
More informationHamiltonian cycles in circulant digraphs with jumps 2, 3, c [We need a real title???]
Hamiltonian cycles in circulant digraphs with jumps,, c [We need a real title???] Abstract [We need an abstract???] 1 Introduction It is not known which circulant digraphs have hamiltonian cycles; this
More informationLocke and Witte in [9] presented a class of circulant nonhamiltonian oriented graphs of type Cay(Z 2k ; a; b; b + k) Theorem 1 (Locke,Witte [9, Thm 41
Arc Reversal in Nonhamiltonian Circulant Oriented Graphs Jozef Jirasek Department of Computer Science P J Safarik University Kosice, Slovakia jirasek@kosiceupjssk 8 March 2001 Abstract Locke and Witte
More informationHamiltonian Paths in Cartesian Powers of Directed Cycles
Graphs and Combinatorics (2003) 19:459466 Digital Object Identifier (DOI) 10.1007/~00373-002-05 19-3 Graphs and Combinatorics @ Springer-Verlag 2003 Hamiltonian Paths in Cartesian Powers of Directed Cycles
More information2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS
Volume 7, Number 1, Pages 41 47 ISSN 1715-0868 2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS DAVE WITTE MORRIS Abstract. Suppose G is a nilpotent, finite group. We show that if
More informationMultipartite tournaments with small number of cycles
Multipartite tournaments with small number of cycles Gregory Gutin and Arash Rafiey Department of Computer Science Royal Holloway, University of London Egham, Surrey, TW20 0EX, UK Gutin(Arash)@cs.rhul.ac.uk
More information1 Introduction We adopt the terminology of [1]. Let D be a digraph, consisting of a set V (D) of vertices and a set E(D) V (D) V (D) of edges. For a n
HIGHLY ARC-TRANSITIVE DIGRAPHS WITH NO HOMOMORPHISM ONTO Z Aleksander Malnic 1 Dragan Marusic 1 IMFM, Oddelek za matematiko IMFM, Oddelek za matematiko Univerza v Ljubljani Univerza v Ljubljani Jadranska
More informationON HAMILTON CIRCUITS IN CAYLEY DIGRAPHS OVER GENERALIZED DIHEDRAL GROUPS
REVISTA DE LA UNIÓN MATEMÁTICA ARGENTINA Vol. 53, No. 2, 2012, 79 87 ON HAMILTON CIRCUITS IN CAYLEY DIGRAPHS OVER GENERALIZED DIHEDRAL GROUPS ADRIÁN PASTINE AND DANIEL JAUME Abstract. In this paper we
More informationn 2 R. SHAW Department of Mathematics, University of Hull, Hull HU6 7RX, United Kingdom 19 August 2005
The Grassmannian G 1;n; has polynomial degree 1 n R. SHAW r.shaw@hull.ac.uk Department of Mathematics, University of Hull, Hull HU6 7RX, United Kingdom 19 August 005 Abstract The Grassmannian G 1;n; of
More informationMinimal enumerations of subsets of a nite set and the middle level problem
Discrete Applied Mathematics 114 (2001) 109 114 Minimal enumerations of subsets of a nite set and the middle level problem A.A. Evdokimov, A.L. Perezhogin 1 Sobolev Institute of Mathematics, Novosibirsk
More informationarxiv: v3 [math.co] 4 Apr 2011
Also available on http://amc.imfm.si ARS MATHEMATICA CONTEMPORANEA x xxxx) 1 x Hamiltonian cycles in Cayley graphs whose order has few prime factors arxiv:1009.5795v3 [math.co] 4 Apr 2011 K. Kutnar University
More informationAbstract. We show that a proper coloring of the diagram of an interval order I may require 1 +
Colorings of Diagrams of Interval Orders and -Sequences of Sets STEFAN FELSNER 1 and WILLIAM T. TROTTER 1 Fachbereich Mathemati, TU-Berlin, Strae des 17. Juni 135, 1000 Berlin 1, Germany, partially supported
More informationElementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),
Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes
More informationGeneralized Cayley Digraphs
Pure Mathematical Sciences, Vol. 1, 2012, no. 1, 1-12 Generalized Cayley Digraphs Anil Kumar V. Department of Mathematics, University of Calicut Malappuram, Kerala, India 673 635 anilashwin2003@yahoo.com
More informationOn Hamilton Decompositions of Infinite Circulant Graphs
On Hamilton Decompositions of Infinite Circulant Graphs Darryn Bryant 1, Sarada Herke 1, Barbara Maenhaut 1, and Bridget Webb 2 1 School of Mathematics and Physics, The University of Queensland, QLD 4072,
More informationTHE REAL POSITIVE DEFINITE COMPLETION PROBLEM. WAYNE BARRETT**, CHARLES R. JOHNSONy and PABLO TARAZAGAz
THE REAL POSITIVE DEFINITE COMPLETION PROBLEM FOR A SIMPLE CYCLE* WAYNE BARRETT**, CHARLES R JOHNSONy and PABLO TARAZAGAz Abstract We consider the question of whether a real partial positive denite matrix
More informationMath 42, Discrete Mathematics
c Fall 2018 last updated 12/05/2018 at 15:47:21 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More information10.4 The Kruskal Katona theorem
104 The Krusal Katona theorem 141 Example 1013 (Maximum weight traveling salesman problem We are given a complete directed graph with non-negative weights on edges, and we must find a maximum weight Hamiltonian
More informationHamiltonicity of digraphs for universal cycles of permutations
Hamiltonicity of digraphs for universal cycles of permutations Garth Isaak Abstract The digraphs P (n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k +
More informationNordhaus-Gaddum Theorems for k-decompositions
Nordhaus-Gaddum Theorems for k-decompositions Western Michigan University October 12, 2011 A Motivating Problem Consider the following problem. An international round-robin sports tournament is held between
More informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More information2 JOHAN JONASSON we address in this paper is if this pattern holds for any nvertex graph G, i.e. if the product graph G k is covered faster the larger
An upper bound on the cover time for powers of graphs Johan Jonasson Chalmers University of Technology January 14, 1999 Abstract It is shown that if G is any connected graph on n vertices, then the cover
More informationHAMILTONICITY IN CAYLEY GRAPHS AND DIGRAPHS OF FINITE ABELIAN GROUPS.
HAMILTONICITY IN CAYLEY GRAPHS AND DIGRAPHS OF FINITE ABELIAN GROUPS. MARY STELOW Abstract. Cayley graphs and digraphs are introduced, and their importance and utility in group theory is formally shown.
More informationARTICLE IN PRESS Theoretical Computer Science ( )
Theoretical Computer Science ( ) Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Conditional matching preclusion for hypercube-like
More informationCounting and Constructing Minimal Spanning Trees. Perrin Wright. Department of Mathematics. Florida State University. Tallahassee, FL
Counting and Constructing Minimal Spanning Trees Perrin Wright Department of Mathematics Florida State University Tallahassee, FL 32306-3027 Abstract. We revisit the minimal spanning tree problem in order
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationErdös-Ko-Rado theorems for chordal and bipartite graphs
Erdös-Ko-Rado theorems for chordal and bipartite graphs arxiv:0903.4203v2 [math.co] 15 Jul 2009 Glenn Hurlbert and Vikram Kamat School of Mathematical and Statistical Sciences Arizona State University,
More informationk-degenerate Graphs Allan Bickle Date Western Michigan University
k-degenerate Graphs Western Michigan University Date Basics Denition The k-core of a graph G is the maximal induced subgraph H G such that δ (H) k. The core number of a vertex, C (v), is the largest value
More informationOn the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
More informationPacking and decomposition of graphs with trees
Packing and decomposition of graphs with trees Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel. e-mail: raphy@math.tau.ac.il Abstract Let H be a tree on h 2 vertices.
More informationA graph theoretic approach to matrix inversion by partitioning
Numerische Mathematik 4, t 28-- t 35 (1962) A graph theoretic approach to matrix inversion by partitioning By FRANK HARARY Abstract Let M be a square matrix whose entries are in some field. Our object
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationSpurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics
UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics
More informationHighly Hamiltonian Graphs and Digraphs
Western Michigan University ScholarWorks at WMU Dissertations Graduate College 6-017 Highly Hamiltonian Graphs and Digraphs Zhenming Bi Western Michigan University, zhenmingbi@gmailcom Follow this and
More informationPlanar Graphs (1) Planar Graphs (3) Planar Graphs (2) Planar Graphs (4)
S-72.2420/T-79.5203 Planarity; Edges and Cycles 1 Planar Graphs (1) Topological graph theory, broadly conceived, is the study of graph layouts. Contemporary applications include circuit layouts on silicon
More informationLecture 1. Toric Varieties: Basics
Lecture 1. Toric Varieties: Basics Taras Panov Lomonosov Moscow State University Summer School Current Developments in Geometry Novosibirsk, 27 August1 September 2018 Taras Panov (Moscow University) Lecture
More informationBounds on the Traveling Salesman Problem
Bounds on the Traveling Salesman Problem Sean Zachary Roberson Texas A&M University MATH 613, Graph Theory A common routing problem is as follows: given a collection of stops (for example, towns, stations,
More informationAnalysis on Graphs. Alexander Grigoryan Lecture Notes. University of Bielefeld, WS 2011/12
Analysis on Graphs Alexander Grigoryan Lecture Notes University of Bielefeld, WS 0/ Contents The Laplace operator on graphs 5. The notion of a graph............................. 5. Cayley graphs..................................
More informationPancyclic out-arcs of a vertex in tournaments
Discrete Applied Mathematics 99 (2000) 245 249 Pancyclic out-arcs of a vertex in tournaments Tianxing Yao a, Yubao Guo b; ;1, Kemin Zhang a a Department of Mathematics, Nanjing University, Nanjing 210008,
More informationLongest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs Gregory Gutin Department of Mathematical Sciences Brunel, The University of West London Uxbridge, Middlesex,
More informationTHREE GENERALIZATIONS OF WEYL'S DENOMINATOR FORMULA. Todd Simpson Tred Avon Circle, Easton, MD 21601, USA.
THREE GENERALIZATIONS OF WEYL'S DENOMINATOR FORMULA Todd Simpson 7661 Tred Avon Circle, Easton, MD 1601, USA todo@ora.nobis.com Submitted: July 8, 1995; Accepted: March 15, 1996 Abstract. We give combinatorial
More informationINTERVAL PARTITIONS AND STANLEY DEPTH
INTERVAL PARTITIONS AND STANLEY DEPTH CSABA BIRÓ, DAVID M. HOWARD, MITCHEL T. KELLER, WILLIAM. T. TROTTER, AND STEPHEN J. YOUNG Abstract. In this paper, we answer a question posed by Herzog, Vladoiu, and
More informationA DETERMINANT PROPERTY OF CATALAN NUMBERS. 1. Introduction
A DETERMINANT PROPERTY OF CATALAN NUMBERS M E MAYS AND JERZY WOJCIECHOWSKI Abstract Catalan numbers arise in a family of persymmetric arrays with determinant 1 The demonstration involves a counting result
More informationPaths with two blocks in n-chromatic digraphs
Paths with two blocks in n-chromatic digraphs L. Addario-Berry, F. Havet and S. Thomassé September 20, 2005 Abstract We show that every oriented path of order n 4 with two blocks is contained in every
More informationOn a kind of restricted edge connectivity of graphs
Discrete Applied Mathematics 117 (2002) 183 193 On a kind of restricted edge connectivity of graphs Jixiang Meng a; ;1, Youhu Ji b a Department of Mathematics, Xinjiang University, Urumqi 830046, Xinjiang,
More informationPaths and cycles in extended and decomposable digraphs
Paths and cycles in extended and decomposable digraphs Jørgen Bang-Jensen Gregory Gutin Department of Mathematics and Computer Science Odense University, Denmark Abstract We consider digraphs called extended
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationLecture 15 - NP Completeness 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 29, 2018 Lecture 15 - NP Completeness 1 In the last lecture we discussed how to provide
More informationLifting to non-integral idempotents
Journal of Pure and Applied Algebra 162 (2001) 359 366 www.elsevier.com/locate/jpaa Lifting to non-integral idempotents Georey R. Robinson School of Mathematics and Statistics, University of Birmingham,
More informationCoins with arbitrary weights. Abstract. Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to
Coins with arbitrary weights Noga Alon Dmitry N. Kozlov y Abstract Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to decide if all the m given coins have the
More informationPROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS
PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix
More informationJohn P.F.Sum and Peter K.S.Tam. Hong Kong Polytechnic University, Hung Hom, Kowloon.
Note on the Maxnet Dynamics John P.F.Sum and Peter K.S.Tam Department of Electronic Engineering, Hong Kong Polytechnic University, Hung Hom, Kowloon. April 7, 996 Abstract A simple method is presented
More informationPrimitive Digraphs with Smallest Large Exponent
Primitive Digraphs with Smallest Large Exponent by Shahla Nasserasr B.Sc., University of Tabriz, Iran 1999 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationarxiv:math/ v1 [math.rt] 1 Jul 1996
SUPERRIGID SUBGROUPS OF SOLVABLE LIE GROUPS DAVE WITTE arxiv:math/9607221v1 [math.rt] 1 Jul 1996 Abstract. Let Γ be a discrete subgroup of a simply connected, solvable Lie group G, such that Ad G Γ has
More information1 I A Q E B A I E Q 1 A ; E Q A I A (2) A : (3) A : (4)
Latin Squares Denition and examples Denition. (Latin Square) An n n Latin square, or a latin square of order n, is a square array with n symbols arranged so that each symbol appears just once in each row
More informationAUTOMORPHISM GROUPS OF CIRCULANT DIGRAPHS WITH APPLICATIONS TO SEMIGROUP THEORY
AUTOMORPHISM GROUPS OF CIRCULANT DIGRAPHS WITH APPLICATIONS TO SEMIGROUP THEORY Abstract. We characterize the automorphism groups of circulant digraphs whose connection sets are relatively small, and of
More informationOn graphs having a unique minimum independent dominating set
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(3) (2017), Pages 357 370 On graphs having a unique minimum independent dominating set Jason Hedetniemi Department of Mathematical Sciences Clemson University
More informationThe Chvátal-Erdős condition for supereulerian graphs and the hamiltonian index
The Chvátal-Erdős condition for supereulerian graphs and the hamiltonian index Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 6506, U.S.A. Huiya Yan Department of Mathematics
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More informationMedian orders of tournaments: a tool for the second neighbourhood problem and Sumner s conjecture.
Median orders of tournaments: a tool for the second neighbourhood problem and Sumner s conjecture. Frédéric Havet and Stéphan Thomassé Laboratoire LaPCS, UFR de Mathématiques, Université Claude Bernard
More informationContents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces
Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v 250) Contents 2 Vector Spaces 1 21 Vectors in R n 1 22 The Formal Denition of a Vector Space 4 23 Subspaces 6 24 Linear Combinations and
More information16 February 2010 Draft Version
Local Tournaments with the minimum number of Hamiltonian cycles or cycles of length three Dirk Meierling Lehrstuhl II für Mathematik, RWTH Aachen University, 52056 Aachen, Germany e-mail: meierling@math2.rwth-aachen.de
More informationCyclic Path Covering Number of Euler Graphs
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-3200 Volume 4, Number 4 (2012), pp. 465 473 International Research Publication House http://www.irphouse.com Cyclic Path Covering
More informationProperly colored Hamilton cycles in edge colored complete graphs
Properly colored Hamilton cycles in edge colored complete graphs N. Alon G. Gutin Dedicated to the memory of Paul Erdős Abstract It is shown that for every ɛ > 0 and n > n 0 (ɛ), any complete graph K on
More informationOdd-order Cayley graphs with commutator subgroup of order pq are hamiltonian
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 8 (2015) 1 28 Odd-order Cayley graphs with commutator subgroup of order
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationDiscrete Mathematics
Discrete Mathematics 309 (009) 3811 380 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Disjoint hamiltonian cycles in bipartite graphs Michael
More informationArithmetic properties of the adjacency matrix of quadriculated disks
Arithmetic properties of the adjacency matrix of quadriculated disks arxiv:math/00762v2 [mathco] 3 Aug 2003 Nicolau C Saldanha and Carlos Tomei December 22, 203 Abstract Let be a bicolored quadriculated
More informationGraphs with large maximum degree containing no odd cycles of a given length
Graphs with large maximum degree containing no odd cycles of a given length Paul Balister Béla Bollobás Oliver Riordan Richard H. Schelp October 7, 2002 Abstract Let us write f(n, ; C 2k+1 ) for the maximal
More informationTHE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS
Discussiones Mathematicae Graph Theory 27 (2007) 507 526 THE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS Michael Ferrara Department of Theoretical and Applied Mathematics The University
More informationWritten Qualifying Exam. Spring, Friday, May 22, This is nominally a three hour examination, however you will be
Written Qualifying Exam Theory of Computation Spring, 1998 Friday, May 22, 1998 This is nominally a three hour examination, however you will be allowed up to four hours. All questions carry the same weight.
More informationAbstract This work is a survey on decidable and undecidable problems in matrix theory. The problems studied are simply formulated, however most of the
Decidable and Undecidable Problems in Matrix Theory Vesa Halava University of Turku, Department of Mathematics, FIN-24 Turku, Finland vehalava@utu. Supported by the Academy of Finland under the grant 447
More information1. CONFIGURATIONS We assume familiarity with [1]. The purpose of this manuscript is to provide more details about the proof of [1, theorem (3.2)]. As
REDUCIBILITY IN THE FOUR-COLOR THEOREM Neil Robertson 1 Department of Mathematics Ohio State University 231 W. 18th Ave. Columbus, Ohio 43210, USA Daniel P. Sanders 2 School of Mathematics Georgia Institute
More informationBack circulant Latin squares and the inuence of a set. L F Fitina, Jennifer Seberry and Ghulam R Chaudhry. Centre for Computer Security Research
Back circulant Latin squares and the inuence of a set L F Fitina, Jennifer Seberry and Ghulam R Chaudhry Centre for Computer Security Research School of Information Technology and Computer Science University
More informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More informationDenition 2: o() is the height of the well-founded relation. Notice that we must have o() (2 ) +. Much is known about the possible behaviours of. For e
Possible behaviours for the Mitchell ordering James Cummings Math and CS Department Dartmouth College Hanover NH 03755 January 23, 1998 Abstract We use a mixture of forcing and inner models techniques
More informationUniquely 2-list colorable graphs
Discrete Applied Mathematics 119 (2002) 217 225 Uniquely 2-list colorable graphs Y.G. Ganjali a;b, M. Ghebleh a;b, H. Hajiabolhassan a;b;, M. Mirzazadeh a;b, B.S. Sadjad a;b a Institute for Studies in
More information2 Definitions We begin by reviewing the construction and some basic properties of squeezed balls and spheres [5, 7]. For an integer n 1, let [n] denot
Squeezed 2-Spheres and 3-Spheres are Hamiltonian Robert L. Hebble Carl W. Lee December 4, 2000 1 Introduction A (convex) d-polytope is said to be Hamiltonian if its edge-graph is. It is well-known that
More informationADDENDUM B: CONSTRUCTION OF R AND THE COMPLETION OF A METRIC SPACE
ADDENDUM B: CONSTRUCTION OF R AND THE COMPLETION OF A METRIC SPACE ANDREAS LEOPOLD KNUTSEN Abstract. These notes are written as supplementary notes for the course MAT11- Real Analysis, taught at the University
More informationAutomorphism groups of wreath product digraphs
Automorphism groups of wreath product digraphs Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 39762 USA dobson@math.msstate.edu Joy
More informationTHE MAXIMAL SUBGROUPS AND THE COMPLEXITY OF THE FLOW SEMIGROUP OF FINITE (DI)GRAPHS
THE MAXIMAL SUBGROUPS AND THE COMPLEXITY OF THE FLOW SEMIGROUP OF FINITE (DI)GRAPHS GÁBOR HORVÁTH, CHRYSTOPHER L. NEHANIV, AND KÁROLY PODOSKI Dedicated to John Rhodes on the occasion of his 80th birthday.
More informationEvery 4-connected line graph of a quasi claw-free graph is hamiltonian connected
Discrete Mathematics 308 (2008) 532 536 www.elsevier.com/locate/disc Note Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected Hong-Jian Lai a, Yehong Shao b, Mingquan Zhan
More informationDisjoint Hamiltonian Cycles in Bipartite Graphs
Disjoint Hamiltonian Cycles in Bipartite Graphs Michael Ferrara 1, Ronald Gould 1, Gerard Tansey 1 Thor Whalen Abstract Let G = (X, Y ) be a bipartite graph and define σ (G) = min{d(x) + d(y) : xy / E(G),
More informationExcluding a Long Double Path Minor
journal of combinatorial theory, Series B 66, 1123 (1996) article no. 0002 Excluding a Long Double Path Minor Guoli Ding Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana 70803
More informationGraceful Tree Conjecture for Infinite Trees
Graceful Tree Conjecture for Infinite Trees Tsz Lung Chan Department of Mathematics The University of Hong Kong, Pokfulam, Hong Kong h0592107@graduate.hku.hk Wai Shun Cheung Department of Mathematics The
More informationThe super line graph L 2
Discrete Mathematics 206 (1999) 51 61 www.elsevier.com/locate/disc The super line graph L 2 Jay S. Bagga a;, Lowell W. Beineke b, Badri N. Varma c a Department of Computer Science, College of Science and
More informationACYCLIC DIGRAPHS GIVING RISE TO COMPLETE INTERSECTIONS
ACYCLIC DIGRAPHS GIVING RISE TO COMPLETE INTERSECTIONS WALTER D. MORRIS, JR. ABSTRACT. We call a directed acyclic graph a CIdigraph if a certain affine semigroup ring defined by it is a complete intersection.
More informationEMBEDDED PATHS AND CYCLES IN FAULTY HYPERCUBES
EMBEDDED PATHS AND CYCLES IN FAULTY HYPERCUBES NELSON CASTAÑEDA AND IVAN S. GOTCHEV Abstract. An important task in the theory of hypercubes is to establish the maximum integer f n such that for every set
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationTOPOLOGICAL EQUIVALENCE OF REAL BINARY FORMS
proceedings of the american mathematical society Volume 112, Number 4. August 1991 TOPOLOGICAL EQUIVALENCE OF REAL BINARY FORMS DAVID WEINBERG AND DAVE WITTE (Communicated by Frederick R. Cohen) Abstract.
More informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationAbsolutely indecomposable symmetric matrices
Journal of Pure and Applied Algebra 174 (2002) 83 93 wwwelseviercom/locate/jpaa Absolutely indecomposable symmetric matrices Hans A Keller a; ;1, A Herminia Ochsenius b;1 a Hochschule Technik+Architektur
More information