Graph Theory. Thomas Bloom. February 6, 2015

Size: px
Start display at page:

Download "Graph Theory. Thomas Bloom. February 6, 2015"

Transcription

1 Graph Theory Thomas Bloom February 6,

2

3 Lecture 1 Introduction A graph (for the purposes of these lectures) is a finite set of vertices, some of which are connected by a single edge. Most importantly, we don t allow multiple edges between two vertices, or an edge from a vertex to itself. Remember: no multiple edges or loops. One certainly can study graphs with these allowed, but we won t do so here. More formally, a graph G is defined by two pieces of data: a finite set V (called the vertices of G) and a set E of unordered pairs of elements of V (called the edges of G) so every e E has the form {x, y} for some x, y V with x y. In this case we will write things like G = (V, E), and V (G) for the set of vertices of G and E(G) for the set of edges of G. Note that such a graph is undirected, so the set of edges defines a symmetric relationship on the vertices V. If {x, y} is an edge of G then we will write x y. Thus the study of graphs is precisely the study of symmetric non-reflexive relations on finite sets but the pictorial interpretation is certainly more intuitive! The order of a graph, denoted by G, is the number of vertices. The size of a graph, denoted by e(g), is the number of edges. Lemma 1.1. For any graph G, 0 e(g) ( ) G. 2 The degree of a vertex x, denoted by d(x), is the number of y such that x y that is, the number of edges adjacent to x. The neighbourhood of x, denoted by N(x), is the set of such y, so that d(x) = N(x). As we are only concerned with these objects in a combinatorial way, the set of vertices can be a set of whatever we please. It is often convenient to use {1,..., n} as the set of vertices of a graph of order n. Example 1.1. The empty graph on n vertices is that which has no edges at all; i.e. G = n and e(g) = 0. 3

4 4 LECTURE 1. INTRODUCTION (a) The empty graph on 1 vertex (b) The empty graph on 5 vertices Example 1.2. The complete graph on n vertices is the graph with n vertices and every possible edge, so that e(g) = ( n 2) and x y whenever x y. It is denoted by K n. (a) K 3, the complete graph on 3 vertices (b) K 5, the complete graph on 5 vertices If G = (V, E) is a graph we say that H = (V, E ) is a subgraph of G if V V and E E. It is an induced subgraph if H includes every possible edge (i.e. those edges present in G) between its vertices; that is, if x, y V and {x, y} E(G) then {x, y} E(H). As usual in mathematics, if two objects are trivially the same, then we don t distinguish between them this is formalised with the notion of an isomorphism. An isomorphism between two graphs φ : G 1 G 2 is a bijection between V (G 1 ) and V (G 2 ) such that x G1 y if and only if φ(x) G2 φ(y). We treat isomorphic graphs as the same graph. Lemma 1.2. For any graph G d(v) = 2e(G). v V Proof. If one thinks about it, this is obvious each edge contributes 1 to the degree of each of its vertices, so it contributes exactly 2 to the sum over all degrees. It s not hard to turn this into a more formal proof, as below. We can write d(v) = 1 v e, and hence d(v) = v V v V e E(G) e E(G) 1 v e = e E(G) v V 1 v e. The inner sum, however, is always exactly 2, for it counts, for any fixed edge, the number of vertices incident to the edge e.

5 5 A graph is bipartite if we can partition the vertex set V (G) into two disjoint sets V 1 and V 2 such that every edge of G goes between the two sets, and there are no interior edges that is, if x y then x V 1 and y V 2 or vice versa. A path of length l, denoted by P l, is a graph with vertex set {0,..., l} and edge set E(P l ) = {{i, i + 1} : 0 i < l}. Equivalently, a path can be thought of as a sequence of vertices v 0 v l such that v i v i+1 for 0 i < l (this interpretation is useful when trying to find paths as subgraphs of other graphs). Observe that P l has size l and order l+1. A cycle of size l (and order l), denoted by C l, is a path of length l 1 with an added edge between 0 and l 1 or, again, a sequence of vertices v 1 v l such that v 1 v l and v i v i+1 for 1 i < l. Observe that K 3 = C 3. (a) P 3, the path of length 3 (b) C 4, the cycle of length 4 Lemma 1.3. A bipartite graph contains no odd cycles. Proof. Let G be a bipartite graph with vertex classes V 1 and V 2. Let x 1... x n be a cycle in G. Without loss of generality we may suppose that x 1 V 1. Since x 1 x 2 and G is bipartite we must have x 2 V. In general (use induction to be formal), we observe that x i V 1 if i is odd and x i V 2 if i is even. Furthermore, since it is a cycle we have x 1 x n and hence x n V 2, and so n is even as claimed. Remark 1.1. The converse also holds so if a graph contains no odd cycles then it must be bipartite. For a proof, see the exercise sheet (though this result is not examinable). One last definition: we say that a graph is connected if there exists a path between any two vertices. Intuitively, the point is that no part of the graph is cut-off from another. Recap of terminology make sure you re comfortable with all these terms! order of a graph size of a graph degree of a vertex, d(v)

6 6 LECTURE 1. INTRODUCTION neighbourhood of a vertex, N(v) bipartite graph complete graph path cycle connected There are lots of directions one can take in the study of graphs; in these lectures we focus on so-called extremal problems: given a graph G, give a fairly simple global criterion for G to contain some specified subgraph (for example, a path, a cycle, or a complete graph), which is a local property. The simplest criterion is having enough edges if we fix the order of the graph, then how many edges do we need to force G to contain the subgraph. To whet your appetites, here is a classical theorem of this type. Theorem 1.1 (Mantel s theorem). If G is a graph of order n and e(g) > n 2 /4 then G contains a triangle. Proof. Suppose that G is a graph of order n which contains no triangles. This means that if x y then there is no z G such that x z and y z, or else xyz forms a triangle in G. Thus N(x) N(y) =, and so N(x) + N(y) = N(x) N(y) n. Thus, for any x y we have d(x) + d(y) n. If we sum this inequality over all edges then we have 1 x e1 1 x e2 and hence d(x) 2 = x G x G = = e 1,e 2 E(G) e E(G) x G {x,y} e(g) 1 x e f E(G) (d(x) + d(y)) d(x) 2 ne(g). x G By the Handshaking Lemma and Cauchy s inequality 1 x f ( 2 ( ) (2e(G)) 2 = d(x)) n d(x) 2. x G x G

