MATH 350 GRAPH THEORY & COMBINATORICS. Contents

Size: px
Start display at page:

Download "MATH 350 GRAPH THEORY & COMBINATORICS. Contents"

Transcription

1 MATH 350 GRAPH THEORY & COMBINATORICS PROF. SERGEY NORIN, FALL 2013 Contents 1. Basic definitions 1 2. Connectivity 2 3. Trees 3 4. Spanning Trees 3 5. Shortest paths 4 6. Eulerian & Hamiltonian cycles 5 7. Bipartite Graphs 5 8. Matchings in Bipartite Graphs 6 9. Menger s Theorem and Separations Digraphs and Network flows Ramsey s Theorem Matchings and Tutte s Theorem Vertex coloring Edge coloring Series-Parallel Graphs Planar graphs Kuratowski s Theorem Coloring planar graphs Perfect graphs Basic definitions Definition. A graph G consists of a set of vertices V (G), a set of edges E(G) and an incidence relation on E(G), namely every edge is incident to 1 or 2 vertices, called its ends. Definition. A loop is an edge with one end. Definition. Two edges are parallel if they have the same ends. Definition. A simple graph has o loops or parallel edges. Definition. A null graph is the unique graph with no vertices or edges. 1

2 2 PROF. SERGEY NORIN, FALL 2013 Definition. A complete graph on n vertices is a simple graph on n vertices in which every pair of vertices is adjacent. It is denoted K n. Definition. A path with n edges P n is a graph whose vertices and edges can be enumerated {v 1, v 2,..., v n+1 and {e 1, e 2,..., e n }, respectively, so that e i has ends v i and v i+1, for all 1 i n. Definition. A cycle of length n C n is a graph whose vertices and edges can be enumerated {v 1, v 2,... v n } and {e 1, e 2,..., e n } such that e i has ends v i and v i+1 for 1 i n 1 and e n has ends v n and v 1. Definition. The degree of a vertex v V (G) is the number of edges incident to it (with loops counted twice). Definition. The incidence matrix of a graph G is a matrix with rows indexed by the vertices of G and columns by edges of G. Lemma 1.1 (Handshaking Lemma). In any graph G, v V (G) deg(v) = 2 E(G). Corollary 1.2. In any graph G, the number of vertices of odd edgree is even. Definition. We say that a graph H is a subgraph of a graph G if V (H) V (G), E(H) E(G) and every edge of H has the same ends in H as it does in G. We write H G is H is a subgraph of G. Definition. We say that two graphs G and H are isomorphic if there exists a bijection between V (G) and V (H) and a bijection between E(G) and E(H) which preserve incidence. If G = H, then G and H in fact look the same up to relabelling. 2. Connectivity Definition. A walk in a graph G is a sequence v 0, e 1, v 1, e 2,..., v n 1, e n, v n such that v i V (G), e i E(G), 1 i n. The edge e i has ends v i 1 and v i for 1 i n. These edges are not necesarrily distinct, so we allow them to repeat. Definition. A graph G is said to be connected if for any pair u, v V (G), there exists a walk in G from u to v. Definition. A partition of a set Z is a pair {X, Y }, X, Y Z, X Y = Z, X Y =. Lemma 2.1. If G is not connected, then there exists a partition {X, Y } of V (G) such that X, Y and no edge of G has one end in X and another in Y. Lemma 2.2. Let G be a connected graph. Then, for every X V (G), X, X V (G), some edge of G has one end in X and another V (G) X. Lemma 2.3. If there exists a walk from u to v in G, then there is a path. Lemma 2.4. Let H 1, H 2 be connected subgraphs of a graph G. Then, if H 1 H 2 is not a null graph, then H 1 H 2 is connected.

3 MATH 350 GRAPH THEORY & COMBINATORICS 3 Definition. A connected component of a graph G is a maximal non-null connected subgraph of G. Corollary 2.5. Every vertex v in G is contained in a unique connected component. If u, v are in the same connected component and v, w are in the same connected component, then so are u, w. Definition. We say that H is obtained from G by deleting one edge e E(G) if V (H) = V (G), E(H) = E(G) {e} and H is a subgraph of G. We denote it by H = G\e. Such definition can be applied to vertices in a similar fashion. Definition. An edge e of G is a cut-edge if it does not belong to any cycle in G. Theorem 2.6. Let G be a graph, e E(G) an edge with ends u, v and H = G\e. Denote by comp(g) the number of connected component of G. Theb, (i) either e is not a cut-edge, u, v belongs to the same connected component of H and comp(h) = comp(g); (ii) e is a cut-edge of G, u, v belong to distinct component of H and comp(h) = comp(g) Trees Definition. A forest is a graph with no cycles (forests are simple). Definition. A tree is a non-null connected forest. Lemma 3.1. Let G be a forest. Then, comp(g) = V (G) E(G). Corollary 3.2. If G is a tree, then E(G) = V (G) 1. Definition. A leaf in a graph G is a vertex of degree 1. Theorem 3.3. Let T be a tree with V (T ) 2. Let X be the set of all leaves of T and Y be the set of all verties of T with degree greater than or equal to 3. Then, X Y + 2. Lemma 3.4. Let T be a tree, V (T ) 2. Then, T has at least 2 leaves and if T has exactly 2 leaves u and v, then T is a path from u to v. Lemma 3.5. Let T be a tree and let v V (T ) be a leaf. Then, T \v is a tree. Lemma 3.6. Let T be a tree and u, v V (T ). Then, there exists a unique path in T from u to v. 4. Spanning Trees Definition. We say that T is a spanning tree in a graph G if T G, T is a tree and V (T ) = V (G). Lemma 4.1. Let G be a non-null connected graph. Let H be a subgraph of G chosen so that V (H) = V (G), H is connected and H is minimal with these properties. Then G is a spanning tree of G.

4 4 PROF. SERGEY NORIN, FALL 2013 Remark. The complete graph K n has n n 2 spanning trees. Lemma 4.2. Let G be a connected, non-null graph. Let H G be chosen so that H is acyclic and maximal subject to this. Then H is a spanning tree of G. Definition. Let G be a graph, T be a spanning tree of G and let f E(G) E(T ). Let C be a cycle in G such that f E(C) and E(C) {f} E(T ). Then, C is called the fundamental cycle of f with respect to T. Lemma 4.3. Let T be a spanning tree of a graph G and let f E(G) E(T ). Then, G contains a unique fundamental cycle of f with respect to T. Lemma 4.4. Let T be a spanning tree of G, f E(G) E(T ) and C be the fundamental cycle of f with respect to T. Further let e E(C) {f}. Then, the graph T obtained from the graph T \e by adding f is a spanning tree of G. Definition. Let G be a graph and let w : E(G) R (we may assume that w : E(G) R + ). Let T be a spanning tree of G such that e E(T ) w(e) is minimum among all spanning trees of F. Then, we call T a min-cost tree for G and w. Lemma 4.5. Let G be a graph, w : E(G) R, T a min-cost tree and let f, C, e be as in Lemma 4.4. Then, w(e) w(f). Theorem 4.6. Let G be a graph, w : E(G) R, T a min-cost tree with respect to w and G. Let e 1, e 2,..., e n 1 be all the edges of T, where n = V (G), and suppose that w(e 1 ) w(e 2 ) w(e n 1 ). Then, for every 1 i n 1, e i is an edge of G with minimal weight subject to the fact that {e 1, e 2,..., e i 1, e i } does not contain cycle (an edge set of a cycle in G) and e i / {e 1, e 2,..., e i 1 }. 5. Shortest paths Definition. Let G be a connected graph. Let s, t V (G) and w : E(G) R + be the length function. We say P is a shortest path from s to t if w(p ) = e E(P ) w(e) is minimum among all paths from s to t in G. Definition. Let dist G (u, v) denote the length of the shortest path from u to v. We say that a tree T G is a shortest path tree for s V (G) if s V (T ) and dist G (s, u) = dist T (s, u), for every u V (T ). In particular, T need not be spanning. Theorem 5.1. Let G, w and s be as above. Let T be the shortest path tree for s. Assume that V (T ) V (G). Then, among all the edges of G with one end in V (T ) and another in V (G) V (T ), select an edge f with ends x V (T ) and y V (G) V (T ) such that dist T (s, x) + w(f) is minimum. Let T be the tree obtained from T by adding edge f and vertex y. Then, T is a shortest path tree for s.

5 MATH 350 GRAPH THEORY & COMBINATORICS 5 6. Eulerian & Hamiltonian cycles Definition. An Eulerian cycle in a graph G is a closed walk which uses every edge in G exacly once. Theorem 6.1 (Euler). A graph G with minimum degree 1 has an Eulerian cycle if and only if the degree of all vertices is even and it is connected. Lemma 6.2. Let G be a graph with at least one edge and no vertex of degree 1. Then G contains a cycle. Lemma 6.3. Let G be a graph such that the degree of every vertex is even. Then, there exists a collection of cycles C 1, C 2,..., C K in G such that every edge of F belong to exactly one cycle in the collection. Definition. We say that a cycle C G is Hamiltonian if V (C) = V (G). Note. There is no nice, necessary and sufficient condition for a graph to have a Hamiltonian cycle. Lemma 6.4. Let G be a graph, X V (G) with X such that comp(g\x) > X. Then, G has no Hamiltonian cycle. Theorem 6.5 (Dirac-Posá). Let G be a simple graph on n vertices such that deg(u) + deg(v) n for all pair of non-adjacent vertices u, v V (G). Then, G has a Hamiltonian cycle. Corollary 6.6. Let G be a simple graph on n vertices with n 3 and suppose that either (i) E(G) ( ) n 2 n + 3 or (ii) every vertex of G has degree at least n. Then G has an 2 Hamiltonian cycle. 7. Bipartite Graphs Definition. We say that (A, B) is a bipartition of a graph G if A B = V (G), A B = and every edge of G has one end in A and another in B. A graph is bipartite if it has a bipartition. Lemma 7.1. (i) A graph G is bipartite if and only if every component of it is bipartite. (ii) Every tree is bipartite. Theorem 7.2. Let G be a graph. Then, the following are equivalent: (i) G is bipartite. (ii) G contains no closed walk of odd length. (iii) G contains no odd cycle. Definition. We say that a subgraph H of G is induced if every edge of G with both ends in V (H) belongs to H.

6 6 PROF. SERGEY NORIN, FALL 2013 Theorem 7.3. Let G be a simple graph. Then, the following are equivalent: (i) G is bipartite. (ii) G contains no induced odd cycle. 8. Matchings in Bipartite Graphs Definition. A matching in G is a subset M E(G) so that no edge is a loop and no two edges in M are incident to the same edge. Definition. A path P in G is M -alternating if the edges of P alternately belong to M and E(G) M. P is M -augmenting if it also satisfies that the endpoints are not incident to edges in M. Theorem 8.1 (Berge). Let M be a matching of G. There is a matching M with M M if and only if there is an M-augmenting path. Definition. The matching number of G, denoted ν(g) is the maximum size of a matching in G. Theorem 8.2 (König). Let G be a bipartite graph and k N. Then, the following are equivalent: (i) G has a matching M with M k. (ii) There is no subset X V (G) with X < k such that X meets every edge of G. Definition. Let X V (G) and e E(G). We say that e is covered by X if e is incident to v X. If X covers all e E(G), we say that X is a vertex cover. Definition. A matching M is perfect if it covers all vertices in the graph. In particular, M = V (G) /2. Definition. A subset X V (G) is a vertex cover of G if every edge of G has an end in X. Definition. The vertex cover number of G, denoted τ(g) is the minimum size of a vertex cover in G. Corollary (König). If G is bipartite, then ν(g) = τ(g). Theorem 8.3. If G is a bipartite and every vertex has the same degree d > 0, then G has a perfect matching. Theorem 8.4 (Hall). Let G be bipartite with bipartition (A, B). Then, the following are equivalent: (i) There exists a matching in G covering A. (ii) For all Γ A, vertices in Γ have at least Γ neighbours in B.

7 MATH 350 GRAPH THEORY & COMBINATORICS 7 9. Menger s Theorem and Separations Theorem 9.1. For Q, R V (G), k N, exactly one of the following holds. (i) There exists paths P 1, P 2,..., P k each with one end in Q and another in R, pairwise vertex disjoint. (ii) There exists a spearation (A, B), A B < k with Q A and R B. Theorem 9.2 (Menger). Let s, t V (G) be distinct, non-adjacent vertices in a graph G and k 0. Then, exactly one of the following holds. (i) There exists paths P 1, P 2,..., P k from s to t, all disjoint except for their ends. (ii) There exists a separation (A, B) of G of order < k such that s A B, t B A. Definition. A graph G is k-connected if V (G) k + 1 and G\X is connected for all X V (G) with X < k. Theorem 9.3. Let G be a k-connected graph, s, t V (G) distinct. Then, there exists paths P 1, P 2,..., P k from s to t in G, all disjoint except for their ends. Definition. Let G be a graph, X V (G). Then δ(x) denotes the set of all edges of G with one end in X and another in V (G) X. Theorem 9.4. Let k 0 be an integer, G a graph, s, t V (G) distinct vertices of G. Then, exactly one of the following holds. (i) There exists paths P 1, P 2,..., P k in G from s to t pairwise edge-disjoint, that is, E(P i ) E(P j ) = for i j. (ii) There exists X V (G), s X, t V (G) X and δ(x) < k. Definition. Let G be a graph. A line graph of G, denoted L(G) is a graph with V (L(G)) = E(G) and e, f E(G) are adjacent in L(G) if and only if they share an end. 10. Digraphs and Network flows Definition. A digraph G is a graph with every edge e given a direction, that is, on end of e is chosen as its head and the other as its tail. Definition. An edge is said to be directed from its tail to its head. Definition. A directed path in a digraph from s to t is a path from s to t in which the tail of every edge preceeds its head as we traverse the path from s to t. Definition. For X V (G), let δ + (X) denote the set of all edgs with the tail in X and the head in V (G) X. Let δ (X) := δ + (V (G) X). Lemma Let G be a digraph, s, t V (G) distinct. Then, exactly one of the following holds. (i) There exists a directed path from s to t. (ii) There exists X V (G) such that s X, t V (G) X and δ + (X) =.

8 8 PROF. SERGEY NORIN, FALL 2013 Definition. Let G be a digraph, s, t V (G) be distinct vertices of G. The function φ : E(G) R + is called an s-t flow if φ(e) = φ(e) for all v V (G) {s, t}. Definition. The value of φ is e δ + ({v}) e δ + (s) φ(e) e δ (s) e δ ({v}) φ(e). Lemma Let G be a digraph, φ an s-t flow of value k. Then, for all X V (G) with s X and t V (G) X, φ(e) φ(e) = k. e δ + (X) e δ (X) Lemma Let φ be an integral s-t flow of value k. Then there exist directed paths P 1, P 2,..., P k from s to t in G and every edge e of G belongs to at most φ(e) paths. Definition. Let G be a digraph, s, t be distinct vertices of G. For every e E(G), let c(e) Z + be the capacity of this edge. An s-t flow φ is c-admissible if φ(e) c(e) for all e E(G). Definition. A path P with end in s and another in some vertex v is called an augmenting path for φ if (i) φ(e) c(e) 1 for every edge e which is used in the forward direction as P is traversed from s to v. (ii) φ(e) 1 if e E(P ) is traversed in the opposite direction. Lemma Let G, s, t, c be as above. Let φ be an integral c-admissible s-t flow. If there exists an augmenting path P for φ from s to t, then there is a c-admissible s-t flow of value larger than the value of φ. Theorem 10.5 (Max-Flow Min-Cut Berge-Fulkerson). Let G be a directed graph, s, t V (G) distinct, c a capacity function and k 0. Then, exactly one of the following holds. (i) There exists a c-admissible s-t flow of total value k. (ii) There exists X V (G), s X, t V (G) X such that e δ + (X) c(e) < k. 11. Ramsey s Theorem Definition. A subset X V (G) is called stable if no edge has both ends in X, that is, no loops at vertices of X are allowed. Definition. A subset X V (G) is called a clique if every two edges in X is adjacent. In other words, a clique is a complete subgraph of G. Definition. Let s, t 1 be integers. The Ramsey number R(s, t) is the smallest integer n such that every simple graph on n vertices either has an independent set of size s of a clique of size t.

9 MATH 350 GRAPH THEORY & COMBINATORICS 9 Remark. R(1, k) = R(k, 1) = 1 and R(2, k) = R(k, 2) = k. Theorem 11.1 (Ramsey s Theorem, Erdős-Szekeres). The number R(s, t) exists for all s, t 1 and R(s, t) R(s, t 1) + R(s 1, t) for s, t 2. Corollary For s, t 1, R(s, t) ( ) s+t 2 s 1. Definition. A coloring of a set S in k colors is a map c : S {1, 2,... k}. c(s) for s S is called the color of s. Definition. A multicolor Ramsey number R k (s 1, s 2,..., s k ) for k, s 1,..., s k 1 1 all integers is the minimum n such that for every coloring of edges of K n in k colors, there exists 1 i k and a complete graph K n on s i vertices so that all edges of the subgraph have color i. Theorem For all k, s 1,..., s k 1, R k (s 1, s 2,..., s k ) exists. Theorem 11.4 (Schur). For all k N, there exists n N such that in every coloring of {1, 2,..., n} in k colors, one can find integers x, y, z of the same color so that x + y = z. Theorem 11.5 (Schur). For every n 1, there exists p 0 1 such that for all prime p p 0, there exists integers x, y, z not divisible by p such that x n + y n z n (mod p). Theorem 11.6 (Erdős). For s even, R(s, s) 2 s/ Matchings and Tutte s Theorem Theorem 12.1 (Tutte). A graph G has a perfect matching if and only if comp o (G\X) X for every X V (G). Theorem 12.2 (Tutte-Berge formula). Let G be a graph. Then, G has a matching of size k Z + if and only if comp o (G\X) X + V (G) 2k. Theorem Let G be a 3-regular graph (that is, deg(v) = 3 for all v V (G)). If G has no cut-edge, then G has a perfect matching. 13. Vertex coloring Definition. For a graph G, a proper k-vertex coloring of G is a map φ : V (G) S for a set S with S = k such that if u, v are the ends of an edge e E(G), φ(u) φ(v). In particular, no k-coloring exists for a graph containing loops for any k. Definition. The chromatic number χ(g) is the minimum k such that there exists a k-vertex coloring of G. Definition. The clique number, denoted ω(g), is the maximum number if vertices in a complete subgraph of G

10 10 PROF. SERGEY NORIN, FALL 2013 Definition. The independence number, denoted α(g), is the maximum size of an independant set in G. Lemma Let G be a loopless graph. Then, (i) χ(g) ω(g). (ii) χ(g) V (G) /α(g). Algorithm (Greedy coloring algorithm). Input: A graph G and an ordering (v 1, v 2,..., v n ) of vertices. Output: The resulting proper coloring of G. Start by coloring v i in color 1. Once {v 1, v 2,..., v n } are colored, color v i+1 in the smallest available color (that is, the smallest positive integer wich is not used to color any of the neighbors of v i among {v 1, v 2,..., v i }. Continue until all the vertices are colored. Definition. The maximum degree of a vertex in G is denoted by (G). Definition. A graph G is k-degenerate if every subgraph of G has a vertex degree less than k. For instance, trees are 1-degenerate. Lemma Let G be a k-degenerate loopless graph. Then, χ(g) k + 1. In particular, χ(g) (G) + 1. Theorem 13.3 (Brooks). Let G be a connected, loopless graph that is not complete and not an odd cycle. Then, χ(g) (G). 14. Edge coloring Definition. For a loopless graph G, a k-edge coloring is a map φ : E(G) S with S = k such that φ(e) φ(f) for e, f incident to the same vertex. Definition. The edge chromatic number, denoted χ (G) is the smallest k such that G admits a k-edge coloring. In particular, χ (G) = χ(l(g)). Note. (G) χ (G) 2 (G) 1. Lemma Let G be a graph with (G) d for some d. Then, G is a subgraph of some d-regular graph H. Moreover, if G is loopless (or bipartite), then H can be chosen to be loopless (resp. bipartite). Theorem 14.2 (König). If G is bipartite, then χ (G) = (G). Definition. A 2-factor in a graph in a graph G is a collection F E(G) such that every vertex is incident with exactly 2 edges. Lemma Let G be a loopless 2k-regular graph. Then, E(G) can be partitioned into k 2-factors. Theorem 14.4 (Shannon). Let G be a loopless graph. Then χ (G) 3 (G)/2 Theorem 14.5 (Vizing). If G is simple, then χ (G) (G) + 1.

11 MATH 350 GRAPH THEORY & COMBINATORICS Series-Parallel Graphs Definition (Edge contraction). Let e be an edge of a graph G with ends u, v. The graph G/e obtained by contracting e in G is produced by deleting e and identifying u and v. Definition. A graph H is a minor of a graph G if it can be obtained from a subgraph of G by contracting edges sequentially. Conjecture (Hadwiger s Conjecture). Let G be a loopless graph with no K t minor. Then, χ(g) t 1. (Open problem for t 7). Lemma Every 3-connected graph G contains K 4 as a minor. Lemma Let G be a simple graph with no K 4 minor. Let X V (G) be a clique with X 2 and X V (G). Then, there exists v V (G) X with deg(v) 2. Corollary If G is a simple graph with no K 4 minor, then it is 2-degenerate. Therefore, G is 3-colorable. Hence, Hadwiger s Conjecture holds for t = 4. Definition. A graph is series-parallel if it can be constructed from an empty graph by repeatedly Adding a vertex of degree less than 1. Adding a loop or a parallel edge. Subdividing an edge. Lemma A minor of a series-parallel graph is series-parallel. Lemma A graph G is series parallel if and only if it has no K 4 minor. 16. Planar graphs Definition. A drawing of a graph in the plane satisfies the following. Vertices are represented by distinct points on the plane. Edges are represented by simple curves joining their corresponding ends. These curves do not intersect each other or themselves. These curves do no pass through except for their ends. Definition. A graph is planar if it admits a planar drawing. Definition. A drawing divides the plane into regions where two points of the plane not belonging to the drawing belong to the same region if and only if there is a simple curve from one point to another disjpint from the drawing. We denote by Reg(G) the number of regions of a planar graph G. Theorem (Jordan Curve Theorem). Every simple closed curve divides the plane into 2 regions. Lemma If G is a graph drawn in the plane and e E(G) is not a cut-edge, then the regions on the different sides of e are different.

12 12 PROF. SERGEY NORIN, FALL 2013 Lemma If F is a forest drawn in the plan, then Reg(F ) = 1. Theorem 16.3 (Euler s formula). Let G be a graph drawn in the plane. Then, V (G) E(G) + Reg(G) = 1 + comp(g). Definition. If R is a region of a drawing of G, then the length of a region R, denoted Length(R) is the number of edges on the boundary or R, with edge e counted twice if R lies on both sides of e. Lemma If G is a simple connected graph drawn in the plane with E(G) 2, then Length(R) 3 for all region R of the drawing of G. Theorem Let G be a planar simple graph such that E(G) 2. Then, E(G) 3 V (G) 6 and if G has no K 3 subgraphs, then E(G) 2 V (G) 4. Definition. A complete bipartite graph K m,n is a simple graph with bipartition (A, B) such that A = m and B = n, E(K m,n ) = mn. That is, every vertex of A is adjacent to every vertex of B. Corollary The graph K 5 and K 3,3 are non-planar. 17. Kuratowski s Theorem Lemma Let G be a 2-connected loopless graph drawn in the plane. Then, the boundary of every region is a cycle in G. Lemma Let C be a cycle, X, Y V (C). Then, exactly one of the following holds. (i) There exists u, v V (C) such that if P, Q are two paths from u to v in C comprising the cycle, then X V (P ) and Y V (Q). (ii) There exists distinct x 1, y 1, x 2, y 2 V (C) appearing in this cyclic order such that x i X and y i Y for i = 1, 2. (iii) X = Y and X = Y = 3. Theorem 17.3 (Kuratowski s Theorem). A graph G is planar if and only if it contains neither K 5 nor K 3,3 as a minor. Definition. G is called a subdivision of H if G is obtained from H by subdividing edges, that is, every edge of H is replaced by a path with the same length. If G is a subdivision of H, then H is a minor of G (the converse does not always hold). Theorem A graph G is planar if and only if G does not contain a subdivision of K 5 or K 3,3 as a subgraph.

13 MATH 350 GRAPH THEORY & COMBINATORICS Coloring planar graphs Lemma Let G be a simple planar graph with at least 3 vertices. Then, (6 deg(v)) 12. v V (G) Corollary If G is a planar and simple graph, then G is 5-degenerate. In particular, χ(g) 6. Theorem 18.3 (Heawood). If G is a planar and loopless graph, then χ(g) 5. Theorem 18.4 (Appel-Haken The Four Color Theorem). If G is planar and loopless, then χ(g) 4. Definition. A planar triangulation is a planar graph in which every region, including the infinite one, is a triangle. Lemma Let G be a simple planar triangulation. Then, G contains one of the following. (i) A vertex of degree less than 4. (ii) Two neighboring vertices of degree 5. (iii) A region with vertices of degree 5, 6 and 6. Theorem Let G be a planar triangulation which contains the subgraph drawn in the figure (see class notes) such that all the triangular regions in the figure are the drawings of G. Let G be obtained from G by deleting the vertices {x, y, z, w}, identifying a and c and adding an edge between e and f. If G is 4-colorable, then so is G. Theorem. For every simple 3-regular planar graph G, χ (G) = 3. Definition. Let G be a connected graph drawn on the plane and let G be another graph drawn in the plane. We say that G is the planar dual graph of G if (i) Every region of G contains exactly one vertex of G. (ii) Every edge of G is crossed exactly one edge of G and the drawings of G and G are otherwise disjoint. (iii) E(G) = E(G ). Theorem 18.7 (Tait). Let G be a planar triangulation and let G be a planar dual of G. Then, χ(g) 4 if and only if χ (G ) = Perfect graphs Definition. We say that a graph G is perfect if χ(h) = ω(h) for every induced subgraph H of G. In other words, G is perfect if the chromatic number of H is equal to the clique number of H for any subgraph H. Definition. Let G be a simple graph. A complement G of G is a simple graph with V (G) = V (G) and two vertices in G are adjacent if and only if they are not adjacent in G. Lemma Complements of bipartite graphs are perfect.

14 14 PROF. SERGEY NORIN, FALL 2013 Lemma Line graphs of bipartite graphs are perfect. Lemma Complements of line graph of bipartite graphs are perfect. Definition. A chordal graph is a graph H that has no cycles of length at least 4 as induced subgraphs. Definition. We say that a graph G is obtained by gluing subgraphs G 1 and G 2 along a subgraph S if G = G 1 G 2 and G 1 G 2 = S. Theorem A graph is chordal if and only if it can be obtained by repeatedly gluing along complete subgraphs starting with complete graphs. Corollary Chordal graphs are perfect. Definition. Let G be a simple graph and x V (G). Let G be obtained from G by adding a new vertex x and joining it by edges to x and all the niehgbors of x. We say that G is obtained from G by expanding x to an edge xx. Lemma If G is perfect and G is obtained from G by expanding x V (G) to an edge xx, then G is perfect. Theorem 19.7 (Lovász Weak Perfect Graph Theorem). G is perfect if and only if G is perfect. Theorem 19.8 (Chudnovsky-Robertson-Seymour-Thomas). G is perfect if and only if ut dies bit cibtaub C 2k+1 or C 2k+1 for k 2 as an induced subgraph.

Adjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.

Adjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge. 1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one

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

Vertex coloring, chromatic number

Vertex coloring, chromatic number Vertex coloring, chromatic number A k-coloring of a graph G is a labeling f : V (G) S, where S = k. The labels are called colors; the vertices of one color form a color class. A k-coloring is proper if

More information

Characterizations of graph classes by forbidden configurations

Characterizations of graph classes by forbidden configurations Characterizations of graph classes by forbidden configurations Zdeněk Dvořák September 14, 2015 We consider graph classes that can be described by excluding some fixed configurations. Let us give some

More information

Vertex coloring, chromatic number

Vertex coloring, chromatic number Vertex coloring, chromatic number A k-coloring of a graph G is a labeling f : V (G) S, where S = k. The labels are called colors; the vertices of one color form a color class. A k-coloring is proper if

More information

Graphs and Discrete Structures

Graphs and Discrete Structures Graphs and Discrete Structures Nicolas Bousquet Louis Esperet Fall 2018 Abstract Brief summary of the first and second course. É 1 Chromatic number, independence number and clique number The chromatic

More information

Combinatorics Summary Sheet for Exam 1 Material 2019

Combinatorics Summary Sheet for Exam 1 Material 2019 Combinatorics Summary Sheet for Exam 1 Material 2019 1 Graphs Graph An ordered three-tuple (V, E, F ) where V is a set representing the vertices, E is a set representing the edges, and F is a function

More information

Part II. Graph Theory. Year

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

More information

4. (a) Draw the Petersen graph. (b) Use Kuratowski s teorem to prove that the Petersen graph is non-planar.

4. (a) Draw the Petersen graph. (b) Use Kuratowski s teorem to prove that the Petersen graph is non-planar. UPPSALA UNIVERSITET Matematiska institutionen Anders Johansson Graph Theory Frist, KandMa, IT 010 10 1 Problem sheet 4 Exam questions Solve a subset of, say, four questions to the problem session on friday.

More information

Key Graph Theory Theorems

Key Graph Theory Theorems Key Graph Theory Theorems Rajesh Kumar MATH 239 Intro to Combinatorics August 19, 2008 3.3 Binary Trees 3.3.1 Problem (p.82) Determine the number, t n, of binary trees with n edges. The number of binary

More information

Math 777 Graph Theory, Spring, 2006 Lecture Note 1 Planar graphs Week 1 Weak 2

Math 777 Graph Theory, Spring, 2006 Lecture Note 1 Planar graphs Week 1 Weak 2 Math 777 Graph Theory, Spring, 006 Lecture Note 1 Planar graphs Week 1 Weak 1 Planar graphs Lectured by Lincoln Lu Definition 1 A drawing of a graph G is a function f defined on V (G) E(G) that assigns

More information

MATH 363 Final Wednesday, April 28. Final exam. You may use lemmas and theorems that were proven in class and on assignments unless stated otherwise.

MATH 363 Final Wednesday, April 28. Final exam. You may use lemmas and theorems that were proven in class and on assignments unless stated otherwise. Final exam This is a closed book exam. No calculators are allowed. Unless stated otherwise, justify all your steps. You may use lemmas and theorems that were proven in class and on assignments unless stated

More information

How many colors are needed to color a map?

How many colors are needed to color a map? How many colors are needed to color a map? Is 4 always enough? Two relevant concepts How many colors do we need to color a map so neighboring countries get different colors? Simplifying assumption (not

More information

Small Survey on Perfect Graphs

Small Survey on Perfect Graphs Small Survey on Perfect Graphs Michele Alberti ENS Lyon December 8, 2010 Abstract This is a small survey on the exciting world of Perfect Graphs. We will see when a graph is perfect and which are families

More information

How many colors are needed to color a map?

How many colors are needed to color a map? How many colors are needed to color a map? Is 4 always enough? Two relevant concepts How many colors do we need to color a map so neighboring countries get different colors? Simplifying assumption (not

More information

Assignments are handed in on Tuesdays in even weeks. Deadlines are:

Assignments are handed in on Tuesdays in even weeks. Deadlines are: Tutorials at 2 3, 3 4 and 4 5 in M413b, on Tuesdays, in odd weeks. i.e. on the following dates. Tuesday the 28th January, 11th February, 25th February, 11th March, 25th March, 6th May. Assignments are

More information

Jordan Curves. A curve is a subset of IR 2 of the form

Jordan Curves. A curve is a subset of IR 2 of the form Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0, 1]}, where γ : [0, 1] IR 2 is a continuous mapping from the closed interval [0, 1] to the plane. γ(0) and γ(1) are called the endpoints

More information

Assignment 1 Introduction to Graph Theory CO342

Assignment 1 Introduction to Graph Theory CO342 Assignment 1 Introduction to Graph Theory CO342 This assignment will be marked out of a total of thirty points, and is due on Thursday 18th May at 10am in class. Throughout the assignment, the graphs are

More information

Mock Exam. Juanjo Rué Discrete Mathematics II, Winter Deadline: 14th January 2014 (Tuesday) by 10:00, at the end of the lecture.

Mock Exam. Juanjo Rué Discrete Mathematics II, Winter Deadline: 14th January 2014 (Tuesday) by 10:00, at the end of the lecture. Mock Exam Juanjo Rué Discrete Mathematics II, Winter 2013-2014 Deadline: 14th January 2014 (Tuesday) by 10:00, at the end of the lecture. Problem 1 (2 points): 1. State the definition of perfect graph

More information

Network flows and Menger s theorem

Network flows and Menger s theorem Network flows and Menger s theorem Recall... Theorem (max flow, min cut strong duality). Let G be a network. The maximum value of a flow equals the minimum capacity of a cut. We prove this strong duality

More information

Exercise set 2 Solutions

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

More information

Discrete mathematics II. - Graphs

Discrete mathematics II. - Graphs Emil Vatai April 25, 2018 Basic definitions Definition of an undirected graph Definition (Undirected graph) An undirected graph or (just) a graph is a triplet G = (ϕ, E, V ), where V is the set of vertices,

More information

Math 776 Graph Theory Lecture Note 1 Basic concepts

Math 776 Graph Theory Lecture Note 1 Basic concepts Math 776 Graph Theory Lecture Note 1 Basic concepts Lectured by Lincoln Lu Transcribed by Lincoln Lu Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved

More information

CMSC Honors Discrete Mathematics

CMSC Honors Discrete Mathematics CMSC 27130 Honors Discrete Mathematics Lectures by Alexander Razborov Notes by Justin Lubin The University of Chicago, Autumn 2017 1 Contents I Number Theory 4 1 The Euclidean Algorithm 4 2 Mathematical

More information

Topics on Computing and Mathematical Sciences I Graph Theory (13) Summary and Review

Topics on Computing and Mathematical Sciences I Graph Theory (13) Summary and Review Topics on Computing and Mathematical Sciences I Graph Theory () Summary and Review Yoshio Okamoto Tokyo Institute of Technology July, 00 Schedule Basic Topics Definition of Graphs; Paths and Cycles Cycles;

More information

The following is a summary, hand-waving certain things which actually should be proven.

The following is a summary, hand-waving certain things which actually should be proven. 1 Basics of Planar Graphs The following is a summary, hand-waving certain things which actually should be proven. 1.1 Plane Graphs A plane graph is a graph embedded in the plane such that no pair of lines

More information

Introduction to. Graph Theory. Second Edition. Douglas B. West. University of Illinois Urbana. ftentice iiilil PRENTICE HALL

Introduction to. Graph Theory. Second Edition. Douglas B. West. University of Illinois Urbana. ftentice iiilil PRENTICE HALL Introduction to Graph Theory Second Edition Douglas B. West University of Illinois Urbana ftentice iiilil PRENTICE HALL Upper Saddle River, NJ 07458 Contents Preface xi Chapter 1 Fundamental Concepts 1

More information

Colouring graphs with no odd holes

Colouring graphs with no odd holes Colouring graphs with no odd holes Paul Seymour (Princeton) joint with Alex Scott (Oxford) 1 / 17 Chromatic number χ(g): minimum number of colours needed to colour G. 2 / 17 Chromatic number χ(g): minimum

More information

Problem Set 3. MATH 776, Fall 2009, Mohr. November 30, 2009

Problem Set 3. MATH 776, Fall 2009, Mohr. November 30, 2009 Problem Set 3 MATH 776, Fall 009, Mohr November 30, 009 1 Problem Proposition 1.1. Adding a new edge to a maximal planar graph of order at least 6 always produces both a T K 5 and a T K 3,3 subgraph. Proof.

More information

Introduction III. Graphs. Motivations I. Introduction IV

Introduction III. Graphs. Motivations I. Introduction IV Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg

More information

CS 311 Discrete Math for Computer Science Dr. William C. Bulko. Graphs

CS 311 Discrete Math for Computer Science Dr. William C. Bulko. Graphs CS 311 Discrete Math for Computer Science Dr. William C. Bulko Graphs 2014 Definitions Definition: A graph G = (V,E) consists of a nonempty set V of vertices (or nodes) and a set E of edges. Each edge

More information

Basics of Graph Theory

Basics of Graph Theory Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their

More information

Planar graphs. Chapter 8

Planar graphs. Chapter 8 Chapter 8 Planar graphs Definition 8.1. A graph is called planar if it can be drawn in the plane so that edges intersect only at vertices to which they are incident. Example 8.2. Different representations

More information

Graph Theory. Connectivity, Coloring, Matching. Arjun Suresh 1. 1 GATE Overflow

Graph Theory. Connectivity, Coloring, Matching. Arjun Suresh 1. 1 GATE Overflow Graph Theory Connectivity, Coloring, Matching Arjun Suresh 1 1 GATE Overflow GO Classroom, August 2018 Thanks to Subarna/Sukanya Das for wonderful figures Arjun, Suresh (GO) Graph Theory GATE 2019 1 /

More information

Lecture Notes on Graph Theory

Lecture Notes on Graph Theory Lecture Notes on Graph Theory Vadim Lozin 1 Introductory concepts A graph G = (V, E) consists of two finite sets V and E. The elements of V are called the vertices and the elements of E the edges of G.

More information

Abstract. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H is equal to the size of the largest clique of H.

Abstract. A graph G is perfect if for every induced subgraph H of G, the chromatic number of H is equal to the size of the largest clique of H. Abstract We discuss a class of graphs called perfect graphs. After defining them and getting intuition with a few simple examples (and one less simple example), we present a proof of the Weak Perfect Graph

More information

Math 776 Homework. Austin Mohr. June 15, Theorem 1.1. The following assertions are equivalent for a graph T : (i) T is a tree;

Math 776 Homework. Austin Mohr. June 15, Theorem 1.1. The following assertions are equivalent for a graph T : (i) T is a tree; Math 776 Homework Austin Mohr June 15, 2012 1 Problem 1 Theorem 1.1. The following assertions are equivalent for a graph T : (i) T is a tree; (ii) Any two vertices of T are linked by a unique path in T

More information

Jordan Curves. A curve is a subset of IR 2 of the form

Jordan Curves. A curve is a subset of IR 2 of the form Jordan Curves A curve is a subset of IR 2 of the form α = {γ(x) : x [0,1]}, where γ : [0,1] IR 2 is a continuous mapping from the closed interval [0,1] to the plane. γ(0) and γ(1) are called the endpoints

More information

Graph Theory S 1 I 2 I 1 S 2 I 1 I 2

Graph Theory S 1 I 2 I 1 S 2 I 1 I 2 Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent

More information

GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS

GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS DR. ANDREW SCHWARTZ, PH.D. 10.1 Graphs and Graph Models (1) A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes)

More information

Definition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1

Definition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1 Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,

More information

Chapter 6 GRAPH COLORING

Chapter 6 GRAPH COLORING Chapter 6 GRAPH COLORING A k-coloring of (the vertex set of) a graph G is a function c : V (G) {1, 2,..., k} such that c (u) 6= c (v) whenever u is adjacent to v. Ifak-coloring of G exists, then G is called

More information

8 Colouring Planar Graphs

8 Colouring Planar Graphs 8 Colouring Planar Graphs The Four Colour Theorem Lemma 8.1 If G is a simple planar graph, then (i) 12 v V (G)(6 deg(v)) with equality for triangulations. (ii) G has a vertex of degree 5. Proof: For (i),

More information

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

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

More information

The Structure of Bull-Free Perfect Graphs

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

More information

List Coloring Graphs

List Coloring Graphs List Coloring Graphs January 29, 2004 CHROMATIC NUMBER Defn 1 A k coloring of a graph G is a function c : V (G) {1, 2,... k}. A proper k coloring of a graph G is a coloring of G with k colors so that no

More information

Lecture 6: Graph Properties

Lecture 6: Graph Properties Lecture 6: Graph Properties Rajat Mittal IIT Kanpur In this section, we will look at some of the combinatorial properties of graphs. Initially we will discuss independent sets. The bulk of the content

More information

Bipartite Roots of Graphs

Bipartite Roots of Graphs Bipartite Roots of Graphs Lap Chi Lau Department of Computer Science University of Toronto Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only

More information

Graph and Digraph Glossary

Graph and Digraph Glossary 1 of 15 31.1.2004 14:45 Graph and Digraph Glossary A B C D E F G H I-J K L M N O P-Q R S T U V W-Z Acyclic Graph A graph is acyclic if it contains no cycles. Adjacency Matrix A 0-1 square matrix whose

More information

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter

More information

Discrete mathematics

Discrete mathematics Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2017/2018 About this file This file is meant to be a guideline for the lecturer. Many

More information

Graph Minors and Minimum Degree

Graph Minors and Minimum Degree Graph Minors and Minimum Degree Gašper Fijavž Faculty of Computer and Information Science University of Ljubljana Ljubljana, Slovenia gasper.fijavz@fri.uni-lj.si David R. Wood Department of Mathematics

More information

Planarity: dual graphs

Planarity: dual graphs : dual graphs Math 104, Graph Theory March 28, 2013 : dual graphs Duality Definition Given a plane graph G, the dual graph G is the plane graph whose vtcs are the faces of G. The correspondence between

More information

Characterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4)

