# 2-partition-transitive tournaments

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 -partition-transitive tournaments Barry Guiduli András Gyárfás Stéphan Thomassé Peter Weidl Abstract Given a tournament score sequence s 1 s s n, we prove that there exists a tournament T on vertex set {1,,..., n} such that the degree of any vertex i is s i and the subtournaments of T on both the even and the odd vertices are transitive in the given order. This means that i beats j whenever i < j and i j (mod ). For any score sequence, we give an algorithm to construct a tournament of the above form, i.e. it is transitive on evens and odds in the given order. This algorithm fixes half of the edges of the tournament and then is similar to the algorithm for constructing a tournament given its score sequence. Another consequence provides asymptotics for the maximum number of edges in score unavoidable digraphs. From a result of Ryser, it is possible to get from any tournament to this special tournament by a sequence of triangle reversals. We show that n / reversals are always enough and that in some cases (1 o(1))n /3 are required. We also show that such a sequence of triangle reversals can be found in O(n ) time. 1 Introduction A tournament T = (V, E) is an orientation of a complete graph, i.e. it is a directed graph such that (x, y) E (y, x) E. If (x, y) E, we write x y and say that x dominates y. The degree of a vertex x, also called its score and denoted by either d(x) or s x, is the number of vertices dominated by x (the out-degree with T viewed as a directed graph). The score sequence of a tournament is the sequence of degrees of its vertices, given in the decreasing order. Let x be a vertex of a tournament T and S a subset of T, we denote by d S (x) the number of elements in S which are dominated by x. The triple (a, b, c) is called a directed triangle (or simply a triangle) if (a, b), (b, c), (c, a) E. We similarly define directed cycles. A reversal of a directed cycle in a tournament is an operation that reverses the edges in the directed cycle. This operation does not alter the score sequence. Two tournaments T and T defined on the same set of vertices are cycle-reversal-equivalent (resp. triangle-reversal-equivalent) if T can be transformed into T by a succession of cycle reversals (resp. directed triangle reversals). A tournament is called transitive (acyclic) if p q and q r imply that p r. Two vertices a b of a transitive tournament T are consecutive if there is no c in T such that a c and c b. Definition. A tournament is -partition-transitive if there exists a partition of the set of vertices V = A B such that the tournaments induced on both A and B are transitive. Let T be a tournament on set [n] = {1,,..., n} and further let P = {p 1, p,..., p r } [n] be a set such that P induces the transitive subtournament given by p i p j if and only if i < j (we say that P is oriented in the indexed order). For any point x in T \ P, we define the dominancy word of P on x to 1

2 be a 1 a... a r where a i = 1 if p i dominates x, otherwise a i = 0. Clearly, if the word of P on x does not contain 01 then the tournament on P {x} is transitive. We recall the result of Ryser [15] concerning scores and cycle reversals: Theorem 1 (Ryser [15]) If two tournaments T and T are defined on the set V and d T (v) = d T (v) for any v V then T is triangle-reversal-equivalent to T. This result implies in particular that cycle-reversal-equivalence and triangle-reversal-equivalence are the same. A tournament is regular if its score sequence is constant. Following Ryser s theorem all the regular tournaments on k + 1 vertices are cycle-reversal-equivalent. Moreover, there is only one regular tournament on k + 1 vertices which is -partition-transitive: we arrange the k + 1 vertices around a circle and each vertex dominates the next k vertices around the circle clockwise. The following more general question was the starting point for our investigations. For a given tournament score sequence, does there exist a tournament having not only this score sequence but also other prescribed properties such as transitive or bipartite subtournaments of a given size? We may also ask for the maximal number of edges a digraph D n on n vertices can have such that for each score sequence of length n there exists a tournament having the given score sequence and containing D n as a subdigraph. Digraphs which satisfy this condition are called score unavoidable. Our main result states that for a given score sequence with s 1 s... s n there exists a tournament T on the vertex set {1,..., n} such that the degree of any vertex i is indeed s i and the subtournaments of T on both the even and the odd vertices are transitive in the given order. This means that i dominates j whenever i < j and i j (mod ). We say that T is a balanced -partition transitive tournament. As a consequence of this result we remark that in order to construct a tournament from a given score sequence we can fix roughly half of the edges in advance. Thus we immediately obtain the lower bound n n for the maximal number of edges in a score unavoidable digraph n Dn. We show that is an upper bound. Let T be a tournament and T be a balanced -partition transitive tournament with the same score sequence as T, which we showed exists. In light of Theorem A, we may ask for the minimal number of triangle reversals which are necessary to transform T into T. If V (T ) = n then we can bound this quantity between n above and (1 o(1))n /3 below, thus determining the order of magnitude. Partition into two transitive tournaments In this section we prove that for any score sequence, there is a tournament which is -partition transitive. Theorem Every tournament T is cycle-reversal-equivalent to a -partition transitive tournament. Proof. We use induction on the size of T. It is clear that if T contains two vertices, then T is - partition-transitive. Let V (T ) = n and assume that the theorem is true for all tournaments on fewer than n points. Let x be a point in the tournament. By the inductive hypothesis, there is a sequence of cycle reversals on T \ {x} which makes it -partition-transitive. We may assume that T \ {x} is already in this form with partition A B, and that the partition has certain extremal properties with respect to all possible tournaments in the cycle-reversal-equivalence class of T, specifically: We consider a partition where A is minimal in size and the dominancy word of A (where the elements of A are indexed in the transitive order) on x is maximal with respect to the lexicographic order. Suppose for contradiction that x cannot be added to A so that their union is transitive, then the word of A on x contains 01, thus there are two vertices a and b, consecutive in A, such that x a, a b, and b x.