7 7 Thus 4e(G) 2 n 2 e(g), and so e(g) n 2 /4 and the proof is complete. We should check to see if this theorem can be improved but this is where Lemma 1.3 is useful, since a bipartite graph will contain no triangles. To have the most edges possible, it therefore seems sensible to split the graph into two disjoint sets and add every possible edge between those two sets. Indeed, it is easy to check that if n is even then such a graph contains no triangles and contains precisely n 2 /4 edges. Figure 1.4: A graph on 8 vertices with 16 edges with no triangle Both Mantel s theorem and the simple bipartite construction showing that it is sharp can be generalised for, not just triangles (which are complete graphs on 3 vertices) but to complete graphs on any number of vertices which we will see in Lecture 4! Exercises Nothing defined solely in an exercise will be examinable, and the exercises will not count towards your final mark. Nonetheless, I strongly recommend that you attempt all of the exercises for each lecture this will ensure that you properly understand the material. Exercise 1.1. For any x, y G let d(x, y) be the distance between x and y, defined as the length of the shortest path between x and y. For example, if x y then d(x, y) = 1. By considering the parity of d(x, y), prove that if a graph contains no odd cycles then it must be bipartite. Exercise 1.2. A tree is a connected graph with no cycles. By induction on n, show that a tree of order n has size n 1. Deduce using Lemma 1.2 that a tree has at least 2 vertices of degree 1. Exercise 1.3. Prove that every graph of order at least 2 contains at least two vertices with the same degree.

8

9 Lecture 2 Matchings Let G be a bipartite graph, with vertex classes V 1 and V 2. A matching from V 1 to V 2 is a set of independent edges (that is, edges which do not touch each other) which cover every vertex in V 1 (that is, every vertex of V 1 is in one of the edges). More formally, if V 1 = {v 1,..., v m } then a matching from V 1 is a set of edges e 1,..., e m E(G) such that v i e i for 1 i m and if i j then e i e j =. In this lecture we will consider the problem of finding necessary and sufficient conditions for such a graph to contain a matching. This problem is popularly called the marriage problem we can think of one vertex set as a set of men, the other as a set of women, and join two vertices if they are amenable to the idea of marriage. Asking if this graph contains a matching is then asking if we can pair everybody up to their mutual satisfaction. Let s first consider what is a necessary condition. Obviously, there must be at least one vertex in V 2 for every vertex in V 1, since a matching gives an injective function from V 1 into V 2. This condition is clearly not sufficient, however trivially, we might have the graph with no edges, and then there is no hope of a matching! The next necessary condition we observe, then, is that if V 1 = m, then the graph must have at least m edges, one for each vertex of V 1 we need to match. This condition is necessary, but it too fails to be sufficient for example, consider the graph where every y V 2 is joined to the same x V 1, and there are no other edges. If we consider what fails in this graph, we are led to a more general necessary condition not only must there be people available to match with everyone in V 1, but the same must be true for any subset of V 1. More formally, if X V 1 then N(X) X, where N(X) = N(x) = {w G : w v for some v X}. v X It is a striking theorem that this simple condition is not only necessary, but also sufficient. 9

10 10 LECTURE 2. MATCHINGS Theorem 2.1 (Hall s theorem, 1935). A bipartite graph G with vertex sets V 1 and V 2 has a matching from V 1 to V 2 if and only if for all X V 1. N(X) X (2.1) The condition (2.1) is also known as Hall s condition, or Hall s criterion. That Hall s condition is necessary for the presence of a matching is clear, as mentioned above. The hard part of the theorem is that this condition is also sufficient; that is, if (2.1) holds for all X V 1 then there exists a matching. This theorem is important enough that we give two, quite different, proofs. Proof. We use induction on m = V 1. For m = 1 the condition is clearly sufficient (check this!). Suppose that m 2 and that the theorem holds for all m < m. If strict inequality holds in (2.1) for every X V 1, i.e. N(X) X + 1 (2.2) for every X V 1, then we can choose any edge as part of the matching, say {x, y}, and remove it and its two vertices from the graph. We now claim that the remaining graph, G\{x, y}, still satisfies (2.1). For suppose not; then there exists a set W V 1 \{x} such that N(W )\{y} < W, but then N(W ) < W + 1, which contradicts (2.3). By induction there therefore exists a matching from V 1 \{x} to V 2 \{y}, and adding the edge between x and y gives a matching from V 1 to V 2 as required. Finally, suppose that (2.3) does not hold for every X V 1 ; then since G does satisfy (2.1) there must exist some X V 1 such that N(X) = X < m. By induction there exists a matching from X to N(X) fix any such matching. It remains to show that the graph induced by G\(X N(X)) still satisfies (2.1). If not, say for some X V 1 \X we have N(X )\N(X) < X, then N(X X ) N(X) N(X ) N(X) + N(X )\N(X) < X + X = X X, which contradicts the condition (2.1) of the original graph. As before, we now have a matching from X to N(X) and a matching from V 1 \X to V 2 \N(X). Combining these matchings gives a matching from V 1 to V 2 as required. Proof. For the second proof, we instead use induction on the number of edges. The important ingredient is the following claim: if e and e are two adjacent (in V 1 ) edges then either G e or G e satisfies the Hall condition. The

11 11 theorem now follows easily by induction, as follows. Suppose that there exist no two edges which are adjacent in V 1. Then this means that every vertex in V 1 has degree 1. Moreover, the neighbourhoods of each v V 1 are disjoint, for if w v w v then N({v, v }) = {w}, which contradicts (2.1). If there do exist two edges which are adjacent in V 1 then, by our earlier claim, we can remove one of these and preserve (2.1), and so by induction there exists a matching on this smaller graph, and hence one for the original graph. It remains to prove our initial claim: that if e 1 = {x, y 1 } and e 2 = {x, y 2 } are two distinct edges of G, with x V 1 and y 1, y 2 V 2, either G 1 = G e 1 or G 2 = G e 2 satisfies the Hall condition. Suppose not. Then there exist W 1, W 2 V 1 \{x} such that N(W 1 ) (N(x)\{y 1 }) < W (2.3) and In particular, N(W 2 ) (N(x)\{y 2 }) < W N(W 1 ) (N(x)\{y 1 }) W 1 N(W 1 ), and hence N(x)\{y 1 } N(W 1 ), so that N(W 1 ) = W 1, and similarly for W 2, and so N(W 1 ) N(W 2 ) N(x), since y 1 y 2, and hence N(W 1 W 2 ) = N(W 1 W 2 {x}). Finally, this implies that W 1 + W 2 = N(W 1 ) + N(W 2 ) = N(W 1 W 2 {x}) + N(W 1 ) N(W 2 )) N(W 1 W 2 {x}) + N(W 1 W 2 ) W 1 W 2 {x} + W 1 W 2 W 1 + W 2 + 1, which contradicts the assumption that G satisfies (2.1), and the proof is complete. Exercises Nothing defined solely in an exercise will be examinable, and the exercises will not count towards your final mark. Nonetheless, I strongly recommend that you attempt all of the exercises for each lecture this will ensure that you properly understand the material. Exercise 2.1. Let G be a bipartite graph between V 1 and V 2 where V 2 V 1 such that there exist positive integers d 1, d 2 1 such that for all v V 1 we have d(v) = d 1 and for all w V 2 we have d(w) = d 2. Show that there is a matching from V 1 to V 2.