Characterizing Graphs (3) Characterizing Graphs (1) Characterizing Graphs (2) Characterizing Graphs (4) S-72.2420/T-79.5203 Basic Concepts 1 S-72.2420/T-79.5203 Basic Concepts 3 Characterizing Graphs (1) Characterizing Graphs (3) Characterizing a class G by a condition P means proving the equivalence G G

More information

Planarity. 1 Introduction. 2 Topological Results

Planarity. 1 Introduction. 2 Topological Results Planarity 1 Introduction A notion of drawing a graph in the plane has led to some of the most deep results in graph theory. Vaguely speaking by a drawing or embedding of a graph G in the plane we mean

More information

Let G = (V, E) be a graph. If u, v V, then u is adjacent to v if {u, v} E. We also use the notation u v to denote that u is adjacent to v.

Let G = (V, E) be a graph. If u, v V, then u is adjacent to v if {u, v} E. We also use the notation u v to denote that u is adjacent to v. Graph Adjacent Endpoint of an edge Incident Neighbors of a vertex Degree of a vertex Theorem Graph relation Order of a graph Size of a graph Maximum and minimum degree Let G = (V, E) be a graph. If u,

More information

Lecture Notes Graph Theory

Lecture Notes Graph Theory Lecture Notes Graph Theory Prof. Dr. Maria Axenovich December 6, 2016 1 Contents 1 Introduction 3 2 Notations 3 3 Preliminaries 4 4 Matchings 13 5 Connectivity 16 6 Planar graphs 20 7 Colorings 25 8 Extremal