3 1 b d 0 a c x A As A is minimal in size, we cannot add b to B, thus there exist c and d consecutive in B such that b c, c d, and d b. If c a, then we could reverse (a, b, c) keeping A and B transitive and increasing the dominancy word of A on x. Hence by our assumption that this word is maximal, we have a c. But now we reverse the cycle (x, a, c, d, b) and the dominancy word of A on x is increased. Contradiction. We note that Theorem can be derived easily from the following result of Ryser [1] (Theorem 5.) (see also Fulkerson [7] and Moon [13]). The cited proofs of this are more difficult than our cycle reversal argument. We need one more definition before we can state his theorem. If T is a tournament on vertex set [n] with score sequence (in the increasing order) s 1 s s n, then an upset is an edge i j for i < j. We now state Ryser s result which says that the trivial lower bound on the number of upsets in a tournament with given score sequence can always be achieved by some tournament. Theorem 3 For every score sequence s 1 s s n, there exists a tournament T on vertex set [n] such that the number of upsets is s i i + 1. i : s i>i 1 Theorem 3 implies that every vertex i satisfies at least one of the following properties: - For every j < i, we have i j in T. - For every j > i, we have j i in T. Thus we can partition the vertices into two sets depending on which property they satisfy (vertices satisfying both properties are placed arbitrarily). This gives a -partition of the vertex set required for Theorem. We next show that the -partition can be done in a balanced way which leads to a canonical construction of a -partition-transitive tournament. It was suggested by Rigollet and Thomassé that, given a score sequence in decreasing order, one can construct a tournament such that the restrictions on both odd and even indexed vertices are transitive and oriented in the indexed order. In the next section, we prove that this is possible. 3 Balanced partition into two transitive tournaments We wish to prove the above-mentioned theorem by induction. The problem is that removing a vertex does not keep the score sequence in the right order, and for this reason, it is advantageous to make the statement stronger so that induction will be easier. We will prove the following statement concerning subsets of T. Theorem Let T be a tournament and S any subset {x 1, x,..., x n } of T with points labeled so that d(x i ) d(x j ) whenever 1 i < j n. Then T can be transformed by a sequence of cycle reversals into a tournament T having the property that the restriction of T to both {x 1, x 3, x 5,...} and {x, x, x 6,...} is transitive and oriented in the indexed order. B 3