12 12 LECTURE 2. MATCHINGS Exercise 2.2. Let G be a bipartite graph between V 1 and V 2 which satisfies Hall s condition, and such that d(v) k for all v V 1. Show that G contains at least k! different matchings. (Hint: adapt the first proof of Hall s theorem). Exercise 2.3. An n n Latin square is an n n array such that the numbers 1,..., n appear exactly once in each row and column. Show that there exist at least n! such Latin squares.

13 Lecture 3 Extremal behaviour of paths and cycles Recall that an extremal problem is one where we fix a graph H and ask for simple conditions on general graphs G to contain H as a subgraph and, moreover, what can we say about the extreme cases? In the last lecture we saw a fairly simple condition for bipartite graphs that guaranteed containing a matching as a subgraph, for example. In this lecture, we will look at the extremal problem for paths and Hamiltonian cycles cycles which contain every vertex of G. That is, can we give a simple sufficient condition for G to contain a path of a specified length or a Hamiltonian cycle? And, moreover, can we show this condition to be sharp? The Hamiltonian cycle extremal problem you may have encountered before as a game someone draws a graph, and the challenge is to start at one vertex and go around the graph, visiting every vertex and ending up at the beginning, without visiting a vertex more than once. In fact, in 1857 William Hamilton marketed this problem for a dodecahedron as a game (google the Icosian game for more). We will first consider the problem for paths we d like to find a simple sufficient condition for G to contain a path of some specified length. Theorem 3.1. Let G be a connected graph of order G 3 such that for any two vertices x and y we have d(x)+d(y) k. Then G contains a path of length k. Proof. Let P = v 1 v l be a path of maximal length in G, and suppose that l < k + 1. By maximality every neighbour of v 1 and v l must already be in {v 1,..., v l }. Consider the sets Γ 1 = {v j : v 1 v j } and Γ 2 = {v j+1 : v j v l }. Then Γ 1 Γ 2 l 1 < k. Clearly, however, Γ 1 d(v 1 ) and Γ 2 d(v l ), and hence Γ 1 + Γ 2 d(v 1 ) + d(v l ) k > Γ 1 Γ 2 13

14 14 LECTURE 3. EXTREMAL BEHAVIOUR OF PATHS AND CYCLES by hypothesis. It follows that there is some v j Γ 1 Γ 2, so that v j v 1 and v j 1 v l. Since G is connected there exists some w P which is adjacent to some vertex v i P. We may then construct a longer path: either if i j 1, or wv i v i+1 v j 1 v l v l 1 v j v 1 v 2 v i 1 wv i v i+1 v l v j 1 v 1 v j v i 1 otherwise, and hence we have constructed a path using l + 1 vertices, which contradicts maximality and completes the proof. That this simple condition on degrees is enough to guarantee a long path is quite striking; nonetheless, we may hope to find a simpler condition using just the number of edges. It is not too difficult to deduce such a bound from this theorem. Theorem 3.2. If G satisfies then G contains a path of length k. e(g) > k 1 2 Proof. We use induction on n = G. The case n k is obvious, since we always have e(g) ( n 2) (k 1)n/2. Furthermore, if G is not connected then the result follows by induction: let G 1,..., G r be the connected components of G and suppose that G (and hence each G i ) contains no P k. We have e(g) = r e(g i ) i=1 r i=1 k 1 2 G G i = k 1 2 G. We therefore may assume that G is connected. If every vertex has degree d(x) > (k 1)/2 then we are done by Theorem 3.1; otherwise, let x G be a vertex of degree at most (k 1)/2 and suppose that e(g) > (k 1)n/2. Let G be the graph with x and all its incident edges removed; then clearly G = n 1 and e(g ) = e(g) d(x) > k 1 n k = k 1 (n 1), 2 and hence by induction G contains a path of length k and we are done. We now consider a similar problem for Hamiltonian cycles. In fact, a very similar argument works in this case also. Theorem 3.3. Let G be a connected graph of order G 3 such that for any two vertices x and y we have d(x)+d(y) G. Then G contains a Hamiltonian cycle, i.e. a cycle that includes every vertex exactly once.

15 15 Proof. Suppose G does not contain a Hamiltonian cycle, and let P = v 1 v l be a path of maximum length. We first claim that every cycle in G has length less than l. For otherwise, if x 1 x r is a cycle, then there exists some y G\{x 1,..., x r } which is adjacent to some x i for 1 i r, because G is connected and does not have a cycle which includes every vertex. We can then make a path using r+1 vertices as yx i x i 1 x 1 x r x i+1, and hence r+1 l as required. Arguing as in the proof of Theorem 3.1 we consider the sets Γ 1 = {v j : v 1 v j } and Γ 2 = {v j+1 : v j v l }. We now observe that these sets are disjoint; for otherwise, we have some v j such that v j v 1 and v j 1 v l, but then v 1 v j 1 v l v l 1 v j is a cycle of length l, which contradicts the claim in the first paragraph. Furthermore, every vertex of v 1 and v l is amongst {v 1,..., v l } by maximality of P. It follows that G d(v 1 ) + d(v l ) = Γ 1 + Γ 2 = Γ 1 Γ 2 l 1 G 1, which is a contradiction which completes the proof. The following easy corollary is a very simple criterion to remember for the presence of a Hamiltonian cycle. Corollary 3.1 (Dirac s theorem). If G 3 and d(x) G /2 for all x G then G contains a Hamiltonian cycle. Exercises Nothing defined solely in an exercise will be examinable, and the exercises will not count towards your final mark. Nonetheless, I strongly recommend that you attempt all of the exercises for each lecture this will ensure that you properly understand the material. Exercise 3.1. Show that Theorem 3.2 is best possible by constructing, for any even n and k 1, a graph of order n and size (k 1)n/2 with no paths of length k. Can you show that your construction is unique? Exercise 3.2. Show that every graph such that d(x) G /2 for all x G is connected. (Note: this result is implicit in the statement of Dirac s theorem!) Exercise 3.3. Solve William Hamilton s Icosian game, i.e. find a Hamiltonian cycle for the graph below. Find a graph for which finding a Hamiltonian cycle is more fun.