More information

Topics in Combinatorics. Dorottya Sziráki Gergő Nemes

Topics in Combinatorics. Dorottya Sziráki Gergő Nemes Topics in Combinatorics Dorottya Sziráki Gergő Nemes ii Preface These notes are based on the lectures of the course titled Topics in Combinatorics, which were given by Ervin Győri in the winter trimester

More information

5 Graphs

5 Graphs 5 Graphs jacques@ucsd.edu Some of the putnam problems are to do with graphs. They do not assume more than a basic familiarity with the definitions and terminology of graph theory. 5.1 Basic definitions

More information

Math 778S Spectral Graph Theory Handout #2: Basic graph theory

Math 778S Spectral Graph Theory Handout #2: Basic graph theory Math 778S Spectral Graph Theory Handout #: Basic graph theory Graph theory was founded by the great Swiss mathematician Leonhard Euler (1707-178) after he solved the Königsberg Bridge problem: Is it possible

More information

Graphs and trees come up everywhere. We can view the internet as a graph (in many ways) Web search views web pages as a graph

Graphs and trees come up everywhere. We can view the internet as a graph (in many ways) Web search views web pages as a graph Graphs and Trees Graphs and trees come up everywhere. We can view the internet as a graph (in many ways) who is connected to whom Web search views web pages as a graph Who points to whom Niche graphs (Ecology):