4 We first need some tools which link cycle reversal and degree. Here is one fundamental observation: Lemma 1 Let A be a subset of T such that x A and y A. If d(x) d(y) and d A (y) d A (x) p, then there exist at least p vertices z 1, z,..., z p in T \ A such that x z i and z i y for any 1 i p. Proof. Let B = T \ A, we have d A (x) + d B (x) d A (y) + d B (y). Since d A (y) d A (x) p, we get d B (x) d B (y) p. So there exist at least p elements of B satisfying the statement. Corollary 1 Let x and y be two vertices of T such that d(x) d(y) and y x. Then there is a vertex z of T such that x z and z y. Proof of Theorem. We will prove the theorem by induction. For n =, the theorem is clearly true. We suppose it is true for n, and prove it for n+1, let S = {x 1, x,..., x n+1 } be a subset of T such that for any 1 i < j n + 1, d(x i ) d(x j ). In the following, when we refer to the index of an element, it is always with respect to its position in S. We apply the inductive hypothesis to the set {x, x 3,..., x n+1 } so that we now have two transitive tournaments E = {x, x, x 6,...} and O = {x 3, x 5, x 7,...} oriented in the indexed order. Let R be the set T \ S. Thus {R, O, E, {x 1 }} is a partition of T. Our goal is to reverse cycles to add x 1 to O in such a way that it dominates all elements of O. The cycle reversals performed will leave E and O unchanged, and in this way we achieve our goal. We assume that this is not possible, and among all possible ways of reversing cycles of T to make E and O transitive and oriented in the index order, we consider one that satisfies the following two conditions: Condition 1 The number of elements of O which x 1 dominates is maximal, (in other words d O (x 1 ) is maximal). Condition The first element from O which dominates x 1 has minimal index. We now analyze this tournament, determine properties of it, and then arrive at a contradiction. First we notice that there is an element in O that dominates x 1. For if there were not, we could add x 1 to O, achieving the claim of the theorem. Proposition 1 The point x 1 dominates x 3. Proof. If rather x 3 x 1, then by Corollary 1 (here d(x 1 ) d(x 3 )) there must be an element z such that x 1 z and z x 3. This element z cannot belong to O because it dominates x 3. Reversing the cycle (x 1, z, x 3 ) leads to a contradiction of Condition 1. Now we denote by v the element of O with lowest index such that v x 1. As v is different from x 3, let u be the predecessor of v in O; let p be the number for which v = x p+1 and u = x p 1. Now we call O 1 the set of predecessors of u in O and O the set of successors of v in O. Clearly {O 1, {u, v}, O } is a partition of O. Moreover any element of O 1 is dominated by x 1 by the definition of v. Remark that there is no z T such that u z and z v. (If there were, then such a z could not belong to O and we could reverse the cycle (x 1, u, z, v), contradicting Condition.) Proposition There is no z T \ {x 1 } such that v z and z u. Proof. If there were, then we consider A = {u, v, x 1, z}. We have d(u) d(v) and d A (v) d A (u) = 1, thus by Lemma 1 there would be an element w such that u w and w v, contradicting the preceding remark. Now, except for x 1, the vertices u and v dominate the same set of vertices (Remark: {u, v} is an interval (or autonomous subset) of T \ {x 1 }). We discuss now which vertices in E are dominated by u and v: let E 1 be the set of vertices of E which dominate u and v. Conversely, let E be the set of vertices of E dominated by u and v (see the figure at the end of the proof).

6 E E 1 R z x m w q+1 = x. m+1. w O. w 1 v u x O 1 x 1 The degree of w q+1 = x m+1 in A is at least E A, as w q+1 dominates every element of E. Therefore d A (w q+1 ) m q. The degree of x m in A is at most m [(q +1)+(m 1)+], as any element of W dominates x m ; all m 1 first elements of E dominate x m ; and both u and v dominate x m (u and v dominate all elements of E ). So d A (x m ) m q. As d(x m ) d(x m+1 ) and d A (x m ) < d A (x m+1 ), we may now apply Lemma 1 to show that there is an element z T \ A such that x m z and z x m+1. We remark that z cannot belong to E \ A because x m+1 dominates any element of E, moreover, z does not belong to O \ A because x m+1 dominates any element of O. Thus z R. We now consider the following cycle on seven elements (picture): (z, x m+1, x, v, x 1, u, x m ). Reversing this cycle leads to a contradiction of Condition. This completes the proof of the theorem. Consequences of balanced -partitions In this section we will give two applications of Theorem. A digraph D n is called unavoidable if it is a subdigraph of every tournament T on n vertices. There is extensive literature on unavoidable digraphs (cf. e.g. [11] and the literature cited there). In [11] they determine the asymptotics for the maximum number of edges in an unavoidable digraph D n. In a natural way, we define a digraph D n on n vertices to be score unavoidable if for every n component score sequence, there exists a tournament T with the given score sequence and containing D n as a subdigraph. We prove the following similar result. Theorem 5 Let D n be a score unavoidable digraph with the maximum number of edges. Then n n n E(D n ). Proof. The lower bound is an immediate consequence of Theorem. 6