16 16 LECTURE 3. EXTREMAL BEHAVIOUR OF PATHS AND CYCLES

17 Lecture 4 Extremal behaviour of complete graphs We now consider the extremal question for complete graphs that is, given some fixed k 2 and n 1, what is the maximum number of edges that a graph on n vertices can have and yet contain no K k? The case k = 2 is trivial, so we will consider the case k 3. When trying to construct a graph with many edges and yet no K k, there is an obvious candidate namely, K k 1. A moment s thought shows that we can generalise this to handle more vertices by blowing up the graph. This means we replace each vertex by a set of independent vertices (i.e. a set of vertices with no edges between them), and replace each edge between two vertices by adding an edge between every vertex in the two corresponding vertex classes. For example, a complete bipartite graph is nothing more than a blow-up of K 2. To have as many edges as possible, it is sensible to choose these vertex classes to have roughly the same number of vertices. The blow-up of K r with n vertices and vertex classes that differ by at most 1 in size is the Turán graph, denoted by T r (n). (a) T 2(8) (b) T 3(11) Let us make things a little more precise. For any r 1 an r-partite graph 17

18 18 LECTURE 4. EXTREMAL BEHAVIOUR OF COMPLETE GRAPHS is one where we can partition V (G) into disjoint sets V 1,..., V r such that if x, y V i then x y. Lemma 4.1. There is a unique r-partite graph of order n with maximal size, which we denote by T r (n). Proof. Let G be an r-partite graph with vertex classes V 1,..., V r of maximal size. Clearly, it must be a complete r-partite graph. We order the vertex classes so that V 1 V r. It suffices to show that V 1 V r 1, for such a graph is unique up to isomorphism. Suppose that V r V If we move one vertex from V r to V 1 then we add ( V 1 + 1)( V r 1) many edges, and lose V 1 V r many edges, and hence have a total gain of V r V edges, which contradicts the maximality of G. An equivalent definition, which is more easily applied, is the following: T r (n) is the complete r-partite graph with n vertices, where the sizes of the r vertex classes differ by at most 1 from each other. Thus, if n = rq + k and k < r then (r k) of the classes have q vertices and the other k contain q + 1 vertices. Let t r (n) denote the number of edges of T r (n). For example, let s calculate t 2 (n). The Turán graph T 2 (n) is a complete bipartite graph with classes of size n/2 and n/2 if n is even, and (n 1)/2 and (n + 1)/2 if n is odd. Thus { n 2 /4 if n is even, and t 2 (n) = (n 2 1)/4 otherwise. Similarly, t 3 (n) = { n 2 /3 if n 0 (mod 3) (n 2 1)/3 otherwise. As discussed above, it is obvious that T r (n) is a graph which contains no K r+1. It is a striking theorem that T r (n) is also the largest graph which has this property that is, every graph with more edges must contain a K r+1. Theorem 4.1 (Turán s theorem). If G = n and e(g) > t r (n) then G contains a K r+1. Furthermore, if e(g) = t r (n) and G contains no K r+1 then it is isomorphic to T r (n). Proof. We use induction on n + r. Let G be a graph with e(g) t r (n) which contains no K r+1. Clearly, we can remove edges from G without destroying this property; thus there is a subgraph G with e(g ) = t r (n) such that G contains no K r+1. It suffices to show that G is isomorphic to T r (n) for if e(g) > e(g ) then it contains a T r (n) with an extra edge, which clearly contains a K r+1, which is a contradiction.

19 19 Since t r (n) > t r 1 (n), by induction G contains a K r, say with vertex set W. Let H = G W, and observe that e(h, W ) (n r)(r 1), since each vertex of H is connected to at most r 1 of the vertices of W, or else we d have a K r+1. It follows that e(h) = e(g) ( ) r 2 e(h, W ) t r (n) ( ) r (n r)(r 1) = t r (n r). 2 since if we remove a K r from T r (n) then we are left with a T r (n r) and have removed exactly ( r 2) + (n r)(r 1) edges. By induction H is isomorphic to T r (n r), and e(h, W ) = (n r)(r 1) so that every vertex of H is joined to precisely r 1 vertices of W, and thus G is T r (n). Exercises Nothing defined solely in an exercise will be examinable, and the exercises will not count towards your final mark. Nonetheless, I strongly recommend that you attempt all of the exercises for each lecture this will ensure that you properly understand the material. Exercise 4.1. Calculate the Turán number t r (n) explicitly when r n. Show also that, for any n, r 1, ( t r (n) 1 1 ) ( ) n. r 2 Exercise 4.2. Show that if G = n and for all v G then G contains a K r. d(v) > r 2 r 1 n Exercise 4.3. Let G = n and suppose that e(g) > t r (n) + 1. Show that G contains at least two copies of K r which do not share any edges.

20

21 Lecture 5 Ramsey theory Ramsey theory, in its most broad sense, is concerned with finding structure in large disordered sets that is, if we have enough of something, we are guaranteed to find some kind of structure. We will look at just the tip of the Ramsey iceberg in this lecture, and will be concerned with the following question: if fix some complete graph K n, and colour the edges red and blue, what kind monochromatic subgraphs will be forced? It is not obvious that any non-trivial monochromatic subgraphs must be created the first theorem of Ramsey theory is that, in fact, if n is large enough, we will be forced to contain all kinds of monochromatic subgraphs. Let s be precise. For any graphs G and H the Ramsey number R(G, H) is the smallest n such that every colouring of the edges of K n red and blue will create either an all red copy of G or an all blue copy of H. We may actually create both, but the point is at least one must be created. Complete graphs play a special role here we let R(s, t) = R(K s, K t ), i.e. the smallest n such that every red-blue colouring of the edges of K n contains either a red K s or a blue K t. Obviously R(s, t) = R(t, s) and R(2, s) = s. We also just write R(s) = R(s, s). So far, it s not obvious that R(s, t) is even well-defined perhaps there exist no such n! The following theorem guarantees the existence of such an n and gives an upper bound for it. Theorem 5.1. If s > 2 and t > 2 then R(s, t) R(s 1, t) + R(s, t 1). Proof. Let n = R(s 1, t) + R(s, t 1). Unpacking the definitions, what we need to show is that if we colour the edges of K n red and blue there will either be a red K s or a blue K t. Let v K n be any vertex. The degree of v is n 1, and hence v either has at least R(s 1, t) red neighbours or R(s, t 1) blue neighbours. Suppose the first case holds, and let G be the graph (with the inherited colouring) on those vertices which are joined to v by red edges. Since G has at least R(s 1, t) vertices it either contains a red K s 1 or a blue K t. If it has 21

22 22 LECTURE 5. RAMSEY THEORY a blue K t then we are done. Otherwise, by adding v to the red K s 1 we have found a red K s, and we are also done. Corollary 5.1. R(3) = 6. Proof. Theorem 5.1 and the trivial equality R(2, 3) = R(3, 2) = 3 imply that R(3) 6. To finish the proof we need to show that R(3) > 5, i.e. there is a colouring of the edges of K 5 with no creating a monochromatic triangle. Here it is: Figure 5.1: A colouring of K 5 with no monochromatic triangles The next non-trivial case is R(3, 4) Theorem 5.1 implies that R(3, 4) 10 but even now this falls short! In fact, R(3, 4) = 9. This then implies that R(4) 18 now this is actually sharp. It is known that R(4) = but then we don t know! It is known that 43 R(5) 49. Finding the exact value is a very difficult problem. Erdős asks us to imagine an alien force, vastly more powerful than us, landing on Earth and demanding the value of R(5) or they will destroy our planet. In that case, he claims, we should marshal all our computers and all our mathematicians and attempt to find the value. But suppose, instead, that they ask for R(6). In that case, he believes, we should attempt to destroy the aliens. Joel Spencer Finally, we recall the Ramsey number for general graphs R(G, H). We observe that its existence is guaranteed by the existence of R(s, t) for if G = s and K n contains a red K s then it will certainly contain a red G. Lemma 5.1. If G = s and H = t then R(G, H) R(s, t). This is often far short of the truth, however. For example, let s consider the Ramsey number for a 4-cycle that is, R(C 4, C 4 ). It s easy to show that R(C 4 ) > 5 (look at the colouring above!). Since C 4 = 4 the bound above implies that R(C 4 ) R(4) = 18, but this is terrible in fact, R(C 4 ) = 6.

23 23 Exercises Nothing defined solely in an exercise will be examinable, and the exercises will not count towards your final mark. Nonetheless, I strongly recommend that you attempt all of the exercises for each lecture this will ensure that you properly understand the material. Exercise 5.1. Show that R(3, 4) = 9. Exercise 5.2. Show that R(C 4 ) = 6. Exercise 5.3. Let K 1,l be the complete bipartite graph between 1 vertex and l independent vertices. Using Turán s theorem, show that, for any r, l 1, R(K r, K 1,l ) = (r 1)l + 1.

Monochromatic and Rainbow Colorings

Monochromatic and Rainbow Colorings Chapter 11 Monochromatic and Rainbow Colorings There are instances in which we will be interested in edge colorings of graphs that do not require adjacent edges to be assigned distinct colors Of course,

More information

R(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k.

R(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k. MATH3301 EXTREMAL GRAPH THEORY Definition: A near regular complete multipartite graph is a complete multipartite graph with orders of its partite sets differing by at most 1. R(p, k) = the near regular

More information

arxiv: v2 [math.co] 25 Jul 2016

arxiv: v2 [math.co] 25 Jul 2016 Partitioning a graph into a cycle and a sparse graph Alexey Pokrovskiy arxiv:1607.03348v [math.co] 5 Jul 016 ETH Zürich, Zürich, Switzerland Keywords: Partitioning graphs, Ramsey theory, cycles. July 6,

More information

Rao s degree sequence conjecture

Rao s degree sequence conjecture Rao s degree sequence conjecture Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 July 31, 2009; revised December 10, 2013 1 Supported

More information

arxiv: v1 [math.co] 13 May 2016

arxiv: v1 [math.co] 13 May 2016 GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in

More information

List of Theorems. Mat 416, Introduction to Graph Theory. Theorem 1 The numbers R(p, q) exist and for p, q 2,

List of Theorems. Mat 416, Introduction to Graph Theory. Theorem 1 The numbers R(p, q) exist and for p, q 2, List of Theorems Mat 416, Introduction to Graph Theory 1. Ramsey s Theorem for graphs 8.3.11. Theorem 1 The numbers R(p, q) exist and for p, q 2, R(p, q) R(p 1, q) + R(p, q 1). If both summands on the

More information

Maximising the number of induced cycles in a graph

Maximising the number of induced cycles in a graph Maximising the number of induced cycles in a graph Natasha Morrison Alex Scott April 12, 2017 Abstract We determine the maximum number of induced cycles that can be contained in a graph on n n 0 vertices,

More information

Partial cubes: structures, characterizations, and constructions

Partial cubes: structures, characterizations, and constructions Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes

More information

The edge-density for K 2,t minors

The edge-density for K 2,t minors The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;

More information

Graph G = (V, E). V ={vertices}, E={edges}. V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

Graph G = (V, E). V ={vertices}, E={edges}. V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} Graph Theory Graph G = (V, E). V ={vertices}, E={edges}. a b c h k d g f e V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} E =16. Digraph D = (V, A). V ={vertices}, E={edges}.

More information

k-blocks: a connectivity invariant for graphs

k-blocks: a connectivity invariant for graphs 1 k-blocks: a connectivity invariant for graphs J. Carmesin R. Diestel M. Hamann F. Hundertmark June 17, 2014 Abstract A k-block in a graph G is a maximal set of at least k vertices no two of which can

More information

Out-colourings of Digraphs

Out-colourings of Digraphs Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.

More information

RECAP: Extremal problems Examples

RECAP: Extremal problems Examples RECAP: Extremal problems Examples Proposition 1. If G is an n-vertex graph with at most n edges then G is disconnected. A Question you always have to ask: Can we improve on this proposition? Answer. NO!

More information

An Ore-type Condition for Cyclability

An Ore-type Condition for Cyclability Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG

More information

CONSTRUCTION OF THE REAL NUMBERS.

CONSTRUCTION OF THE REAL NUMBERS. CONSTRUCTION OF THE REAL NUMBERS. IAN KIMING 1. Motivation. It will not come as a big surprise to anyone when I say that we need the real numbers in mathematics. More to the point, we need to be able to

More information

Graph Theorizing Peg Solitaire. D. Paul Hoilman East Tennessee State University

Graph Theorizing Peg Solitaire. D. Paul Hoilman East Tennessee State University Graph Theorizing Peg Solitaire D. Paul Hoilman East Tennessee State University December 7, 00 Contents INTRODUCTION SIMPLE SOLVING CONCEPTS 5 IMPROVED SOLVING 7 4 RELATED GAMES 5 5 PROGENATION OF SOLVABLE

More information

Packing and Covering Dense Graphs

Packing and Covering Dense Graphs Packing and Covering Dense Graphs Noga Alon Yair Caro Raphael Yuster Abstract Let d be a positive integer. A graph G is called d-divisible if d divides the degree of each vertex of G. G is called nowhere

More information

Cosets and Lagrange s theorem

Cosets and Lagrange s theorem Cosets and Lagrange s theorem These are notes on cosets and Lagrange s theorem some of which may already have been lecturer. There are some questions for you included in the text. You should write the

More information

The regularity method and blow-up lemmas for sparse graphs

The regularity method and blow-up lemmas for sparse graphs The regularity method and blow-up lemmas for sparse graphs Y. Kohayakawa (São Paulo) SPSAS Algorithms, Combinatorics and Optimization University of São Paulo July 2016 Partially supported CAPES/DAAD (430/15),

More information

Metric spaces and metrizability

Metric spaces and metrizability 1 Motivation Metric spaces and metrizability By this point in the course, this section should not need much in the way of motivation. From the very beginning, we have talked about R n usual and how relatively

More information

4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**

4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu** 4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published

More information

Decomposing oriented graphs into transitive tournaments

Decomposing oriented graphs into transitive tournaments Decomposing oriented graphs into transitive tournaments Raphael Yuster Department of Mathematics University of Haifa Haifa 39105, Israel Abstract For an oriented graph G with n vertices, let f(g) denote

More information

Disjoint Hamiltonian Cycles in Bipartite Graphs

Disjoint Hamiltonian Cycles in Bipartite Graphs Disjoint Hamiltonian Cycles in Bipartite Graphs Michael Ferrara 1, Ronald Gould 1, Gerard Tansey 1 Thor Whalen Abstract Let G = (X, Y ) be a bipartite graph and define σ (G) = min{d(x) + d(y) : xy / E(G),

More information

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together

More information

Basic counting techniques. Periklis A. Papakonstantinou Rutgers Business School

Basic counting techniques. Periklis A. Papakonstantinou Rutgers Business School Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED

More information

Combined degree and connectivity conditions for H-linked graphs

Combined degree and connectivity conditions for H-linked graphs Combined degree and connectivity conditions for H-linked graphs FLORIAN PFENDER Universität Rostock Institut für Mathematik D-18055 Rostock, Germany Florian.Pfender@uni-rostock.de Abstract For a given

More information

On Some Three-Color Ramsey Numbers for Paths

On Some Three-Color Ramsey Numbers for Paths On Some Three-Color Ramsey Numbers for Paths Janusz Dybizbański, Tomasz Dzido Institute of Informatics, University of Gdańsk Wita Stwosza 57, 80-952 Gdańsk, Poland {jdybiz,tdz}@inf.ug.edu.pl and Stanis

More information

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs

Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs Pinar Heggernes Pim van t Hof Daniel Meister Yngve Villanger Abstract Given two graphs G and H as input, the Induced Subgraph

More information

Observation 4.1 G has a proper separation of order 0 if and only if G is disconnected.

Observation 4.1 G has a proper separation of order 0 if and only if G is disconnected. 4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)

More information

MA554 Assessment 1 Cosets and Lagrange s theorem

MA554 Assessment 1 Cosets and Lagrange s theorem MA554 Assessment 1 Cosets and Lagrange s theorem These are notes on cosets and Lagrange s theorem; they go over some material from the lectures again, and they have some new material it is all examinable,

More information

1.1 P, NP, and NP-complete

1.1 P, NP, and NP-complete CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Introduction to NP-complete Problems Date: 11/01/2008 Lecturer: Lap Chi Lau Scribe: Jerry Jilin Le This lecture gives a general introduction

More information

Counting independent sets of a fixed size in graphs with a given minimum degree

Counting independent sets of a fixed size in graphs with a given minimum degree Counting independent sets of a fixed size in graphs with a given minimum degree John Engbers David Galvin April 4, 01 Abstract Galvin showed that for all fixed δ and sufficiently large n, the n-vertex

More information

Even Cycles in Hypergraphs.

Even Cycles in Hypergraphs. Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

Ring Sums, Bridges and Fundamental Sets

Ring Sums, Bridges and Fundamental Sets 1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G

More information

Automorphism groups of wreath product digraphs

Automorphism groups of wreath product digraphs Automorphism groups of wreath product digraphs Edward Dobson Department of Mathematics and Statistics Mississippi State University PO Drawer MA Mississippi State, MS 39762 USA dobson@math.msstate.edu Joy

More information

K 4 -free graphs with no odd holes

K 4 -free graphs with no odd holes K 4 -free graphs with no odd holes Maria Chudnovsky 1 Columbia University, New York NY 10027 Neil Robertson 2 Ohio State University, Columbus, Ohio 43210 Paul Seymour 3 Princeton University, Princeton

More information

A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees

A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of

More information

Generalized Pigeonhole Properties of Graphs and Oriented Graphs

Generalized Pigeonhole Properties of Graphs and Oriented Graphs Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER

More information

Tree sets. Reinhard Diestel

Tree sets. Reinhard Diestel 1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked

More information

This section is an introduction to the basic themes of the course.

This section is an introduction to the basic themes of the course. Chapter 1 Matrices and Graphs 1.1 The Adjacency Matrix This section is an introduction to the basic themes of the course. Definition 1.1.1. A simple undirected graph G = (V, E) consists of a non-empty

More information

The Turán number of sparse spanning graphs

The Turán number of sparse spanning graphs The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic

More information

DR.RUPNATHJI( DR.RUPAK NATH )

DR.RUPNATHJI( DR.RUPAK NATH ) Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology

More information

Discrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability

Discrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics 309 (009) 3811 380 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Disjoint hamiltonian cycles in bipartite graphs Michael

More information

Even Pairs and Prism Corners in Square-Free Berge Graphs

Even Pairs and Prism Corners in Square-Free Berge Graphs Even Pairs and Prism Corners in Square-Free Berge Graphs Maria Chudnovsky Princeton University, Princeton, NJ 08544 Frédéric Maffray CNRS, Laboratoire G-SCOP, University of Grenoble-Alpes, France Paul

More information

Graph Theory Notes. January 15, H. A. Kierstead

Graph Theory Notes. January 15, H. A. Kierstead Graph Theory Notes January 15, 2019 H. A. Kierstead CHAPTER 1 Introduction This is an on going project. There will be changes to the material not yet covered, especially just before each lecture. There

More information

Midterm 1. Your Exam Room: Name of Person Sitting on Your Left: Name of Person Sitting on Your Right: Name of Person Sitting in Front of You:

Midterm 1. Your Exam Room: Name of Person Sitting on Your Left: Name of Person Sitting on Your Right: Name of Person Sitting in Front of You: CS70 Discrete Mathematics and Probability Theory, Fall 2018 Midterm 1 8:00-10:00pm, 24 September Your First Name: SIGN Your Name: Your Last Name: Your Exam Room: Name of Person Sitting on Your Left: Name

More information

Economics 204 Fall 2011 Problem Set 1 Suggested Solutions

Economics 204 Fall 2011 Problem Set 1 Suggested Solutions Economics 204 Fall 2011 Problem Set 1 Suggested Solutions 1. Suppose k is a positive integer. Use induction to prove the following two statements. (a) For all n N 0, the inequality (k 2 + n)! k 2n holds.

More information

Advanced Topics in Discrete Math: Graph Theory Fall 2010

Advanced Topics in Discrete Math: Graph Theory Fall 2010 21-801 Advanced Topics in Discrete Math: Graph Theory Fall 2010 Prof. Andrzej Dudek notes by Brendan Sullivan October 18, 2010 Contents 0 Introduction 1 1 Matchings 1 1.1 Matchings in Bipartite Graphs...................................

More information

arxiv: v2 [math.co] 7 Jan 2016

arxiv: v2 [math.co] 7 Jan 2016 Global Cycle Properties in Locally Isometric Graphs arxiv:1506.03310v2 [math.co] 7 Jan 2016 Adam Borchert, Skylar Nicol, Ortrud R. Oellermann Department of Mathematics and Statistics University of Winnipeg,

More information

Discrete Mathematics. The edge spectrum of the saturation number for small paths

Discrete Mathematics. The edge spectrum of the saturation number for small paths Discrete Mathematics 31 (01) 68 689 Contents lists available at SciVerse ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The edge spectrum of the saturation number for

More information

Notes on Graph Theory

Notes on Graph Theory Notes on Graph Theory Maris Ozols June 8, 2010 Contents 0.1 Berge s Lemma............................................ 2 0.2 König s Theorem........................................... 3 0.3 Hall s Theorem............................................

More information

Maximal Independent Sets In Graphs With At Most r Cycles

Maximal Independent Sets In Graphs With At Most r Cycles Maximal Independent Sets In Graphs With At Most r Cycles Goh Chee Ying Department of Mathematics National University of Singapore Singapore goh chee ying@moe.edu.sg Koh Khee Meng Department of Mathematics

More information

Perfect matchings in highly cyclically connected regular graphs

Perfect matchings in highly cyclically connected regular graphs Perfect matchings in highly cyclically connected regular graphs arxiv:1709.08891v1 [math.co] 6 Sep 017 Robert Lukot ka Comenius University, Bratislava lukotka@dcs.fmph.uniba.sk Edita Rollová University

More information

Graph coloring, perfect graphs

Graph coloring, perfect graphs Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive

More information

arxiv: v1 [cs.dm] 12 Jun 2016

arxiv: v1 [cs.dm] 12 Jun 2016 A Simple Extension of Dirac s Theorem on Hamiltonicity Yasemin Büyükçolak a,, Didem Gözüpek b, Sibel Özkana, Mordechai Shalom c,d,1 a Department of Mathematics, Gebze Technical University, Kocaeli, Turkey

More information

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

More information

MATH 13 SAMPLE FINAL EXAM SOLUTIONS

MATH 13 SAMPLE FINAL EXAM SOLUTIONS MATH 13 SAMPLE FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers.

More information

arxiv: v1 [cs.ds] 2 Oct 2018

arxiv: v1 [cs.ds] 2 Oct 2018 Contracting to a Longest Path in H-Free Graphs Walter Kern 1 and Daniël Paulusma 2 1 Department of Applied Mathematics, University of Twente, The Netherlands w.kern@twente.nl 2 Department of Computer Science,

More information

Rainbow Hamilton cycles in uniform hypergraphs

Rainbow Hamilton cycles in uniform hypergraphs Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie

More information

Compatible Hamilton cycles in Dirac graphs

Compatible Hamilton cycles in Dirac graphs Compatible Hamilton cycles in Dirac graphs Michael Krivelevich Choongbum Lee Benny Sudakov Abstract A graph is Hamiltonian if it contains a cycle passing through every vertex exactly once. A celebrated

More information

ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS

ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,

More information

HOMEWORK #2 - MATH 3260

HOMEWORK #2 - MATH 3260 HOMEWORK # - MATH 36 ASSIGNED: JANUARAY 3, 3 DUE: FEBRUARY 1, AT :3PM 1) a) Give by listing the sequence of vertices 4 Hamiltonian cycles in K 9 no two of which have an edge in common. Solution: Here is

More information

A short course on matching theory, ECNU Shanghai, July 2011.

A short course on matching theory, ECNU Shanghai, July 2011. A short course on matching theory, ECNU Shanghai, July 2011. Sergey Norin LECTURE 3 Tight cuts, bricks and braces. 3.1. Outline of Lecture Ear decomposition of bipartite graphs. Tight cut decomposition.

More information

Maximal and Maximum Independent Sets In Graphs With At Most r Cycles

Maximal and Maximum Independent Sets In Graphs With At Most r Cycles Maximal and Maximum Independent Sets In Graphs With At Most r Cycles Bruce E. Sagan Department of Mathematics Michigan State University East Lansing, MI sagan@math.msu.edu Vincent R. Vatter Department

More information

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010) http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product

More information

MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM

MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through

More information

Cographs; chordal graphs and tree decompositions

Cographs; chordal graphs and tree decompositions Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs

More information

Tutorial on Mathematical Induction

Tutorial on Mathematical Induction Tutorial on Mathematical Induction Roy Overbeek VU University Amsterdam Department of Computer Science r.overbeek@student.vu.nl April 22, 2014 1 Dominoes: from case-by-case to induction Suppose that you

More information

Countability. 1 Motivation. 2 Counting

Countability. 1 Motivation. 2 Counting Countability 1 Motivation In topology as well as other areas of mathematics, we deal with a lot of infinite sets. However, as we will gradually discover, some infinite sets are bigger than others. Countably

More information

Bichain graphs: geometric model and universal graphs

Bichain graphs: geometric model and universal graphs Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United

More information

Math 301: Matchings in Graphs

Math 301: Matchings in Graphs Math 301: Matchings in Graphs Mary Radcliffe 1 Definitions and Basics We begin by first recalling some basic definitions about matchings. A matching in a graph G is a set M = {e 1, e 2,..., e k } of edges

More information

Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs

Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N

More information

Graphs with Large Variance

Graphs with Large Variance Graphs with Large Variance Yair Caro Raphael Yuster Abstract For a graph G, let V ar(g) denote the variance of the degree sequence of G, let sq(g) denote the sum of the squares of the degrees of G, and

More information

1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).