More information

Planar Graph (7A) Young Won Lim 6/20/18

Planar Graph (7A) Young Won Lim 6/20/18 Planar Graph (7A) Copyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later

More information

INTRODUCTION TO GRAPH THEORY. 1. Definitions

INTRODUCTION TO GRAPH THEORY. 1. Definitions INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident with

More information

ECS 20 Lecture 17b = Discussion D8 Fall Nov 2013 Phil Rogaway

ECS 20 Lecture 17b = Discussion D8 Fall Nov 2013 Phil Rogaway 1 ECS 20 Lecture 17b = Discussion D8 Fall 2013 25 Nov 2013 Phil Rogaway Today: Using discussion section to finish up graph theory. Much of these notes the same as those prepared for last lecture and the

More information

IMO Training 2008: Graph Theory

IMO Training 2008: Graph Theory IMO Training 2008: Graph Theory by: Adrian Tang Email: tang @ math.ucalgary.ca This is a compilation of math problems (with motivation towards the training for the International Mathematical Olympiad)

More information

Class Six: Coloring Planar Graphs

Class Six: Coloring Planar Graphs Class Six: Coloring Planar Graphs A coloring of a graph is obtained by assigning every vertex a color such that if two vertices are adjacent, then they receive different colors. Drawn below are three different