7 To prove the upper bound, we will show that if D n is a score unavoidable digraph with outdegrees d 1 d d n, then k 1 d k, 1 k n. The upper bound then follows trivially from this. The claim follows from the observation that if a tournament T has k vertices with score at most s k, then D n must have at least k vertices with outdegree not greater than k; this is equivalent to saying that d k s k where the s i s and the d i s are both in nondecreasing order. Hence, we only need to give for each k, a tournament score sequence on n vertices with s k = (k 1)/ (where s k is the k-th smallest score). We take the score sequence of a tournament which is as regular as possible on the first k vertices, and for the larger indexed vertices i, i beats j if i > j. More precisely, this score sequence is given by s i = (k 1)/ for i k/, s i = (k 1)/ for k/ < i k, and s i = i 1 for k < i n. This completes the proof. The next goal of this section is to use Theorem in order to give an algorithm to construct a tournament from a given score sequence. The advantage of using this theorem is that we can specify roughly half of the edges at the beginning. A bipartite tournament is an orientation of a complete bipartite graph. The score sequence of a bipartite tournament consists of two sequences of integers, these are the outdegrees of the vertices of each class of the bipartite tournament. First we will recall the characterization of tournament score sequences and bipartite tournament score sequences. We remark that all of these are special cases of the characterization by Moon [1] for n-partite tournaments. We also mention that Bang and Sharp [] give a very nice proof of the first part of the following theorem using Hall s theorem which can easily be extended to the n-partite case. Theorem 6 (Landau [10]; Gale [8] and Ryser [1]) (1) A sequence of integers S = (s 1,..., s n ) is a score sequence of a tournament if and only if for any subset A of [n], we have ( ) A s i, i A with equality when A = n. () Two sequences of integers S = (s 1,..., s n ) and T = (t 1,..., t m ) are the score sequence of a bipartite tournament if and only if for any A [n] and B [m], we have t j A B, with equality when A = n and B = m. i A s i + j B As a consequence of Theorem, if S = (s 1, s,..., s n ) is a score sequence of tournament given in the increasing order, we know that we can find a tournament having this score sequence such that the restrictions on both evens and odds are transitive tournaments oriented from larger indexed vertices to smaller indexed vertices. It follows that Corollary If s 1 s s n is the score sequence of a tournament given in the increasing order, then {s 1, s 3 1, s 5, s 7 3,...} and {s, s 1, s 6, s 8 3,...} are score sequences of a bipartite tournament. This remark gives rise to the following algorithm to construct a -partition-transitive tournament from a given score sequence S: 7

8 1) Order S = {s 1, s, s 3,..., s n } in an increasing way. ) Split it into S 1 = {s 1, s 3 1, s 5,...} and S = {s, s 1, s 6,...}. We now apply the algorithm (Beineke and Moon [3] pp ) to construct a bipartite tournament from a bipartite score sequence. 3) Order S in the increasing order, let S = {j 1, j,..., j t }. ) As long as S 1 is not empty, pick a minimal integer i in S 1. 5) Let k be the minimal index such that j k = j i and l be the maximal index such that j l = j i. 6) Add the arrows j s i and decrease j s by 1 whenever s > l or k s l + k i. In the other cases, add the arrow i j s. 7) Delete i from S 1 and apply 5) This algorithm is twice as fast as the usual algorithm used to construct tournaments from score sequences (see [13], p. 73). 5 Number of triangle reversals As our proofs give an algorithm to construct a -partition-transitive tournament via cycle (triangle) reversals, it is natural to ask how many triangle reversals are needed. This question is related to work done by Brualdi and Qiao [5], where they investigate the interchange graph for a given score sequence. Let S be a score sequence of length n and let G(S) be the graph whose vertices are all labeled tournaments with score sequence S, and two tournaments T and T are connected by an edge if T can be transformed into T via a triangle reversal. Brualdi and Qiao give an example of two tournaments whose distance is (n 1) / (their Corollary 3.9). The difference with our approach is that we are not concerned with labelings. For our purposes, we are interested in the graph G(S) whose vertices are (unlabeled) tournaments with a given score sequence, hence our graph is a contraction of their graph for all isomorphism classes. In the example in [5], the two tournaments at large distance are isomorphic, and hence the same vertex in our graph. The results of Brualdi and Qiao give an upper bound for the diameter of the graph G(S). The next theorem is not explicitly stated in [5], but follows from their techniques. Theorem 7 For any score sequence S, the diameter of the graph G(S) is at most (n 1)(n )/. Proof. Let T and T be two tournaments with identical score sequence S. Consider the simple graph T T, with the same vertex set and whose edges are those directed edges from T that are reversed in T. The first observation is that T T is an Euler graph (in the sense that for every vertex, the in-degree equals the out-degree it may not be connected). Thus this can be partitioned into edge-disjoint cycles, and we have a set of cycles whose reversals gets us from T to T. At most all of the edges can be contained in this graph, hence at most ( n ) edges. The second observation is that in a tournament, the reversal of a cycle of length k can be accomplished by k triangle reversals (this follows easily by induction). Let C 1, C,..., C N be the cycles, c i = C i. Thus we want to bound N i=1 (c i ). Let t = N i 1 c i. We have ( ) n t and t nn. The second inequality implies that N t/n and it follows that the number of triangle reversals is: 8

