On a Conjecture of Butler and Graham
|
|
- Lora Stevens
- 5 years ago
- Views:
Transcription
1 On a Conjecture of Butler and Graham Tengyu Ma 1, Xiaoming Sun 2, and Huacheng Yu 1 1 Institute for Interdisciplinary Information Sciences, Tsinghua University 2 Institute of Computing Technology, Chinese Academy of Sciences Abstract. Motivated by a hat guessing problem proposed by Iwasawa [6], Butler and Graham [2] made the following conjecture on the existence of certain way of maring the coordinate lines in [] n : there exists a way to mar one point on each coordinate line in [] n, so that every point in [] n is mared exactly a or b times as long as the parameters (a, b, n, ) satisfies that there are non-negative integers s and t such that s+t = n and as+bt = n n 1. In this paper we prove this conjecture for any prime number. Moreover, we prove the conjecture for the case when a = 0 for general. Keywords: hat guessing games, maring coordinate lines, characteristic function MSC classes: 00A08 97A20 94B05 1 Introduction In [2] Butler and Graham considered the problem of the existence of certain way of maring coordinate lines in [] n. A coordinate line in [] n is the set of points in which all but one coordinate are fixed and the unfixed coordinate varies over all possibilities. Maring a line 1 means designating a point on that line. They conjectured that Conjecture 1 (Butler, Graham [2]). There is a maring of the lines in [] n so that on each line exactly one point is mared and each point is mared either a or b times if and only if there are nonnegative integers s and t satisfying the linear equations s + t = n and as + bt = n n 1. The only if part of the conjecture is straightforward, leaving to be crucial the construction of a maring of lines in [] n with the desired properties. Buhler, Butler, Graham, and Tressler [1] proved the conjecture for = 2. Butler and Graham [2] proved the conjecture when n 5. The main contributions of this paper are i) we prove all the cases when is an odd prime; ii) we prove the case when a = 0 (without any assumption on ). Theorem 1. For any prime and 0 a < b n, there exists a maring of lines in [] n so that each point is mared either a times or b times if and only if there are nonnegative integers s and t so that s + t = n and as + bt = n n 1. Theorem 2. For 0 < b n, there exists a maring of lines in [] n so that each point is either unmared or mared b times if and only if there are nonnegative integers s and t so that s + t = n and bt = n n 1. As in [2], we use the notation [a, b] n as a shorthand for a realization of a maring of the lines in [] n where each point is mared either a times or b times. Then Theorem 1 provides a sufficient and necessary condition for the existence of [a, b] n for any prime, and Theorem 2 considers the existence of [a, b] n when a = 0. In the proof of Theorem 1 we reduce the existence of [a, b] n to the existence of [a 1, b 1]n when a > 0 and b n + 1 (see Proposition 2 in Section 2). It turns out that the most 1 for convenience, we use line to indicate coordinate line throughout this paper.
2 2 Tengyu Ma, Xiaoming Sun, and Huacheng Yu complicated part of this inductive argument is the construction of the base cases, that is, [0, b] n and [a, n t] n (where t < ). We provide two theorems (Theorem 3 and 4) giving a direct realizations for these two inds of marings. The proofs of these theorems use similar approaches, though different in many details, that we partition the whole grid [] n according to certain number theory based characteristic function, which has a nice symmetrical property: Informally speaing, for any fixed s, any point x [] n, and any value v in the range of this function, there exists a unique direction along which by moving from x with distance s, we can reach a point with value v. By a sophisticated utilizing this property, we accomplish the design of marings for these two base cases. Furthermore, we prove the case [0, b] n for general by generalizing the characteristic function in a delicate way. Related Wor The motivation of investigating this maring line problem is to reformulate and solve a hat guessing question proposed by Iwasawa [6]. In that game there are several players sitting around a table, each of which is assigned a hat with one of colors. Each player can see all the colors of others hat but his/her own. The players try to coordinate a strategy before the game starts, and guess the colors of their own hats simultaneously and independently after the hats are placed on their heads. Their goal is to design a strategy that guarantees exactly either a or b correct guesses. For example, one special case is that either everybody guesses the color correctly or nobody guesses correctly, i.e. a = 0 and b = n. Several variations of hat guessing game have been considered in the literature. Ebert [4] considered the model that players are allowed to answer unnown. He showed that in this model there is a perfect strategy for players when n is of the form 2 m 1. Lenstra and Seroussi [7] studied the case that n is not of such form. Butler, Hajiaghayi, Kleinberg and Leighton [3] considered the worst case that each player can see only part of the others hats with respect to a sight graph. Feige [5] investigated the average case with a sight graph. Peterson and Stinson [9] investigated the case that each player can see hats in front of him and they guess one by one. Recently Ma, Sun and Yu [8] proposed a variation which allow to answer unnown and require at least correct guesses for winning condition. Notations and Preliminaries [] = {1, 2,..., }, [] n = [] []. [a, b] n }{{} : maring of lines in []n in which each point is n mared either a times or b times. We assume that a < b as well. Throughout the paper we always use boldface type letters for vectors and vector-valued functions. For a vector x = (x 1,..., x n ), define the -modulo parity function (x) = x 1 + x x n mod. We denote by x i the line (x 1,..., x i 1,, x i+1,..., x n ), i.e. x i = {(x 1,..., x i 1, y, x i+1,..., x n ) y []}. The necessary condition in the conjecture is straightforward. Proposition 1 ([1]). If we have [a, b] n, then the following equations system has nonnegative integer solution. { s + t = n, as + bt = n 1 n. More specifically, s = n 1 (b n) b a is the number of points that are mared a times, and t = is the number of points that are mared b times. n 1 (n a) b a
3 On a Conjecture of Butler and Graham 3 The rest of the paper is organized as follows: In Section 2 we show that the necessary condition is sufficient when the number of colors is a prime. Section 3 considers the case for general when a = 0. Finally we conclude the paper in Section 4 with some open problems. 2 [a, b] n for Prime In this section we prove the conjecture when is an odd prime number (the case = 2 has been proved by Buhler et al. [1]). The first step is to reduce [a, b] n to [a 1, b 1]n as in Butler and Graham [2]. Proposition 2 ([2]). Given [a, b] n, we have [a + 1, b + 1]n+. By repeatedly using this Proposition, we can reduce the problem [a, b] n to two possible cases: (1) [a, b ] n, where b > n ; (2) [0, b ] n (recall that a < b). During this procedure, the divisibility is unchanged (see the proof of Theorem 1). The following two theorems (Theorem 3 and Theorem 4) give the constructions of two base cases, respectively. Theorem 3. If is a prime and 0 t 1, 1 a < n t, and ( n a n t a )n 1 is a nonnegative integer, then we have [a, n t] n. Proof. Firstly we do some elementary number theory substitution to mae the parameters more manageable. Suppose that ( n a n t a )n 1 is a nonnegative integer. Since is a prime, there exists m, r N so that n t a = m r, where m n 1, r n a, and n a. (n t a implicitly holds.) Observe that r n a and r n t a implies that r ( 1)a t. Let ( 1)a t = ra, where a ( 1)a t (a a t)m (n a t)m = = = m. r n t a n t a Thus, n = t + a + m r and ( 1)a = t + ra, where a, m and r are all nonnegative integers. Now we construct a maring of lines in [] n so that each point is mared either (n t) times or a times. For convenience, we partition the n = a + t + m r dimensions into three groups, each of which contains m r, t, and a coordinates respectively 2, and represent each point in [] n by (x, y, z) where x [] mr, y [] t, and z [] a. Furthermore, we index x by a pair (i, j) Z m [r], i.e. x i,j [] are the coordinates of x (where i Z m, j [r])3. For a point (x, y, z) [] n and i Z m, j [r], denote by (x (i,j), y, z) the lines of [] n for which all the coordinates are fixed except the coordinate (i, j) of x, i.e. (x (i,j), y, z) = {( x, ỹ, z) [] n ỹ = y, z = z, (i, j ) (i, j) x i,j = x i,j, x i,j []} Similarly (x, y i, z) (i [t]) is a line of [] n which the i-th coordinate of y is unfixed, (x, y, z i ) (i [a]) is a line which the i-th coordinate of z is unfixed. For each x [] mr, define the characteristic function q : [] mr [] m as follows: q(x) = r i (1) i=(i 1,...,i m) Z m where i is -based representation of i in Z m, and the operations + and are over Z. According to the characteristic value q(x), we can group the points in [] n into equivalence classes. Specifically, 2 When t = 0, then there is only two groups, the proof still holds. 3 Since we need to tae some ring operations on the index i, we index i by Z m here instead of [] m. j=1 x i,j
4 4 Tengyu Ma, Xiaoming Sun, and Huacheng Yu for any w [] m, let Q(w) be the collection of points in [] n which have characteristic value w, i.e. Q(w) = {(x, y, z) [] n q(x) = w}. Arbitrarily choose a different values w 1,..., w a from [] m, for example the first a elements in the lexicographical order (recall that 0 a m ), and let M be the collections of points which have one of these a values as characteristic value and 0 as -modulo parity, i.e., M = (Q(w 1 ) Q(w a )) {(x, y, z) [] n (x, y, z) = 0}. We arbitrarily partition the set [a ] [r] (recall that [a ] [r] [ m ] [r] is the indices set of x) into ( 1) subsets L 1 L 2 L 1 with the requirement that the cardinality L 1 = = L t = a 1 and L t+1 = = L 1 = a. (Notice that t(a 1) + ( 1 t)a = ( 1)a t = a r.) Based on these preparations, now we give the construction of the desired maring of [] n. There are three different types of lines: (x (i,j), y, z), (x, y i, z), and (x, y, z i ), we mar them as follows: 1. for the line (x (i,j), y, z), there are two sub-cases: (x (i,j), y, z) M, i.e. on line (x (i,j), y, z) there exists some point belongs to set M. (by the condition that (x, y, z) = 0, this point is unique, if exists). Suppose the point is ( x, y, z) (x (i,j), y, z) M, and suppose that ( x, y, z) Q(w i0 ) for some i 0 [a ], and (i 0, j) L s for some s [ 1] (recall that L 1,..., L 1 is a partition of [a ] [r]). Then we mar the point ( x + s e i,j, y, z) (x (i,j), y, z), where e i,j = (0,..., 0, 1, 0,..., 0) is the unit vector in [] mr for which only x i,j = 1, and all other coordinates equal 0. The addition and multiplication are over Z. This is also the unique point on this line which has ( ) = s; otherwise (x (i,j), y, z) M =, mar the unique point ( x, y, z) on the line such that ( x, y, z) = for line (x, y i, z) (i [t]), mar the unique point (x, ỹ, z) which satisfies (x, ỹ, z) = i. (recall that 1 i t 1) 3. for line (x, y, z i ) (i [a]), mar the point (x, y, z) which satisfies (x, y, z) = 0. We claim that the construction above is indeed a [a, n t] n. We need to chec that each point (x, y, z) is mared either a times or (n t) times. 1. if (x, y, z) = 0, then for each line (x, y i, z), we never mar the point (x, y, z) (recall that we mar some point which has ( ) = i 0). On the contrary, for each line (x, y, z i ), we always mar (x, y, z). For lines of the form (x (i,j), y, z), there are two sub-cases: if (x, y, z) M, then on the line (x (i,j), y, z) we mar the point (x+s e i,j, y, z) for some s > 0 by the construction, which is not (x, y, z). Thus in this case, (x, y, z) is mared 0, 0, and a times in x, y and z s directions respectively, hence a times in total; if (x, y, z) M, then on the line (x (i,j), y, z) there is no point in M. Thus we mared the point with ( ) = 0, which is exactly point (x, y, z) itself. In this case, (x, y, z) is mared m r, 0, and a times in three groups of directions respectively, and m r a = n t times in total. Therefore, (x, y, z) is mared either a or (n t) times.
5 On a Conjecture of Butler and Graham 5 2. if (x, y, z) = s for some 1 s t. Among lines (x, y i, z) (1 i t), only on the line (x, y s, z) we mared point (x, y, z). On each line (x, y, z i ) (i [a]), we never mar (x, y, z). By the definition of the characteristic function, q(x s e i,j ) are different for different i s (here we use the fact that is a prime, hence s is coprime to and has an inverse in Z ). Therefore there are exactly a r different pairs of (i, j) such that line (x (i,j), y, z) contains a point (x s e i,j, y, z) M. On exactly L s = a 1 lines of these a r lines, point (x, y, z) is mared. On all other lines, there is no point belong to M, thus we only mar the point with ( ) = 0. Thus the point (x, y, z) is mared (a 1), 1 and 0 times in x, y, and z s directions, respectively, and in total a times. 3. if (x, y, z) = s for some s > t. It is similar to the case above, except that we never mar point (x, y, z) on lines of form (x, y i, z), and on L s = a lines of form (x (i,j), y, z) we mar (x, y, z). Therefore in this case (x, y, z) is also mared exactly a times. Theorem 4. If is a prime, 0 < b n, and ( ) b n b n 1 is an integer, then we have [0, b] n. Proof. Suppose gcd(b, n) = r, since is a prime number and ( ) b n b n 1 Z, we have that b = r m, n = rn for some non-negative integer m and n. By the following Proposition, it suffices to prove the r = 1 case. Proposition 3 ([2]). Given [0, b] n, then for every r, we have [0, br]rn. Since b n b, let n = tb + h, where 1 t < and 0 h b. We partition the n coordinates into three groups, each of which contains m, (t 1)b, and h coordinates (note that now b = m ), respectively 4. We represent each point in [] n by (x, y, z), where x [] m, y [] (t 1)b, and z [] h. Notations (x i, y, z), (x, y (i,j), z) and (x, y, z i ) are similarly defined as in the previous proof (note that for (x, y (i,j), z), the indexes i [t 1], j [b]). Similarly we define the characteristic function q : [] m [] m as follows: q(x) = i=(i 1,...,i m) Z m x i i. Let Q(w) = {(x, y, z) [] n q(x) = w} as usual, and the notation of i and, + are the same as in the proof of Theorem 3. We arbitrarily choose h different values w 1, w 2,..., w h from [] m, and let M = (Q(w 1 ) Q(w h )) {(x, y, z) [] n (x, y, z) = 0}. Now we describe the maring of the line (for some fixed point (x, y, z)): 1. For the line (x i, y, z), if there exists a point ( x, y, z) M on it, then we mar this point. Otherwise we mar the unique point ( x, y, z) with -modulo parity ( x, y, z) = For line (x, y (i,j), z) (i [t 1], j [b]), we mar the point (x, ỹ, z) on the line with parity (x, ỹ, z) = i On line (x, y, z i ) (i [h]), we mar the unique point (x, y, z) with parity (x, y, z) = 1. We claim that the construction above is a [0, b] n. We need to verify that each point (x, y, z) is mared either b = m times or unmared. There are three cases: 1. (x, y, z) = 0. 4 If t = 1 or h = 0, one of the group probably vanishes, while the proof still holds.
6 6 Tengyu Ma, Xiaoming Sun, and Huacheng Yu if (x, y, z) M. The point is only mared by lines of the form (x i, y, z). There are b such lines; otherwise, the point is never mared. 2. (x, y, z) = 1. q(x e i ) are pairwise different, thus on exactly (b h) lines (x i, y, z) there is no point in M. On these lines (x, y, z) is mared. All the lines of form (x, y i, z) will not mar the point (x, y, z), and all h lines of form (x, y, z i ) will mar this point. Thus (x, y, z) is mared b times in total (x, y, z) t. The point is mared on all the line of the form (x, y (i,j), z) where i = (x, y, z) 1 and j [b]. There are b such lines. 4. (x, y, z) > t. The point is not mared. Now we are ready to present our main theorem. Theorem 1 (Restated) For prime and 0 a < b n, there exists a maring of lines in [] n so that each point is mared either a times or b times if and only if there are nonnegative integers s and t so that s + t = n and as + bt = n n 1. Proof. The necessary part of the theorem is trivial and has been shown in the preliminary section of the introduction. The proof of sufficiency is an induction on n by essentially using Theorem 3 and 4 as base steps. The n = 1 case is obvious. Assume that for any n m 1, the theorem holds. Now we prove the theorem for n = m. There are three possible occasions: 1. If a = 0, then by Theorem 4 the theorem holds. 2. If b > m, by Theorem 3 the theorem holds. 3. If a > 0 and b m. Assume s = m 1 (b m), t = m 1 (m a) b a b a are both nonnegative integers. We claim that both s = m 1 [(b 1) (m )] b a and t = m 1 [(m ) (a 1)] b a are nonnegative integers. Suppose that b a = r d, where gcd(r, ) = 1. Thus we have that r m a, since r m 1 (m a) and gcd(r, m 1 ) = 1. Since d b a m 1, we have that d m 1 and d m 1. Then r d m 1 (m a), that is Similar argument shows that b a m 1 ((m ) (a 1)). b a m 1 ((b 1) (m )). Since a > 0 and b m, we still have 0 a 1 b 1 m. By invoing inductive hypothesis, we have that [a 1, b 1] m exists. Therefore, by applying Proposition 2 we have that [a, b] m exists.
7 On a Conjecture of Butler and Graham 7 3 [0, b] n for General In this section we prove the conjecture when a = 0 for general. Before proving the theorem, we provide a crucial building bloc of the proof, which can be viewed as a generalization of the characteristic function defined in Theorem 4. Proposition 4. If b and are two integers so that each prime factor of b is also a prime factor of, that is, and b can be decomposed as = p α1 1 pα l l and b = p β1 1 pβ l l, for integers α j > 0 and β j 0, (thus [] and [b] can be viewed as Z α1 Z α l and Z β1 Z β l, respectively), then there exists a linear characteristic function q : [] b [b] with the following property: There exists s [], so that for any x [] b, there is a unique index i [b] satisfying that q(x s e i ) = 0, where s e i is the vector in [] b with all entries 0 except that the i-th is s. Proof. Define the a linear operator : [] [b] [b], as a generalization of multiplication of scalar and vector, as follows: Suppose that u = (u 1,..., u l ) Z α1 Z α l ( = []), where each u j Z αj p j can be represented as u j = (u j α,..., j 1 uj 0 ). Similarly, suppose v = (v1,..., v l ) Z β1 Z β l ( = [b]). Define u v = (u 1 0 v 1, u 2 0 v 2,..., u l 0 v l ), where u j 0 vj is the multiplication of a scalar and a vector over Z pj. Based on this operator, define q : [] b [b] as follows: 5 q(x) = x i i. α i [b] =Z 1 Z α l Now we prove that q(x) indeed has the desired property. Let s = (1,..., 1) Z α1... Z α l ( = []) be the element with each entry 1 6, since is a linear operator with addition over Z α1... Z α l, we have that q(x s e i ) = q(x) q(s e i ) = q(x) s i. Since s is a vector with every entry 1, s i = i, hence the equation q(x s e i ) = 0 only holds for i = q(x). Now we prove Theorem 2 by using the above characteristic function q( ). Proof of Theorem 2. We only need to prove the sufficient part. Suppose that s = ( ) b n b n 1 is a nonnegative integer. We factor b = dr, where r is coprime with and each prime factor of d is a prime factor of. Thus we have r b n, and since d n, we have d n 1. By Proposition 3 it is sufficient to prove the r = 1 case. Suppose n = tb + h, where 1 t < and 0 h b. Similar to the approach of proving Theorem 4, we partition the n coordinates into three groups, each of which contains b, (t 1)b and h coordinates, respectively. We represent a point in [] n by (x, y, z), where x [] b, y [] (t 1)b, and z [] h. Let q(x) be the characteristic function which satisfies the condition in Proposition 4. Let Q(w) = {(x, y, z) [] n q(x) = w} as before. We arbitrarily choose h different values w 1,..., w h from [b] = Z β1 Z β l (since 0 h b), and let M = (Q(w 1 ) Q(w h )) {(x, y, z) (x, y, z) = 0}. 7 5 Here we view x i a vector in [] = Z α 1... Z α l as in the definition of. 6 Since s could be viewed both as an element in [] and a vector in Z α 1... Z α l, we use s and s correspondingly. 7 We redefine (a) as a 1 + a a n, the addition is over the group Z α 1 Z α l ( = []).
8 8 Tengyu Ma, Xiaoming Sun, and Huacheng Yu Now we describe the maring of lines. Considering the set [], 0 and s are two special elements in it. There are 2 t 1 elements left. Let τ be an arbitrary injective function that maps [t 1] to [] \ {0, s }. Thus τ([t 1]) = t For line (x i, y, z) (i [b]), if there exists a point ( x, y, z) M on it, then we mar this point. Otherwise we mar the unique point ( x, y, z) so that ( x, y, z) = s. 2. For line (x, y (i,j), z) (i [t 1], j [b]), we mar the point ( x, y, z) on the line so that ( x, y, z) = τ(i). 3. On line (x, y, z i ) (i [h]), we always mar the unique point ( x, y, z) with ( x, y, z) = s. Next we prove that each point (x, y, z) is mared either b times or a = 0 time. There are three cases: 1. (x, y, z) = 0. On lines of form (x, y (i,j), z) or (x, y, z i ), this point will never get mared. if (x, y, z) M. The point is mared by all lines of form (x i, y, z). There are exactly b such lines; otherwise, the point is never mared. 2. (x, y, z) = s. By Proposition 4, q(x s e i ) are pairwise different. On exactly h lines of form (x i, y, z), there is a point in M. Therefore on (b h) lines of such form, (x, y, z) will be mared. All the lines of form (x, y, z i ) will mar this point as well. On lines of form (x, y (i,j), z), this point will not be mared. Thus it is mared (b h) + h = b times in total. 3. (x, y, z) τ([t 1]). The point is mared on all the line of the form (x, y (i,j), z) where i = τ 1 ( (x, y, z)). Thus it is mared b times. 4. (x, y, z) [] \ (τ([t 1]) {0, s }). The point is never mared. 4 Conclusion and Remars In this wor we investigate a conjecture of Butler and Graham on maring lines of [] n. We proved the necessary and sufficient condition of the existence of [a, b] n for the case when is a prime and the case when a = 0 with general. A natural open question is how to settle the remaining case of the conjecture, [a, n t] n (t < ) for general. The proof of Theorem 3 actually can be generalized to the following case when is a prime power (with an additional constrain that (n t a) contains more prime factors than ). Theorem 5. [a, n t] n exists if = pm, n = t + a + rp s, n a = ru and s m. The proof utilized the property of field F p s. It is essentially similar to the proof of Theorem 2 and we will put it in appendix. It is an interesting question to now whether the method here can be further generalized. The difficulty is that during this generalization, the strong symmetric property cannot be maintained. References 1. Joe Buhler, Steve Butler, Ron Graham, and Eric Tressler. Hypercube orientations with only two indegrees. Journal of Combinatorial Theory, Series A, 118: , Steve Butler and Ron Graham. A note on maring lines in [] n. Designs, Codes and Cryptography, 2011.
9 On a Conjecture of Butler and Graham 9 3. Steve Butler, Mohammad T. Hajiaghayi, Robert D. Kleinberg, and Tom Leighton. Hat guessing games. SIAM J. Discrete Math., 22(2): , Todd T. Ebert. Applications of recursive operators to randomness and complexity. PhD thesis, University of California at Santa Barbara, Uriel Feige. On optimal strategies for a hat game on graphs. SIAM Journal of Discrete Mathematics, 24(3): , H. Iwasawa. Presentation given at the ninth gathering 4 gardner (g4g9). March Hendri W. Lenstra and Gadiel Seroussi. On hats and other covers. In Proceedings of IEEE International Symposium on Information Theory, page 342, Tengyu Ma, Xiaoming Sun, and Huacheng Yu. A new variation of hat guessing games. In Proceedings of 17th Annual International Computing and Combinatorics Conference, pages , Maura B. Peterson and Douglas R. Stinson. Yet another hat game. The Electronic Journal of Combinatorics, 17(1):#R86, Appendix Proof (Theorem 5(setch)). We construct a maring of lines in [] n so that each point is mared either (n t) times or a times. First, similar to in the proof of Theorem 3, we partition the n = a + t + p s r dimensions into three groups, each of which contains p s r, t, and a coordinates respectively, and represent each point in [] n by (x, y, z) where x [] psr, y [] t, and z [] a. Then, we index x by a pair (i, j) F s p [r], i.e. x i,j [] are the coordinates of x (where i F s p, j [r]) 8. We define lines (x (i,j), y, z), (x, y i, z) and (x, y, z i ) in a similar way. For each x [] psr, we define the characteristic function q : [] psr F p s in a slightly different way: q(x) = r q i (2) i F p s q is an arbitrary function that maps F p m to F p s. q ( r j=1 x i,j) is an element in F p s. The way of maring lines and the proof of correctness is the same as that in the proof of Theorem 3. j=1 x i,j 8 Here we use a different arithmetic system for i.
Hypercube orientations with only two in-degrees
Hypercube orientations with only two in-degrees Joe Buhler Steve Butler Ron Graham Eric Tressler Abstract We consider the problem of orienting the edges of the n-dimensional hypercube so only two different
More informationOn optimal strategies for a hat game on graphs
On optimal strategies for a hat game on graphs Uriel Feige April 12, 2010 Abstract The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially
More informationFOUR EDGE-INDEPENDENT SPANNING TREES 1
FOUR EDGE-INDEPENDENT SPANNING TREES 1 Alexander Hoyer and Robin Thomas School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT We prove an ear-decomposition theorem
More informationAbstract Combinatorial Games
Abstract Combinatorial Games Arthur Holshouser 3600 Bullard St. Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 28223, USA hbreiter@email.uncc.edu
More information1 Elementary number theory
Math 215 - Introduction to Advanced Mathematics Spring 2019 1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...},
More informationThe 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 informationDisjoint directed cycles
Disjoint directed cycles Noga Alon Abstract It is shown that there exists a positive ɛ so that for any integer k, every directed graph with minimum outdegree at least k contains at least ɛk vertex disjoint
More informationScan Scheduling Specification and Analysis
Scan Scheduling Specification and Analysis Bruno Dutertre System Design Laboratory SRI International Menlo Park, CA 94025 May 24, 2000 This work was partially funded by DARPA/AFRL under BAE System subcontract
More informationNoncrossing Trees and Noncrossing Graphs
Noncrossing Trees and Noncrossing Graphs William Y. C. Chen and Sherry H. F. Yan 2 Center for Combinatorics, LPMC, Nanai University, 30007 Tianjin, P.R. China chen@nanai.edu.cn, 2 huifangyan@eyou.com Mathematics
More informationStar 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 informationOn Rainbow Cycles in Edge Colored Complete Graphs. S. Akbari, O. Etesami, H. Mahini, M. Mahmoody. Abstract
On Rainbow Cycles in Edge Colored Complete Graphs S. Akbari, O. Etesami, H. Mahini, M. Mahmoody Abstract In this paper we consider optimal edge colored complete graphs. We show that in any optimal edge
More informationDiscrete 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 informationThe 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 informationLine Graphs and Circulants
Line Graphs and Circulants Jason Brown and Richard Hoshino Department of Mathematics and Statistics Dalhousie University Halifax, Nova Scotia, Canada B3H 3J5 Abstract The line graph of G, denoted L(G),
More informationHashing. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong
Department of Computer Science and Engineering Chinese University of Hong Kong In this lecture, we will revisit the dictionary search problem, where we want to locate an integer v in a set of size n or
More informationWinning 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 informationUniversal Cycles for Permutations
arxiv:0710.5611v1 [math.co] 30 Oct 2007 Universal Cycles for Permutations J Robert Johnson School of Mathematical Sciences Queen Mary, University of London Mile End Road, London E1 4NS, UK Email: r.johnson@qmul.ac.uk
More informationTheorem 3.1 (Berge) A matching M in G is maximum if and only if there is no M- augmenting path.
3 Matchings Hall s Theorem Matching: A matching in G is a subset M E(G) so that no edge in M is a loop, and no two edges in M are incident with a common vertex. A matching M is maximal if there is no matching
More informationAn Eternal Domination Problem in Grids
Theory and Applications of Graphs Volume Issue 1 Article 2 2017 An Eternal Domination Problem in Grids William Klostermeyer University of North Florida, klostermeyer@hotmail.com Margaret-Ellen Messinger
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More informationEDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m
EDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m GARY MACGILLIVRAY BEN TREMBLAY Abstract. We consider homomorphisms and vertex colourings of m-edge-coloured graphs that have a switching operation
More informationarxiv: v2 [math.co] 11 May 2016
THREE-PILE SHARING NIM AND THE QUADRATIC TIME WINNING STRATEGY arxiv:1506.06961v2 [math.co] 11 May 2016 NHAN BAO HO Abstract. We study a variant of 3-pile Nim in which a move consists of taking tokens
More informationPebbling on Directed Graphs
Pebbling on Directed Graphs Gayatri Gunda E-mail: gundagay@notes.udayton.edu Dr. Aparna Higgins E-mail: Aparna.Higgins@notes.udayton.edu University of Dayton Dayton, OH 45469 Submitted January 25 th, 2004
More informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 2769 2775 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Optimal acyclic edge colouring of grid like graphs
More informationVertex Deletion games with Parity rules
Vertex Deletion games with Parity rules Richard J. Nowakowski 1 Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada rjn@mathstat.dal.ca Paul Ottaway Department of Mathematics,
More informationA Vizing-like theorem for union vertex-distinguishing edge coloring
A Vizing-like theorem for union vertex-distinguishing edge coloring Nicolas Bousquet, Antoine Dailly, Éric Duchêne, Hamamache Kheddouci, Aline Parreau Abstract We introduce a variant of the vertex-distinguishing
More informationTrail Making Game. Hyun Sung Jun Jaehoon Kim Sang-il Oum Department of Mathematical Sciences KAIST, Daejeon, , Republic of Korea.
Trail Making Game Hyun Sung Jun Jaehoon Kim Sang-il Oum Department of Mathematical Sciences KAIST, Daejeon, 305-701, Republic of Korea. May 7, 2009 Abstract Trail Making is a game played on a graph with
More information(a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are rational they can be written as the ratio of integers a 1
CS 70 Discrete Mathematics for CS Fall 2000 Wagner MT1 Sol Solutions to Midterm 1 1. (16 pts.) Theorems and proofs (a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are
More information1. Chapter 1, # 1: Prove that for all sets A, B, C, the formula
Homework 1 MTH 4590 Spring 2018 1. Chapter 1, # 1: Prove that for all sets,, C, the formula ( C) = ( ) ( C) is true. Proof : It suffices to show that ( C) ( ) ( C) and ( ) ( C) ( C). ssume that x ( C),
More informationPLANAR GRAPH BIPARTIZATION IN LINEAR TIME
PLANAR GRAPH BIPARTIZATION IN LINEAR TIME SAMUEL FIORINI, NADIA HARDY, BRUCE REED, AND ADRIAN VETTA Abstract. For each constant k, we present a linear time algorithm that, given a planar graph G, either
More informationA construction for the hat problem on a directed graph
A construction for the hat problem on a directed graph Rani Hod School of Computer Science Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel rani.hod@cs.tau.ac.il
More informationChapter 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 informationMath Introduction to Advanced Mathematics
Math 215 - Introduction to Advanced Mathematics Number Theory Fall 2017 The following introductory guide to number theory is borrowed from Drew Shulman and is used in a couple of other Math 215 classes.
More informationGraceful Graphs and Graceful Labelings: Two Mathematical Programming Formulations and Some Other New Results
Graceful Graphs and Graceful Labelings: Two Mathematical Programming Formulations and Some Other New Results Timothy A. Redl Department of Computational and Applied Mathematics, Rice University, Houston,
More informationEDAA40 At home exercises 1
EDAA40 At home exercises 1 1. Given, with as always the natural numbers starting at 1, let us define the following sets (with iff ): Give the number of elements in these sets as follows: 1. 23 2. 6 3.
More informationMAXIMAL PLANAR SUBGRAPHS OF FIXED GIRTH IN RANDOM GRAPHS
MAXIMAL PLANAR SUBGRAPHS OF FIXED GIRTH IN RANDOM GRAPHS MANUEL FERNÁNDEZ, NICHOLAS SIEGER, AND MICHAEL TAIT Abstract. In 99, Bollobás and Frieze showed that the threshold for G n,p to contain a spanning
More informationMultiple Vertex Coverings by Cliques
Multiple Vertex Coverings by Cliques Wayne Goddard Department of Computer Science University of Natal Durban, 4041 South Africa Michael A. Henning Department of Mathematics University of Natal Private
More informationTopology Homework 3. Section Section 3.3. Samuel Otten
Topology Homework 3 Section 3.1 - Section 3.3 Samuel Otten 3.1 (1) Proposition. The intersection of finitely many open sets is open and the union of finitely many closed sets is closed. Proof. Note that
More information2017 SOLUTIONS (PRELIMINARY VERSION)
SIMON MARAIS MATHEMATICS COMPETITION 07 SOLUTIONS (PRELIMINARY VERSION) This document will be updated to include alternative solutions provided by contestants, after the competition has been mared. Problem
More informationA NOTE ON THE NUMBER OF DOMINATING SETS OF A GRAPH
A NOTE ON THE NUMBER OF DOMINATING SETS OF A GRAPH STEPHAN WAGNER Abstract. In a recent article by Bród and Skupień, sharp upper and lower bounds for the number of dominating sets in a tree were determined.
More informationOn the Number of Tilings of a Square by Rectangles
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange University of Tennessee Honors Thesis Projects University of Tennessee Honors Program 5-2012 On the Number of Tilings
More informationForced orientation of graphs
Forced orientation of graphs Babak Farzad Mohammad Mahdian Ebad S. Mahmoodian Amin Saberi Bardia Sadri Abstract The concept of forced orientation of graphs was introduced by G. Chartrand et al. in 1994.
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Explain the steps in a proof by (strong) mathematical induction Use (strong) mathematical induction
More informationAn Improved Upper Bound for the Sum-free Subset Constant
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 (2010), Article 10.8.3 An Improved Upper Bound for the Sum-free Subset Constant Mark Lewko Department of Mathematics University of Texas at Austin
More informationMinimum Number of Palettes in Edge Colorings
Graphs and Combinatorics (2014) 30:619 626 DOI 10.1007/s00373-013-1298-8 ORIGINAL PAPER Minimum Number of Palettes in Edge Colorings Mirko Horňák Rafał Kalinowski Mariusz Meszka Mariusz Woźniak Received:
More informationSPERNER S LEMMA MOOR XU
SPERNER S LEMMA MOOR XU Abstract. Is it possible to dissect a square into an odd number of triangles of equal area? This question was first answered by Paul Monsky in 970, and the solution requires elements
More informationModule 7. Independent sets, coverings. and matchings. Contents
Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................
More informationResults on the min-sum vertex cover problem
Results on the min-sum vertex cover problem Ralucca Gera, 1 Craig Rasmussen, Pantelimon Stănică 1 Naval Postgraduate School Monterey, CA 9393, USA {rgera, ras, pstanica}@npsedu and Steve Horton United
More informationMC 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 informationCoverings and Matchings in r-partite Hypergraphs
Coverings and Matchings in r-partite Hypergraphs Douglas S. Altner Department of Mathematics, United States Naval Academy, Annapolis, Maryland, altner@usna.edu. J. Paul Brooks Department of Statistical
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationAcyclic 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 informationOrthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem
Orthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem Pawe l Żyliński Institute of Mathematics University of Gdańsk, 8095 Gdańsk, Poland pz@math.univ.gda.pl Submitted: Sep 9, 005;
More informationOn the Max Coloring Problem
On the Max Coloring Problem Leah Epstein Asaf Levin May 22, 2010 Abstract We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive
More informationOn 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 informationHat Guessing Games. Tom Leighton
Hat Guessing Games Steven Butler Mohammad T. Hajiaghayi Robert D. Kleinberg Tom Leighton Abstract Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of
More informationAcyclic Edge Colorings of Graphs
Acyclic Edge Colorings of Graphs Noga Alon Benny Sudaov Ayal Zas 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
More informationGeneralized Pebbling Number
International Mathematical Forum, 5, 2010, no. 27, 1331-1337 Generalized Pebbling Number A. Lourdusamy Department of Mathematics St. Xavier s College (Autonomous) Palayamkottai - 627 002, India lourdugnanam@hotmail.com
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
More informationTHE INSULATION SEQUENCE OF A GRAPH
THE INSULATION SEQUENCE OF A GRAPH ELENA GRIGORESCU Abstract. In a graph G, a k-insulated set S is a subset of the vertices of G such that every vertex in S is adjacent to at most k vertices in S, and
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
More informationCOUNTING THE NUMBER OF WINNING BINARY STRINGS IN THE 1-DIMENSIONAL SAME GAME. Department of Mathematics Oberlin College Oberlin OH 44074
COUNTING THE NUMBER OF WINNING BINARY STRINGS IN THE 1-DIMENSIONAL SAME GAME CHRIS BURNS AND BENJAMIN PURCELL Department of Mathematics Oberlin College Oberlin OH 44074 Abstract. Ralf Stephan recently
More informationRamsey s Theorem on Graphs
Ramsey s Theorem on Graphs 1 Introduction Exposition by William Gasarch Imagine that you have 6 people at a party. We assume that, for every pair of them, either THEY KNOW EACH OTHER or NEITHER OF THEM
More informationComputation with No Memory, and Rearrangeable Multicast Networks
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 16:1, 2014, 121 142 Computation with No Memory, and Rearrangeable Multicast Networks Serge Burckel 1 Emeric Gioan 2 Emmanuel Thomé 3 1 ERMIT,
More informationComponent Connectivity of Generalized Petersen Graphs
March 11, 01 International Journal of Computer Mathematics FeHa0 11 01 To appear in the International Journal of Computer Mathematics Vol. 00, No. 00, Month 01X, 1 1 Component Connectivity of Generalized
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam
More informationSmall Survey on Perfect Graphs
Small Survey on Perfect Graphs Michele Alberti ENS Lyon December 8, 2010 Abstract This is a small survey on the exciting world of Perfect Graphs. We will see when a graph is perfect and which are families
More informationSPERNER S LEMMA, BROUWER S FIXED-POINT THEOREM, AND THE SUBDIVISION OF SQUARES INTO TRIANGLES
SPERNER S LEMMA, BROUWER S FIXED-POINT THEOREM, AND THE SUBDIVISION OF SQUARES INTO TRIANGLES AKHIL MATHEW Abstract These are notes from a talk I gave for high-schoolers at the Harvard- MIT Mathematics
More informationDecreasing 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 informationMath 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)
Math 30 Introduction to Proofs via Number Theory Robert Jewett (with small modifications by B. Ćurgus) March 30, 009 Contents 1 The Integers 3 1.1 Axioms of Z...................................... 3 1.
More informationBasic Graph Theory with Applications to Economics
Basic Graph Theory with Applications to Economics Debasis Mishra February, 0 What is a Graph? Let N = {,..., n} be a finite set. Let E be a collection of ordered or unordered pairs of distinct elements
More informationOn Galvin orientations of line graphs and list-edge-colouring
On Galvin orientations of line graphs and list-edge-colouring arxiv:1508.0180v1 [math.co] 7 Aug 015 Jessica Mconald Abstract The notion of a Galvin orientation of a line graph is introduced, generalizing
More information36 Modular Arithmetic
36 Modular Arithmetic Tom Lewis Fall Term 2010 Tom Lewis () 36 Modular Arithmetic Fall Term 2010 1 / 10 Outline 1 The set Z n 2 Addition and multiplication 3 Modular additive inverse 4 Modular multiplicative
More information9.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 information6. 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 informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationVertex Colorings without Rainbow or Monochromatic Subgraphs. 1 Introduction
Vertex Colorings without Rainbow or Monochromatic Subgraphs Wayne Goddard and Honghai Xu Dept of Mathematical Sciences, Clemson University Clemson SC 29634 {goddard,honghax}@clemson.edu Abstract. This
More informationProgress Towards the Total Domination Game 3 4 -Conjecture
Progress Towards the Total Domination Game 3 4 -Conjecture 1 Michael A. Henning and 2 Douglas F. Rall 1 Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006 South Africa
More informationTreewidth 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 informationMulticasting in the Hypercube, Chord and Binomial Graphs
Multicasting in the Hypercube, Chord and Binomial Graphs Christopher C. Cipriano and Teofilo F. Gonzalez Department of Computer Science University of California, Santa Barbara, CA, 93106 E-mail: {ccc,teo}@cs.ucsb.edu
More informationGraphs connected with block ciphers
Graphs connected with block ciphers OTOKAR GROŠEK Slovak University of Technology Department of Applied Informatics Ilkovičova 3 812 19 Bratislava SLOVAKIA PAVOL ZAJAC Slovak University of Technology Department
More informationOn the computational complexity of the domination game
On the computational complexity of the domination game Sandi Klavžar a,b,c Gašper Košmrlj d Simon Schmidt e e Faculty of Mathematics and Physics, University of Ljubljana, Slovenia b Faculty of Natural
More informationMa/CS 6b Class 5: Graph Connectivity
Ma/CS 6b Class 5: Graph Connectivity By Adam Sheffer Communications Network We are given a set of routers and wish to connect pairs of them to obtain a connected communications network. The network should
More informationA step towards the Bermond-Thomassen conjecture about disjoint cycles in digraphs
A step towards the Bermond-Thomassen conjecture about disjoint cycles in digraphs Nicolas Lichiardopol Attila Pór Jean-Sébastien Sereni Abstract In 1981, Bermond and Thomassen conjectured that every digraph
More informationBounds 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 informationOn the Complexity of the Policy Improvement Algorithm. for Markov Decision Processes
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes Mary Melekopoglou Anne Condon Computer Sciences Department University of Wisconsin - Madison 0 West Dayton Street Madison,
More informationProperly even harmonious labelings of disconnected graphs
Available online at www.sciencedirect.com ScienceDirect AKCE International Journal of Graphs and Combinatorics 12 (2015) 193 203 www.elsevier.com/locate/akcej Properly even harmonious labelings of disconnected
More informationCHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
More informationPlanar Graphs with Many Perfect Matchings and Forests
Planar Graphs with Many Perfect Matchings and Forests Michael Biro Abstract We determine the number of perfect matchings and forests in a family T r,3 of triangulated prism graphs. These results show that
More informationVertex-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 informationMonochromatic loose-cycle partitions in hypergraphs
Monochromatic loose-cycle partitions in hypergraphs András Gyárfás Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences Budapest, P.O. Box 27 Budapest, H-364, Hungary gyarfas.andras@renyi.mta.hu
More informationPartitioning 3-colored complete graphs into three monochromatic cycles
Partitioning 3-colored complete graphs into three monochromatic cycles András Gyárfás, Miklós Ruszinkó Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, P.O. Box 63, Hungary,
More informationarxiv: v1 [math.co] 13 Aug 2017
Strong geodetic problem in grid like architectures arxiv:170803869v1 [mathco] 13 Aug 017 Sandi Klavžar a,b,c April 11, 018 Paul Manuel d a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia
More informationAlphanumeric Divisibility
Alphanumeric Divisibility Robert Israel, University of British Columbia, israel@math.ubc.ca Stan Wagon, Macalester College, wagon@macalester.edu [Corresponding author] Take a word using at most 10 letters,
More informationRainbow game domination subdivision number of a graph
Rainbow game domination subdivision number of a graph J. Amjadi Department of Mathematics Azarbaijan Shahid Madani University Tabriz, I.R. Iran j-amjadi@azaruniv.edu Abstract The rainbow game domination
More informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 3 Solutions February 14, 2013 Introduction to Graph Theory, West Section 2.1: 37, 62 Section 2.2: 6, 7, 15 Section 2.3: 7, 10, 14 DO NOT RE-DISTRIBUTE
More informationA.1 Numbers, Sets and Arithmetic
522 APPENDIX A. MATHEMATICS FOUNDATIONS A.1 Numbers, Sets and Arithmetic Numbers started as a conceptual way to quantify count objects. Later, numbers were used to measure quantities that were extensive,
More informationOn t-restricted Optimal Rubbling of Graphs
East Tennessee State University Digital Commons @ East Tennessee State University Electronic Theses and Dissertations 5-2017 On t-restricted Optimal Rubbling of Graphs Kyle Murphy East Tennessee State
More informationUnlabeled equivalence for matroids representable over finite fields
Unlabeled equivalence for matroids representable over finite fields November 16, 2012 S. R. Kingan Department of Mathematics Brooklyn College, City University of New York 2900 Bedford Avenue Brooklyn,
More informationChordal deletion is fixed-parameter tractable
Chordal deletion is fixed-parameter tractable Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de Abstract. It
More information