More information

Graph theory. Po-Shen Loh. June We begin by collecting some basic facts which can be proved via bare-hands techniques.

Graph theory. Po-Shen Loh. June We begin by collecting some basic facts which can be proved via bare-hands techniques. Graph theory Po-Shen Loh June 013 1 Basic results We begin by collecting some basic facts which can be proved via bare-hands techniques. 1. The sum of all of the degrees is equal to twice the number of

More information

Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes

Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Leonor Aquino-Ruivivar Mathematics Department, De La Salle University Leonorruivivar@dlsueduph

More information

1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G))

1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G)) 10 Graphs 10.1 Graphs and Graph Models 1. a graph G = (V (G), E(G)) consists of a set V (G) of vertices, and a set E(G) of edges (edges are pairs of elements of V (G)) 2. an edge is present, say e = {u,

More information

Introduction to Graph Theory

Introduction to Graph Theory Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex

More information

Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem

Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem David Glickenstein November 26, 2008 1 Graph minors Let s revisit some de nitions. Let G = (V; E) be a graph. De nition 1 Removing

More information

A taste of perfect graphs (continued)

A taste of perfect graphs (continued) A taste of perfect graphs (continued) Recall two theorems from last class characterizing perfect graphs (and that we observed that the α ω theorem implied the Perfect Graph Theorem). Perfect Graph Theorem.

More information

arxiv: v1 [math.co] 4 Apr 2011

arxiv: v1 [math.co] 4 Apr 2011 arxiv:1104.0510v1 [math.co] 4 Apr 2011 Minimal non-extensible precolorings and implicit-relations José Antonio Martín H. Abstract. In this paper I study a variant of the general vertex coloring problem

More information

Theorem 3.1 (Berge) A matching M in G is maximum if and only if there is no M- augmenting path.

Theorem 3.1 (Berge) A matching M in G is maximum if and only if there is no M- augmenting path. 3 Matchings Hall s Theorem Matching: A matching in G is a subset M E(G) so that no edge in M is a loop, and no two edges in M are incident with a common vertex. A matching M is maximal if there is no matching

More information

Math 3012 Applied Combinatorics Lecture 12

Math 3012 Applied Combinatorics Lecture 12 September 29, 2015 Math 3012 Applied Combinatorics Lecture 12 William T. Trotter trotter@math.gatech.edu Planar Graphs Definition A graph G is planar if it can be drawn in the plane with no edge crossings.

More information

Lecture 4: Bipartite graphs and planarity

Lecture 4: Bipartite graphs and planarity Lecture 4: Bipartite graphs and planarity Anders Johansson 2011-10-22 lör Outline Bipartite graphs A graph G is bipartite with bipartition V1, V2 if V = V1 V2 and all edges ij E has one end in V1 and V2.

More information

VIZING S THEOREM AND EDGE-CHROMATIC GRAPH THEORY. Contents

VIZING S THEOREM AND EDGE-CHROMATIC GRAPH THEORY. Contents VIZING S THEOREM AND EDGE-CHROMATIC GRAPH THEORY ROBERT GREEN Abstract. This paper is an expository piece on edge-chromatic graph theory. The central theorem in this subject is that of Vizing. We shall

More information

Hamiltonian cycles in bipartite quadrangulations on the torus

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

More information

Matching Theory. Amitava Bhattacharya

Matching Theory. Amitava Bhattacharya Matching Theory Amitava Bhattacharya amitava@math.tifr.res.in Definition: A simple graph is a triple G = (V, E, φ), where V is a finite set of vertices, E is a finite set of edges, and φ is a function

More information

Elements of Graph Theory

Elements of Graph Theory Elements of Graph Theory Quick review of Chapters 9.1 9.5, 9.7 (studied in Mt1348/2008) = all basic concepts must be known New topics we will mostly skip shortest paths (Chapter 9.6), as that was covered

More information

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

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

More information

Discharging and reducible configurations

Discharging and reducible configurations Discharging and reducible configurations Zdeněk Dvořák March 24, 2018 Suppose we want to show that graphs from some hereditary class G are k- colorable. Clearly, we can restrict our attention to graphs

More information

Excluding induced subgraphs

Excluding induced subgraphs Excluding induced subgraphs Maria Chudnovsky and Paul Seymour Abstract 1 Introduction Given two graphs, G and H, we say that H is an induced subgraph of G if V (H) V (G), and two vertices of H are adjacent

More information

GRAPH THEORY and APPLICATIONS. Factorization Domination Indepence Clique

GRAPH THEORY and APPLICATIONS. Factorization Domination Indepence Clique GRAPH THEORY and APPLICATIONS Factorization Domination Indepence Clique Factorization Factor A factor of a graph G is a spanning subgraph of G, not necessarily connected. G is the sum of factors G i, if:

More information

Graph Theory. Lecture by Prof. Dr. Maria Axenovich. Lecture notes by Mónika Csikós, Daniel Hoske and Torsten Ueckerdt

Graph Theory. Lecture by Prof. Dr. Maria Axenovich. Lecture notes by Mónika Csikós, Daniel Hoske and Torsten Ueckerdt Graph Theory Lecture by Prof. Dr. Maria Axenovich Lecture notes by Mónika Csikós, Daniel Hoske and Torsten Ueckerdt 1 Contents 1 Introduction 3 2 Notations 3 3 Preliminaries 4 4 Matchings 13 5 Connectivity

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Graph theory G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 1 GG A.I. 1/37 Outline 1 Graph theory Undirected and directed graphs

More information

K 4,4 e Has No Finite Planar Cover

K 4,4 e Has No Finite Planar Cover K 4,4 e Has No Finite Planar Cover Petr Hliněný Dept. of Applied Mathematics, Charles University, Malostr. nám. 25, 118 00 Praha 1, Czech republic (E-mail: hlineny@kam.ms.mff.cuni.cz) February 9, 2005

More information

Lecture 20 : Trees DRAFT

Lecture 20 : Trees DRAFT CS/Math 240: Introduction to Discrete Mathematics 4/12/2011 Lecture 20 : Trees Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we discussed graphs. Today we continue this discussion,

More information

November 14, Planar Graphs. William T. Trotter.

November 14, Planar Graphs. William T. Trotter. November 14, 2017 8 Planar Graphs William T. Trotter trotter@math.gatech.edu Planar Graphs Definition A graph G is planar if it can be drawn in the plane with no edge crossings. Exercise The two graphs

More information

1 Some Solution of Homework

1 Some Solution of Homework Math 3116 Dr. Franz Rothe May 30, 2012 08SUM\3116_2012h1.tex Name: Use the back pages for extra space 1 Some Solution of Homework Proposition 1 (Counting labeled trees). There are n n 2 different labeled

More information

UNDIRECTED GRAPH: a set of vertices and a set of undirected edges each of which is associated with a set of one or two of these vertices.

UNDIRECTED GRAPH: a set of vertices and a set of undirected edges each of which is associated with a set of one or two of these vertices. Graphs 1 Graph: A graph G = (V, E) consists of a nonempty set of vertices (or nodes) V and a set of edges E. Each edge has either one or two vertices associated with it, called its endpoints. An edge is

More information

HOMEWORK 4 SOLUTIONS. Solution: The Petersen graph contains a cycle of odd length as a subgraph. Hence,

HOMEWORK 4 SOLUTIONS. Solution: The Petersen graph contains a cycle of odd length as a subgraph. Hence, HOMEWORK 4 SOLUTIONS (1) Determine the chromatic number of the Petersen graph. Solution: The Petersen graph contains a cycle of odd length as a subgraph. Hence, 3 χ(c 5 ) χ(p ). As the Petersen graph is

More information

Discrete Wiskunde II. Lecture 6: Planar Graphs

Discrete Wiskunde II. Lecture 6: Planar Graphs , 2009 Lecture 6: Planar Graphs University of Twente m.uetz@utwente.nl wwwhome.math.utwente.nl/~uetzm/dw/ Planar Graphs Given an undirected graph (or multigraph) G = (V, E). A planar embedding of G is

More information

MAT 145: PROBLEM SET 6

MAT 145: PROBLEM SET 6 MAT 145: PROBLEM SET 6 DUE TO FRIDAY MAR 8 Abstract. This problem set corresponds to the eighth week of the Combinatorics Course in the Winter Quarter 2019. It was posted online on Friday Mar 1 and is

More information

Math 443/543 Graph Theory Notes 5: Planar graphs and coloring

Math 443/543 Graph Theory Notes 5: Planar graphs and coloring Math 443/543 Graph Theory Notes 5: Planar graphs and coloring David Glickenstein October 10, 2014 1 Planar graphs The Three Houses and Three Utilities Problem: Given three houses and three utilities, can

More information

Matching and Planarity

Matching and Planarity Matching and Planarity Po-Shen Loh June 010 1 Warm-up 1. (Bondy 1.5.9.) There are n points in the plane such that every pair of points has distance 1. Show that there are at most n (unordered) pairs of

More information

context. (Similarly, we write ν for ν(g), etc. if there is no risk of confusion.) For a subset A V we write N G (A) = {v V ( w A)(v w)} (the set of

context. (Similarly, we write ν for ν(g), etc. if there is no risk of confusion.) For a subset A V we write N G (A) = {v V ( w A)(v w)} (the set of Graph Theory CMSC-27500 Spring 2015 http://people.cs.uchicago.edu/ laci/15graphs Homework set #4. First batch posted 4-9, 8am, updated 10:20am. Problems 4.16 4.31 added at 11:30pm. Due Tuesday, April 14

More information

Matching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.

Matching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition. 18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have

More information

Number Theory and Graph Theory

Number Theory and Graph Theory 1 Number Theory and Graph Theory Chapter 6 Basic concepts and definitions of graph theory By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com

More information

CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS

CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1. Define Graph. A graph G = (V, E) consists

More information