9 . (n 1)(n ) t N t t/n One approach to get a better bound for the diameter of G(S) is given in the following problem. Let ρ(d) denote the maximum number of directed cycles in an Euler graph D. Problem 1 Find the best c such that min ρ(d) V (D) =n cn. We show that there are tournaments which are at a distance cn from a -transitive-partition tournament with the same score sequence. We consider the Paley tournament (also called the quadratic residue tournament). Let p 3 (mod ) be a prime, and consider the tournament defined on the finite field of p elements, i.e. [p 1], given by ( ) i j i j if and only if, p ( ) where is the quadratic residue of a modulo p, defined to be 0 if a is zero, 1 if a is a square modulo a p p, and 1 if a is not a square. This is a well-defined tournament as 1 is not a square for such p and hence exactly one of i j and j i is a square. This tournament has many interesting properties and has been studied frequently (cf. e.g. [1], [], [9], [13]). We prove the following result: Theorem 8 For the Paley tournament on p vertices, at least (1 o(1))p /3 triangle reversals are required to transform it into a balanced -partition transitive tournament. The one important property we will use is that for any two vertices i and j, the number of vertices dominated by both i and j is (p 3)/, independent of which two vertices we consider. As the proof is rather short, we include it. The number of vertices d dominated by both i and j is given by the sum (over all elements of the field of p elements not equal to i and j) d = 1 (( ) ) (( ) ) i k j k p p k i,j = 1 ( ) ( ) i k j k + 1 ( ) i k + 1 ( ) j k + p p p p p k i,j We now use the fact that k ( k p k ) = 0, and that the quadratic character is multiplicative. d = 1 = 1 ( (i k)/(j k) p ( 1 + (i j)/(j k) k i,j k i,j p k ) + p ) + p We notice that the sum is over all numbers in the field except 0 and 1. Hence its sum is 1 and d = (p 3)/. 9

10 Proof of Theorem 8. We will get a lower bound on the number of edge reversals needed, and in this way we get a lower bound on the number of triangle reversals as well. Let A and B be the final balanced partition, where A = {a 1,..., a (p 1)/ } and B = {b 1,..., b (p+1)/ }, in the transitive order. Consider the edges from the pair of vertices a i 1 and a i to all larger indexed vertices in A. There can be at most (p 3)/ edges correct, so we need to reverse at least (p 1)/ (p 3)/ i = (p + 1)/ i edges for each 1 i (p 1)/8. Adding these up we get: ( ) ( ) ( ) p + 1 p + 1 p p 1p Each of these edges must be reversed, and similarly we need at least that many in B, hence at least (1 o(1))p /3 edge reversals in the tournament. Any triangle can correct at most one edge. If all three vertices are in set A (equivalently in B), then it can correct two, but at the cost of making what was a good edge bad. If the vertices are in both A and B, then only one edge is switched. Hence we need at least (1 o(1))p /3 triangle reversals in the Paley tournament. A natural question is that of how fast one can find a sequence of triangle reversals to get from an arbitrary tournament T to either a given tournament T with equal score sequence, or to a balanced -partition-transitive tournament with equal score sequence. We will show that both of these can be done in O(n ). Theorem 9 Given two tournaments T and T with the same score sequence, it is possible to find a sequence of triangle reversals in O(n ) time that converts T into T. As a simple consequence of this theorem and the above algorithm that constructs a balanced - partition-transitive tournament in O(n ) time, we have the following corollary. Corollary 3 Given a tournament T, it is possible to find a sequence of triangle reversals in O(n ) time that convert T into a balanced -partition-transitive tournament. Proof of Theorem 9 We consider the directed graph D = T T mentioned above where the edges are those of T that are reversed in T. As we mentioned before, this graph is Euler (and can be found trivially in O(n ) time). We can find the components of D in O(E(D)) time and then for each (Eulerian) component D i of D we can apply any algorithm which finds an Euler circuit in D i in O(E(D i )) time (cf. [6]). After this we can consider each D i as an Euler circuit as well. We then consider the components one at a time. In a component, choose a starting vertex u, called a pivot vertex, of the Euler circuit and in the list describing the Euler curcuit we check the direction of the edge of T from the given vertex v to the pivot vertex u. Then starting from u, we divide the Euler circuit into triangles. Every triangle will contain u and two adjacent vertices in the Euler circuit. We do this recursively by decreasing the length of the Euler circuit one edge at a time. To state it more precisely, let C be the current Euler circuit of T, starting and ending at u with edge sequence starting with e, f, g. We shall use v for the third vertex of C, i.e. for the endpoint of f. Our algorithm is to apply the following recursive procedure repeatedly for each i with initial Euler circuit C = D i. If u dominates v (in T ) then we apply the algorithm recursively to the Euler circuit of T we get from the current one by replacing e, f with (u, v) and then reverse the triangle e, f, (v, u). Otherwise we reverse the triangle first and we apply the algorithm recursively as before, unless when g = (v, u), in that case we apply the algorithm recursively to the Euler circuit we get from the current one by removing e, f, g. This may lead to the empty Euler circuit, in which case the algorithm stops. It is easy to see that the algorithm reverses only triangles with all three edges in T and after its termination precisely the edges of D are reversed. Therefore the tournament T is obtained. 10