1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D). 1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting

More information

Minimal Paths and Cycles in Set Systems

Minimal Paths and Cycles in Set Systems Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive

More information

Observation 4.1 G has a proper separation of order 0 if and only if G is disconnected.

Observation 4.1 G has a proper separation of order 0 if and only if G is disconnected. 4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H

More information

Topological properties

Topological properties CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological

More information

3 The language of proof

3 The language of proof 3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;

More information

Graph Classes and Ramsey Numbers

Graph Classes and Ramsey Numbers Graph Classes and Ramsey Numbers Rémy Belmonte, Pinar Heggernes, Pim van t Hof, Arash Rafiey, and Reza Saei Department of Informatics, University of Bergen, Norway Abstract. For a graph class G and any

More information

PGSS Discrete Math Solutions to Problem Set #4. Note: signifies the end of a problem, and signifies the end of a proof.

PGSS Discrete Math Solutions to Problem Set #4. Note: signifies the end of a problem, and signifies the end of a proof. PGSS Discrete Math Solutions to Problem Set #4 Note: signifies the end of a problem, and signifies the end of a proof. 1. Prove that for any k N, there are k consecutive composite numbers. (Hint: (k +

More information

Graph Theory Notes. August 8, H. A. Kierstead

Graph Theory Notes. August 8, H. A. Kierstead Graph Theory Notes August 8, 2018 H. A. Kierstead CHAPTER 1 Introduction This is an on going project. There will be changes to the material not yet covered, especially just before each lecture. There