11 Clearly at most O(E(D i )) edges have to be checked in component i. These are additive and therefore O(n ) + O(E(D)) = O(n ) time (and space) is enough to find the triangle reversals. We end with the following natural question related to Problem 1. Problem Determine the maximum diameter of the graph G(S) over all score sequences S. 6 Acknowledgements The first three authors would like to thank the organizers of the October, 1995, Combinatorial Workshop in Mátraháza, Hungary, where we started our collaboration on this research. The first two authors are partially supported by OTKA grant 161. The third author is supported by Coopération PROCOPE 9-95, contrat 910, Mathématiques Discrètes. The last author is supported by SFB 33, Diskrete Strukturen in der Mathematik, Universität Bielefeld. References [1] N. Alon and J. H. Spencer, Probabilistic Method, John Wiley & Sons, New York, 199. [] C. M. Bang and H. Sharp, Jr., Score Vectors of Tournaments, J. Combinatorial Theory Series B 6 (1979), pp [3] L. W. Beineke and J. W. Moon, On Bipartite Tournaments and Scores, Collection: The Theory and Applications of Graphs (Kalamazoo, Mich., 1980), Wiley, New York, 1981, pp [] L. W. Beineke and K. B. Reid, Tournaments, Selected Topics in Graph Theory (ed. L. W. Beineke and R. J. Wilson), Academic press, London, 1978, pp [5] R. A. Brualdi and L. Qiao, The interchange graph of tournaments with the same score vector, in Progress in Graph Theory, Academic Press, Toronto 198, pp [6] S. Even, Graph Algorithms, Computer Science Press, Rockville, [7] D. R. Fulkerson, Upsets in round robin tournaments, Canad. Journ. Math. 17 (1965), pp [8] D. Gale, A theorem of flows in networks, Pac. J. Math. 7 (1957), pp [9] R. L. Graham and J. H. Spencer, A constructive solution to a tournament problem, Canad. Math. Bull. 1 (1971), pp [10] H. G. Landau, On dominance relations and the structure of animal societies, III: The condition for a score structure, Bull. Math. Biophys. 15 (1953), pp [11] N. Linial, M. Saks, V. T. Sós, Largest digraphs contained in all n-tournaments, Combinatorica 3 (1983), pp [1] J. W. Moon, On the score sequence of an n-partite tournament, Canad. Math. Bull. 5 (196), pp [13] J. W. Moon, Topics on Tournaments, Holt, Rinehart and Winston, New York,

12 [1] H. J. Ryser, Combinatorial properties of matrices of zeros and ones, Canad. J. Math. 9 (1957), pp [15] H. J. Ryser, Matrices of zeros and ones in Combinatorial Mathematics, in Recent Advances in Matrix Theory (ed. H. Schneider), 1, Univ. of Wisconsin Press, Madison, 196, pp Barry Guiduli Mathematical Research Institute Hungarian Academy of Science Reáltanoda utca H-1053 Budapest Hungary András Gyárfás Computer and Automation Institute Hungarian Academy of Science Kende utca H-1111 Budapest Hungary Stéphan Thomassé Laboratoire LMD Institut de Mathématiques-Informatique Université Claude Bernard Lyon 1 3 Boulevard du 11 Novembre F-696 Villeurbanne Cedex France Peter Weidl Sonderforschungsbereich 33 Diskrete Strukturen in der Mathematik Universität Bielefeld Postfach D Bielefeld Germany 1

### 1 Digraphs. Definition 1

1 Digraphs Definition 1 Adigraphordirected graphgisatriplecomprisedofavertex set V(G), edge set E(G), and a function assigning each edge an ordered pair of vertices (tail, head); these vertices together

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

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

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

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

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

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

### Generalizing the Ramsey Problem through Diameter

Generalizing the Ramsey Problem through Diameter Dhruv Mubayi Submitted: January 8, 001; Accepted: November 13, 001. MR Subject Classifications: 05C1, 05C15, 05C35, 05C55 Abstract Given a graph G and positive

### Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

### Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Week 9 Lecture Notes Graph Theory For completeness I have included the definitions from last week s lecture which we will be using in today s lecture along with

### Midterm Practice Problems

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

### 10. Graph Matrices Incidence Matrix

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

### Solutions to Exercises 8

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

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

### Graphical degree sequences and realizations

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

### Chapter 4. Trees. 4.1 Basics

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

### 2.3 Scheduling jobs on identical parallel machines

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

### SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

### THE 0/1-BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER

THE 0/1-BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER JONATHAN P. MCCAMMOND AND GÜNTER ZIEGLER Abstract. In 1933 Karol Borsuk asked whether every compact subset of R d can be decomposed

### Divisor graphs have arbitrary order and size

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

### N E W S A N D L E T T E R S

N E W S A N D L E T T E R S 73rd Annual William Lowell Putnam Mathematical Competition Editor s Note: Additional solutions will be printed in the Monthly later in the year. PROBLEMS A1. Let d 1, d,...,

### Week 5 Integral Polyhedra

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

### MIX-DECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3. University of Split, Croatia

GLASNIK MATEMATIČKI Vol. 38(58)(2003), 2 232 MIX-DECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3 Damir Vukičević University of Split, Croatia

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

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

### COLORED GRAPHS AND THEIR PROPERTIES

COLORED GRAPHS AND THEIR PROPERTIES BEN STEVENS 1. Introduction This paper is concerned with the upper bound on the chromatic number for graphs of maximum vertex degree under three different sets of coloring

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### Some Results on 2-Lifts of Graphs