More information

Rainbow Hamilton cycles in uniform hypergraphs

Rainbow Hamilton cycles in uniform hypergraphs Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie

More information

MATH 22 HAMILTONIAN GRAPHS. Lecture V: 11/18/2003

MATH 22 HAMILTONIAN GRAPHS. Lecture V: 11/18/2003 MATH 22 Lecture V: 11/18/2003 HAMILTONIAN GRAPHS All communities [graphs] divide themselves into the few and the many [i.e., are bipartite]. Alexander Hamilton, Debates of the Federal Convention Before

More information

The regularity method and blow-up lemmas for sparse graphs

The regularity method and blow-up lemmas for sparse graphs The regularity method and blow-up lemmas for sparse graphs Y. Kohayakawa (São Paulo) SPSAS Algorithms, Combinatorics and Optimization University of São Paulo July 2016 Partially supported CAPES/DAAD (430/15),

More information

THE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1

THE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1 THE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1 Robin Thomas and Youngho Yoo School of Mathematics Georgia Institute of Technology Atlanta, Georgia 0-0160, USA We prove two results:

More information

Degree Sequence and Supereulerian Graphs

Degree Sequence and Supereulerian Graphs Degree Sequence and Supereulerian Graphs Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang and Ju Zhou January 29, 2007 Abstract A sequence d = (d 1, d 2,, d n ) is graphic if there is a simple graph