Some Results on -Lifts of Graphs Carsten Peterson Advised by: Anup Rao August 8, 014 1 Ramanujan Graphs Let G be a d-regular graph. Every d-regular graph has d as an eigenvalue (with multiplicity equal

### Product irregularity strength of certain graphs

Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer

### princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

### Proof: A logical argument establishing the truth of the theorem given the truth of the axioms and any previously proven theorems.

Math 232 - Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the

### Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

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

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

### Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

### Coloring Eulerian triangulations of the projective plane

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

### The Real Numbers. Here we show one way to explicitly construct the real numbers R. First we need a definition.

The Real Numbers Here we show one way to explicitly construct the real numbers R. First we need a definition. Definitions/Notation: A sequence of rational numbers is a funtion f : N Q. Rather than write

### Continued Fractions and the Euclidean Algorithm

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

### UNIVERSAL JUGGLING CYCLES. Fan Chung 1 Department of Mathematics, University of California, San Diego, La Jolla, CA Ron Graham 2.

INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7(2) (2007), #A08 UNIVERSAL JUGGLING CYCLES Fan Chung 1 Department of Mathematics, University of California, San Diego, La Jolla, CA 92093 Ron

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### RAMSEY FOR COMPLETE GRAPHS WITH DROPPED CLIQUES

RAMSEY FOR COMPLETE GRAPHS WITH DROPPED CLIQUES JONATHAN CHAPPELON, LUIS PEDRO MONTEJANO, AND JORGE LUIS RAMÍREZ ALFONSÍN Abstract Let K [k,t] be the complete graph on k vertices from which a set of edges,

### Kings in Tournaments. Yu Yibo, Di Junwei, Lin Min

Kings in Tournaments by Yu Yibo, i Junwei, Lin Min ABSTRACT. Landau, a mathematical biologist, showed in 1953 that any tournament T always contains a king. A king, however, may not exist. in the. resulting

### DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

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

### HOMEWORK #3 SOLUTIONS - MATH 3260

HOMEWORK #3 SOLUTIONS - MATH 3260 ASSIGNED: FEBRUARY 26, 2003 DUE: MARCH 12, 2003 AT 2:30PM (1) Show either that each of the following graphs are planar by drawing them in a way that the vertices do not

### The chromatic spectrum of mixed hypergraphs

The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex

### Lecture 17 : Equivalence and Order Relations DRAFT

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

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

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

### The degree, size and chromatic index of a uniform hypergraph

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

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

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

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

### P -adic numbers And Bruhat-Tits Tree

P -adic numbers And Bruhat-Tits Tree In the first part of these notes we give a brief introduction to p-adic numbers. In the second part we discuss some properties of the Bruhat-Tits tree. It is mostly

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

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

### MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 1 9/3/2008 PROBABILISTIC MODELS AND PROBABILITY MEASURES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 1 9/3/2008 PROBABILISTIC MODELS AND PROBABILITY MEASURES Contents 1. Probabilistic experiments 2. Sample space 3. Discrete probability

### Relations Graphical View

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

### 3. Eulerian and Hamiltonian Graphs

3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from

### Introduction to Flocking {Stochastic Matrices}

Supelec EECI Graduate School in Control Introduction to Flocking {Stochastic Matrices} A. S. Morse Yale University Gif sur - Yvette May 21, 2012 CRAIG REYNOLDS - 1987 BOIDS The Lion King CRAIG REYNOLDS

### ERDOS PROBLEMS ON IRREGULARITIES OF LINE SIZES AND POINT DEGREES A. GYARFAS*

BOLYAI SOCIETY MATHEMATICAL STUDIES, 11 Paul Erdos and his Mathematics. II, Budapest, 2002, pp. 367-373. ERDOS PROBLEMS ON IRREGULARITIES OF LINE SIZES AND POINT DEGREES A. GYARFAS* Problems and results

### CSE 20: Discrete Mathematics for Computer Science. Prof. Miles Jones. Today s Topics: Graphs. The Internet graph

Today s Topics: CSE 0: Discrete Mathematics for Computer Science Prof. Miles Jones. Graphs. Some theorems on graphs. Eulerian graphs Graphs! Model relations between pairs of objects The Internet graph!

### CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

### Finding and counting given length cycles

Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected

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

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

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

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

### Collinear Points in Permutations

Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,

### . 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### Course 421: Algebraic Topology Section 1: Topological Spaces

Course 421: Algebraic Topology Section 1: Topological Spaces David R. Wilkins Copyright c David R. Wilkins 1988 2008 Contents 1 Topological Spaces 1 1.1 Continuity and Topological Spaces...............

### 1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

### Introduction to Graph Theory

Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

### Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction.

Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction. February 21, 2006 1 Proof by Induction Definition 1.1. A subset S of the natural numbers is said to be inductive if n S we have

### PRIME FACTORS OF CONSECUTIVE INTEGERS

PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in

### ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

### Intersection Dimension and Maximum Degree

Intersection Dimension and Maximum Degree N.R. Aravind and C.R. Subramanian The Institute of Mathematical Sciences, Taramani, Chennai - 600 113, India. email: {nraravind,crs}@imsc.res.in Abstract We show

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### Lecture 6: Approximation via LP Rounding

Lecture 6: Approximation via LP Rounding Let G = (V, E) be an (undirected) graph. A subset C V is called a vertex cover for G if for every edge (v i, v j ) E we have v i C or v j C (or both). In other

### A simple criterion on degree sequences of graphs

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

### On an anti-ramsey type result

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

### A simple existence criterion for normal spanning trees in infinite graphs

1 A simple existence criterion for normal spanning trees in infinite graphs Reinhard Diestel Halin proved in 1978 that there exists a normal spanning tree in every connected graph G that satisfies the

### 1 Basic Definitions and Concepts in Graph Theory

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

### 6.042/18.062J Mathematics for Computer Science October 3, 2006 Tom Leighton and Ronitt Rubinfeld. Graph Theory III

6.04/8.06J Mathematics for Computer Science October 3, 006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Graph Theory III Draft: please check back in a couple of days for a modified version of these

### 5. Convergence of sequences of random variables

5. Convergence of sequences of random variables Throughout this chapter we assume that {X, X 2,...} is a sequence of r.v. and X is a r.v., and all of them are defined on the same probability space (Ω,

### Chapter 2 Limits Functions and Sequences sequence sequence Example

Chapter Limits In the net few chapters we shall investigate several concepts from calculus, all of which are based on the notion of a limit. In the normal sequence of mathematics courses that students

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

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

### Homework 15 Solutions

PROBLEM ONE (Trees) Homework 15 Solutions 1. Recall the definition of a tree: a tree is a connected, undirected graph which has no cycles. Which of the following definitions are equivalent to this definition

### PROBLEM SET 7: PIGEON HOLE PRINCIPLE

PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### About the inverse football pool problem for 9 games 1

Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute

### GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

### Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

### Lecture 4: The Chromatic Number

Introduction to Graph Theory Instructor: Padraic Bartlett Lecture 4: The Chromatic Number Week 1 Mathcamp 2011 In our discussion of bipartite graphs, we mentioned that one way to classify bipartite graphs

### Planar Tree Transformation: Results and Counterexample

Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem

### The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

### 1 Polyhedra and Linear Programming

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

### arxiv: v1 [math.pr] 22 Aug 2008

arxiv:0808.3155v1 [math.pr] 22 Aug 2008 On independent sets in purely atomic probability spaces with geometric distribution Eugen J. Ionascu and Alin A. Stancu Department of Mathematics, Columbus State

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

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

### Exponential time algorithms for graph coloring

Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].