More information

Triangle-free graphs with no six-vertex induced path

Triangle-free graphs with no six-vertex induced path Triangle-free graphs with no six-vertex induced path Maria Chudnovsky 1, Paul Seymour 2, Sophie Spirkl Princeton University, Princeton, NJ 08544 Mingxian Zhong Columbia University, New York, NY 10027 June

More information

and critical partial Latin squares.

and critical partial Latin squares. Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares Rong Luo Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, U.S.A luor@math.wvu.edu

More information

Random Lifts of Graphs

Random Lifts of Graphs 27th Brazilian Math Colloquium, July 09 Plan of this talk A brief introduction to the probabilistic method. A quick review of expander graphs and their spectrum. Lifts, random lifts and their properties.

More information

Theorem (Special Case of Ramsey s Theorem) R(k, l) is finite. Furthermore, it satisfies,

Theorem (Special Case of Ramsey s Theorem) R(k, l) is finite. Furthermore, it satisfies, Math 16A Notes, Wee 6 Scribe: Jesse Benavides Disclaimer: These notes are not nearly as polished (and quite possibly not nearly as correct) as a published paper. Please use them at your own ris. 1. Ramsey

More information

Nordhaus-Gaddum Theorems for k-decompositions

Nordhaus-Gaddum Theorems for k-decompositions Nordhaus-Gaddum Theorems for k-decompositions Western Michigan University October 12, 2011 A Motivating Problem Consider the following problem. An international round-robin sports tournament is held between

More information

Parity Versions of 2-Connectedness

Parity Versions of 2-Connectedness Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida

More information

Cycle lengths in sparse graphs

Cycle lengths in sparse graphs Cycle lengths in sparse graphs Benny Sudakov Jacques Verstraëte Abstract Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value

More information

(Refer Slide Time: 0:21)

(Refer Slide Time: 0:21) Theory of Computation Prof. Somenath Biswas Department of Computer Science and Engineering Indian Institute of Technology Kanpur Lecture 7 A generalisation of pumping lemma, Non-deterministic finite automata

More information

MINIMALLY NON-PFAFFIAN GRAPHS

MINIMALLY NON-PFAFFIAN GRAPHS MINIMALLY NON-PFAFFIAN GRAPHS SERGUEI NORINE AND ROBIN THOMAS Abstract. We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-pfaffian graphs minimal with respect

More information

Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.

Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u. 5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field

More information

Chapter 7 Matchings and r-factors

Chapter 7 Matchings and r-factors Chapter 7 Matchings and r-factors Section 7.0 Introduction Suppose you have your own company and you have several job openings to fill. Further, suppose you have several candidates to fill these jobs and

More information