MATH20902: Discrete Maths, Solutions to Problem Set 1. These solutions, as well as the corresponding problems, are available at
|
|
- Silvia Anthony
- 5 years ago
- Views:
Transcription
1 MATH20902: Discrete Maths, Solutions to Problem Set 1 These solutions, as well as the corresponding problems, are available at (1). The upper panel in the figure below shows the maze and the network of paths within it while the lower panel shows the network of paths as a graph with named vertices. Finish Start f g h d c Finish e b n m i j k l Start a Once one has the bottom panel of the figure above, it s easy to abstract it further, to a form in which the solution is obvious: Start f e n j i m a b d c g h k l Finish Notice that there is not a unique path from the start vertex to the finish. The cycle that includes vertices g, h and n encloses a segment of the maze s walls that are, in a natural sense, disconnected from the rest. 1
2 (2). The complete graph K 4 can t be a subgraph of the complete bipartite graph K 4,4. To see why, consider the diagram of K 4,4 below and note that edges run between all possible pairs of red and white vertices, but that no edges run red-to-red or white-to-white. This observation enables us to prove our result by contradiction. Suppose for contradiction that we can find a subset V consisting of four vertices from K 4,4 and that these, along with a suitable subset of the edges, form a subgraph isomorphic to K 4. K 4,4 K 4 As V contains four vertices and the diagram of K 4,4 above organises the vertices into only two groups (the ones from the definition of bipartite: see the first lecture) the Pigeonhole Principle tells us that there must be two vertices in V that belong to the same group. But then these two cannot be adjacent in any subgraph of K 4,4, as a bipartite graph has no edges running between vertices in the same group. And this contradicts the claim that V is the vertex set of a subgraph isomorphic to K 4, for in K 4 every vertex is adjacent to every other. (3). P 4 isn t an induced subgraph of K 4,4, though C 4 is. Let s say that the vertex set of P 4 is {v 1, v 2, v 3, v 4 }, with edges (v j, v j+1 ) for 1 j 3. Now suppose aiming at a proof by contradiction that we have a bijection α mapping these four vertices to a subset of those in K 4,4. Then α(v 1 ) and α(v 3 ) would have to lie in one of the bipartite graph s two subsets (see the previous answer for an illustration of these subsets) while α(v 2 ) and α(v 4 ) would lie in the other subset. But then the subgraph of K 4,4 induced by the vertices {α(v 1 ), α(v 2 ), α(v 3 ), α(v 4 )} would include the following four edges {(α(v 1 ), α(v 2 )), (α(v 2 ), α(v 3 )), (α(v 3 ), α(v 4 )), (α(v 4 ), α(v 1 ))} while P 4 has only three edges. Thus the induced subgraph cannot be isomorphic to P 4, which contradicts our initial assumption. (4). To do these problems, it s sufficient to exhibit a cycle of the requisite length that is contained in the corresponding cube graph. (a) The vertices of I 2 are labelled by ordered pairs of 1 s and 0 s and all possible labels occur. Two vertices are adjacent if their labels differ at only a single position. The following cycle is clearly isomorphic to C 4 as, (i) it s a cycle and (ii) it contains 4 distinct vertices. In fact, I 2 is isomorphic to C 4. (00, 10, 11, 01, 00). 2
3 (b) Here a suitable cycle is (000, 100, 110, 010, 011, 111, 101, 001, 000). (c) The cycle here is long, but simply related to the one from part (b): (0000, 1000, 1100, 0100, 0110, 1110, 1010, 0010, 0011, 1011, 1111, 0111, 0101, 1101, 1001, 0001, 0000 ). (5). If you followed the hint in the question, you should have ended up with diagrams like the two below, which are alternative representations of the graphs in the original illustration. u 8 u 6 u 2 v 1 v 5 v 6 v 3 v 7 v 8 u 1 u 4 v 4 v 2 u 5 u 7 u 3 It is clear that the two graphs are not isomorphic and one way to establish this rigorously is to focus on the vertices with degree three. In the graph at left these are u 2, u 4 and u 7 and two of them, u 4 and u 7 are adjacent. In the graph at right there are also three vertices with degree three v 3, v 7 and v 8 and two of them, v 3 and v 8, are adjacent. But v 3 and v 8 are also both adjacent to v 6 and there is no corresponding shared neighbour for u 4 and u 7 on the left. One can use these observations to prove that the graphs aren t isomorphic by contradiction. Suppose there is a suitable bijection α from the vertex set {u 1,..., u 8 } of the graph on the left to the vertex set {v 1,..., v 8 } on the right. Then α would have to map the subset {u 4, u 7 } to the subset {v 3, v 8 } as these are the adjacent vertices of degree three. But if this bijection really established a graph isomorphism, the existence of the edges (v 3, v 6 ) and (v 8, v 6 ) on the right would imply the existence of the edges (α 1 (v 3 ), α 1 (v 6 )) and (α 1 (v 8 ), α 1 (v 6 )) on the left and that would imply the existence of a vertex α 1 (v 6 ) that is adjacent to both u 4 and u 7. No such vertex exists, which contradicts the assumption that α establishes a graph isomorphism and so no such α can exist. The attentive reader will note that the argument above uses, implicitly, the following proposition, that appeared in lecture: Proposition. If G 1 (V 1, E 1 ) and G 2 (V 2, E 2 ) are isomorphic and α : V 1 V 2 is the bijection that establishes the isomorphism, then deg(v) = deg(α(v)) for every v V 1 and deg(u) = deg(α 1 (u)) for every u V 2. 3
4 (6). The basic strategy here is to use the Pigeonhole Principle: we ll show that there are only (n 1) possible values of deg(v) and, as there are n vertices, some value must be shared by at least two vertices. Now, if G(V, E) is a graph with V = n vertices then we know that 0 deg(v) (n 1) for all v V. That is, a vertex can have a minimum of zero neighbours and a maximum of (n 1). This seems to suggest that there are n possible values of deg(v), which would spoil our pigeonhole argument. But a moment s thought shows that the maximal and minimal degrees can t occur in the same graph. If some vertex has degree zero, then all the others have degree at most (n 2). Alternatively, if some vertex has degree (n 1) then it must be adjacent to all the others and so they all have degree at least one. Thus, exactly one of the following three things happens: deg(v) = 0 for two or more vertices. In this case the result we seek is clearly true: the entry 0 is repeated in the degree sequence. deg(v) = 0 for exactly one vertex and 1 deg(u) (n 2) for all the others. But then there are (n 1) vertices with non-zero degree and only (n 2) possible values for their degrees, so some non-zero value must be repeated in the degree sequence. deg(v) > 0 for all v V. In this case we have 1 deg(v) (n 1) for all n vertices and so, as above, some non-zero value must be repeated in the degree sequence. (7). It is possible to construct a proof by induction along the lines of the examples in the answer to Problem??. The key idea is that I d+1 is essentially two copies of I d, glued together. The figure below shows how this works for I 2 and I 3 and suggests a way to use a cycle in I d to construct a cycle in I d I 2 I Expressing the idea in words, we construct a cycle in I 3 by splitting its vertex labels into two groups: those ending in 0 and those ending in 1. Each group has a natural, one-to-one correspondence with the vertex labels in I 2 (just ignore the final digit in the labels from I 3 ). To get the desired cycle in I 3 we traverse the first group 4
5 of vertices in the order suggested by the cycle from I 2 and then jump over to the second group and traverse that in the opposite order. Now we ll develop a recursive algorithm that generates a sequence of vertex labels for a cycle in I d+1, given one for I d, but before we can do this we need a little notation. Let s say that w j,d, where 0 j 2 d, is the label of the j-th vertex in the cycle found in I d. From the answer to the previous question, we could say that w 0,2 = 00 w 1,2 = 01 w 2,2 = 11 w 3,2 = 10 w 4,2 = 00 As we want to build up the vertex labels recursively, we ll also need a notation to indicate concatenation of letters. We ll write w j,k 1 to mean append a 1 on to the end of the string w j,k. Similarly, w j,k 0 means append a 0. Thus, for example, w 1,2 0 = 01 0 = 010 w 1,2 1 = 01 1 = 011 Then define the rest recursively by w j,d 0 If 0 j < 2 d w j,d+1 = w 2 d+1 j 1,d 1 If 2 d j < 2 d+1 w 0,d 0 If j = 2 d+1 5
6 (8). A suitable set with four elements is {1, 2, 3, 4} and we can label the vertices of the graph T 4 with subsets of the form {j, k}. The vertex set is then and the adjacency matrix is {{1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4}} {1, 2} {1, 3} {1, 4} {2, 3} {2, 4} {3, 4} {1, 2} {1, 3} {1, 4} {2, 3} {2, 4} {3, 4} Similar considerations for T 5 lead to the adjacency matrix {1, 2} {1, 3} {1, 4} {1, 5} {2, 3} {2, 4} {2, 5} {3, 4} {3, 5} {4, 5} {1, 2} {1, 3} {1, 4} {1, 5} {2, 3} {2, 4} {2, 5} {3, 4} {3, 5} {4, 5} and to the figure below, which shows T 4 on the left and T 5 on the right. {2,4} {2,4} {1,2} {2,3} {2,5} {2,3} {1,2} {1,4} {1,3} {3,5} {1,5} {1,3} {3,4} {1,4} {4,5} {3,4} (a) The number of vertices in T N is the same as the number of ways to choose two distinct elements from a set of N, which is ( ) N N! N(N 1) = =. 2 2! (N 2)! 2 6
7 (b) Suppose the set and vertex labels are like those used above and consider the vertex {j, k}. There are (N 2) elements in the original set (that is, numbers from {1,..., N}) that are different from both j and k and each such number gives rise to a pair of vertices adjacent to {j, k}. That is, for each i such that i j and i k, we have two distinct adjacent vertices: one corresponding to the subset {i, j} and another corresponding to {i, k}. Thus there are 2(N 2) = 2N 4 vertices adjacent to {j, k} or, equivalently deg({j, k}) = 2N 4. (c) If two vertices are adjacent, their corresponding two-element subsets of {1,..., N} share a member. Let s say that x corresponds to the subset {j 1, k} while y corresponds to {j 2, k}, with j 1 j 2. Now consider those elements of the original set that differ from all three of j 1, j 2 and k and define U = {1,..., N}\{j 1, j 2, k}. There are (N 3) elements in U and each gives rise to a vertex that is adjacent to both x and y: the corresponding subsets are of the form {i, k}. In addition, the vertex corresponding to {j 1, j 2 } is adjacent to both x and y, giving a total of (N 3) + 1 = N 2 common neighbours. (d) If two vertices x and y are not adjacent, then their corresponding two-element subsets have no elements in common. Let s say that x corresponds to {j 1, k 1 } while y corresponds to {j 2, k 2 }, where all four of the numbers j 1, j 2, k 1 and k 2 are distinct. The only way a vertex can be adjacent to both x and y is if its two-element subset shares a member with each of the subsets corresponding to x and y and there are clearly only four ways this can happen: {j 1, j 2 }, {j 1, k 2 }, {k 1, j 2 } and {k 1, k 2 }. 7
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 informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationMC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points
MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you
More informationγ(ɛ) (a, b) (a, d) (d, a) (a, b) (c, d) (d, d) (e, e) (e, a) (e, e) (a) Draw a picture of G.
MAD 3105 Spring 2006 Solutions for Review for Test 2 1. Define a graph G with V (G) = {a, b, c, d, e}, E(G) = {r, s, t, u, v, w, x, y, z} and γ, the function defining the edges, is given by the table ɛ
More informationINTRODUCTION 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 informationCHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
More informationTheorem 3.1 (Berge) A matching M in G is maximum if and only if there is no M- augmenting path.
3 Matchings Hall s Theorem Matching: A matching in G is a subset M E(G) so that no edge in M is a loop, and no two edges in M are incident with a common vertex. A matching M is maximal if there is no matching
More informationK 4 C 5. Figure 4.5: Some well known family of graphs
08 CHAPTER. TOPICS IN CLASSICAL GRAPH THEORY K, K K K, K K, K K, K C C C C 6 6 P P P P P. Graph Operations Figure.: Some well known family of graphs A graph Y = (V,E ) is said to be a subgraph of a graph
More informationMa/CS 6b Class 5: Graph Connectivity
Ma/CS 6b Class 5: Graph Connectivity By Adam Sheffer Communications Network We are given a set of routers and wish to connect pairs of them to obtain a connected communications network. The network should
More informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 2 Solutions February 7, 2013 Introduction to Graph Theory, West Section 1.2: 26, 38, 42 Section 1.3: 14, 18 Section 2.1: 26, 29, 30 DO NOT RE-DISTRIBUTE
More informationBipartite 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 informationCourse Introduction / Review of Fundamentals of Graph Theory
Course Introduction / Review of Fundamentals of Graph Theory Hiroki Sayama sayama@binghamton.edu Rise of Network Science (From Barabasi 2010) 2 Network models Many discrete parts involved Classic mean-field
More information2. CONNECTIVITY Connectivity
2. CONNECTIVITY 70 2. Connectivity 2.1. Connectivity. Definition 2.1.1. (1) A path in a graph G = (V, E) is a sequence of vertices v 0, v 1, v 2,..., v n such that {v i 1, v i } is an edge of G for i =
More informationInfinite locally random graphs
Infinite locally random graphs Pierre Charbit and Alex D. Scott Abstract Motivated by copying models of the web graph, Bonato and Janssen [3] introduced the following simple construction: given a graph
More informationAnswers to specimen paper questions. Most of the answers below go into rather more detail than is really needed. Please let me know of any mistakes.
Answers to specimen paper questions Most of the answers below go into rather more detail than is really needed. Please let me know of any mistakes. Question 1. (a) The degree of a vertex x is the number
More informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 3 Solutions February 14, 2013 Introduction to Graph Theory, West Section 2.1: 37, 62 Section 2.2: 6, 7, 15 Section 2.3: 7, 10, 14 DO NOT RE-DISTRIBUTE
More informationCS473-Algorithms I. Lecture 13-A. Graphs. Cevdet Aykanat - Bilkent University Computer Engineering Department
CS473-Algorithms I Lecture 3-A Graphs Graphs A directed graph (or digraph) G is a pair (V, E), where V is a finite set, and E is a binary relation on V The set V: Vertex set of G The set E: Edge set of
More informationModule 11. Directed Graphs. Contents
Module 11 Directed Graphs Contents 11.1 Basic concepts......................... 256 Underlying graph of a digraph................ 257 Out-degrees and in-degrees.................. 258 Isomorphism..........................
More informationThe Structure of Bull-Free Perfect Graphs
The Structure of Bull-Free Perfect Graphs Maria Chudnovsky and Irena Penev Columbia University, New York, NY 10027 USA May 18, 2012 Abstract The bull is a graph consisting of a triangle and two vertex-disjoint
More informationSection 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected
Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected graph G with at least 2 vertices contains at least 2
More informationLecture 19 Thursday, March 29. Examples of isomorphic, and non-isomorphic graphs will be given in class.
CIS 160 - Spring 2018 (instructor Val Tannen) Lecture 19 Thursday, March 29 GRAPH THEORY Graph isomorphism Definition 19.1 Two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) are isomorphic, write G 1 G
More informationInduction Review. Graphs. EECS 310: Discrete Math Lecture 5 Graph Theory, Matching. Common Graphs. a set of edges or collection of two-elt subsets
EECS 310: Discrete Math Lecture 5 Graph Theory, Matching Reading: MIT OpenCourseWare 6.042 Chapter 5.1-5.2 Induction Review Basic Induction: Want to prove P (n). Prove base case P (1). Prove P (n) P (n+1)
More informationMath 170- Graph Theory Notes
1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory
More informationarxiv: v2 [math.co] 23 Jan 2018
CONNECTIVITY OF CUBICAL POLYTOPES HOA THI BUI, GUILLERMO PINEDA-VILLAVICENCIO, AND JULIEN UGON arxiv:1801.06747v2 [math.co] 23 Jan 2018 Abstract. A cubical polytope is a polytope with all its facets being
More informationAdvanced Combinatorial Optimization September 17, Lecture 3. Sketch some results regarding ear-decompositions and factor-critical graphs.
18.438 Advanced Combinatorial Optimization September 17, 2009 Lecturer: Michel X. Goemans Lecture 3 Scribe: Aleksander Madry ( Based on notes by Robert Kleinberg and Dan Stratila.) In this lecture, we
More informationExtremal Graph Theory: Turán s Theorem
Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-9-07 Extremal Graph Theory: Turán s Theorem Vincent Vascimini
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 9.3: An arithmetic progression is an increasing sequence of numbers of the form a, a+d, a+ d, a + 3d.... Van der Waerden s theorem says that no matter how we partition the natural numbers into
More informationTwo Characterizations of Hypercubes
Two Characterizations of Hypercubes Juhani Nieminen, Matti Peltola and Pasi Ruotsalainen Department of Mathematics, University of Oulu University of Oulu, Faculty of Technology, Mathematics Division, P.O.
More informationby conservation of flow, hence the cancelation. Similarly, we have
Chapter 13: Network Flows and Applications Network: directed graph with source S and target T. Non-negative edge weights represent capacities. Assume no edges into S or out of T. (If necessary, we can
More informationChapter 3: Paths and Cycles
Chapter 3: Paths and Cycles 5 Connectivity 1. Definitions: Walk: finite sequence of edges in which any two consecutive edges are adjacent or identical. (Initial vertex, Final vertex, length) Trail: walk
More informationLecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
More informationMath 485, Graph Theory: Homework #3
Math 485, Graph Theory: Homework #3 Stephen G Simpson Due Monday, October 26, 2009 The assignment consists of Exercises 2129, 2135, 2137, 2218, 238, 2310, 2313, 2314, 2315 in the West textbook, plus the
More informationThe University of Sydney MATH2969/2069. Graph Theory Tutorial 2 (Week 9) 2008
The University of Sydney MATH99/09 Graph Theory Tutorial (Week 9) 00. Show that the graph on the left is Hamiltonian, but that the other two are not. To show that the graph is Hamiltonian, simply find
More informationProblem Set 2 Solutions
Problem Set 2 Solutions Graph Theory 2016 EPFL Frank de Zeeuw & Claudiu Valculescu 1. Prove that the following statements about a graph G are equivalent. - G is a tree; - G is minimally connected (it is
More informationGraphs 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 informationIntroduction 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 informationDefinition 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 informationimplementing the breadth-first search algorithm implementing the depth-first search algorithm
Graph Traversals 1 Graph Traversals representing graphs adjacency matrices and adjacency lists 2 Implementing the Breadth-First and Depth-First Search Algorithms implementing the breadth-first search algorithm
More informationBasic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions
Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationAssignment # 4 Selected Solutions
Assignment # 4 Selected Solutions Problem 2.3.3 Let G be a connected graph which is not a tree (did you notice this is redundant?) and let C be a cycle in G. Prove that the complement of any spanning tree
More informationMatching 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 informationGraph 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 informationMa/CS 6b Class 26: Art Galleries and Politicians
Ma/CS 6b Class 26: Art Galleries and Politicians By Adam Sheffer The Art Gallery Problem Problem. We wish to place security cameras at a gallery, such that they cover it completely. Every camera can cover
More informationIntroduction 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 informationCS2 Algorithms and Data Structures Note 10. Depth-First Search and Topological Sorting
CS2 Algorithms and Data Structures Note 10 Depth-First Search and Topological Sorting In this lecture, we will analyse the running time of DFS and discuss a few applications. 10.1 A recursive implementation
More informationGraphs (MTAT , 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402
Graphs (MTAT.05.080, 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402 homepage: http://courses.cs.ut.ee/2012/graafid (contains slides) For grade: Homework + three tests (during or after
More informationMAT 3271: Selected Solutions to the Assignment 6
Chapter 2: Major Exercises MAT 3271: Selected Solutions to the Assignment 6 1. Since a projective plan is a model of incidence geometry, Incidence Axioms 1-3 and Propositions 2.1-2.5 (which follow logically
More informationSolutions to In-Class Problems Week 4, Fri
Massachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr. Radhika Nagpal Solutions to In-Class Problems Week 4, Fri Definition: The
More informationMaximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube
Maximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube Kavish Gandhi April 4, 2015 Abstract A geodesic in the hypercube is the shortest possible path between two vertices. Leader and Long
More informationFaster parameterized algorithms for Minimum Fill-In
Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender Pinar Heggernes Yngve Villanger Technical Report UU-CS-2008-042 December 2008 Department of Information and Computing Sciences Utrecht
More information5 Matchings in Bipartite Graphs and Their Applications
5 Matchings in Bipartite Graphs and Their Applications 5.1 Matchings Definition 5.1 A matching M in a graph G is a set of edges of G, none of which is a loop, such that no two edges in M have a common
More informationMAL 376: Graph Algorithms I Semester Lecture 1: July 24
MAL 376: Graph Algorithms I Semester 2014-2015 Lecture 1: July 24 Course Coordinator: Prof. B. S. Panda Scribes: Raghuvansh, Himanshu, Mohit, Abhishek Disclaimer: These notes have not been subjected to
More informationCharacterizing 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 informationv V Question: How many edges are there in a graph with 10 vertices each of degree 6?
ECS20 Handout Graphs and Trees March 4, 2015 (updated 3/9) Notion of a graph 1. A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of pairs of elements of V called edges.
More informationMath 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 informationProposition 1. The edges of an even graph can be split (partitioned) into cycles, no two of which have an edge in common.
Math 3116 Dr. Franz Rothe June 5, 2012 08SUM\3116_2012t1.tex Name: Use the back pages for extra space 1 Solution of Test 1.1 Eulerian graphs Proposition 1. The edges of an even graph can be split (partitioned)
More information1 Matchings in Graphs
Matchings in Graphs J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 Definition Two edges are called independent if they are not adjacent
More informationMatching Theory. Figure 1: Is this graph bipartite?
Matching Theory 1 Introduction A matching M of a graph is a subset of E such that no two edges in M share a vertex; edges which have this property are called independent edges. A matching M is said to
More informationCPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60
CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost
More informationThe University of Sydney MATH 2009
The University of Sydney MTH 009 GRPH THEORY Tutorial solutions 00. Show that the graph on the left is Hamiltonian, but that the other two are not. To show that the graph is Hamiltonian, simply find a
More informationDefinition: A graph G = (V, E) is called a tree if G is connected and acyclic. The following theorem captures many important facts about trees.
Tree 1. Trees and their Properties. Spanning trees 3. Minimum Spanning Trees 4. Applications of Minimum Spanning Trees 5. Minimum Spanning Tree Algorithms 1.1 Properties of Trees: Definition: A graph G
More informationDischarging 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 informationHW Graph Theory SOLUTIONS (hbovik)
Diestel 1.3: Let G be a graph containing a cycle C, and assume that G contains a path P of length at least k between two vertices of C. Show that G contains a cycle of length at least k. If C has length
More informationLecture 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 informationExtremal functions for rooted minors
Extremal functions for rooted minors Paul Wollan Abstract The graph G contains a graph H as a minor if there exist pair-wise disjoint sets {S i V (G) i = 1,..., V (H) } such that for every i, G[S i] is
More informationChordal deletion is fixed-parameter tractable
Chordal deletion is fixed-parameter tractable Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de Abstract. It
More informationCMSC 380. Graph Terminology and Representation
CMSC 380 Graph Terminology and Representation GRAPH BASICS 2 Basic Graph Definitions n A graph G = (V,E) consists of a finite set of vertices, V, and a finite set of edges, E. n Each edge is a pair (v,w)
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationModules. 6 Hamilton Graphs (4-8 lectures) Introduction Necessary conditions and sufficient conditions Exercises...
Modules 6 Hamilton Graphs (4-8 lectures) 135 6.1 Introduction................................ 136 6.2 Necessary conditions and sufficient conditions............. 137 Exercises..................................
More informationNorth Bank. West Island. East Island. South Bank
Lecture 11 Eulerian Multigraphs This section of the notes revisits the Königsberg Bridge Problem and generalises it to explore Eulerian multigraphs: those that contain a closed walk that traverses every
More informationTrees. 3. (Minimally Connected) G is connected and deleting any of its edges gives rise to a disconnected graph.
Trees 1 Introduction Trees are very special kind of (undirected) graphs. Formally speaking, a tree is a connected graph that is acyclic. 1 This definition has some drawbacks: given a graph it is not trivial
More informationMath 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 informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationGraph Theory Questions from Past Papers
Graph Theory Questions from Past Papers Bilkent University, Laurence Barker, 19 October 2017 Do not forget to justify your answers in terms which could be understood by people who know the background theory
More informationDiscrete Mathematics I So Practice Sheet Solutions 1
Discrete Mathematics I So 2016 Tibor Szabó Shagnik Das Practice Sheet Solutions 1 Provided below are possible solutions to the questions from the practice sheet issued towards the end of the course. Exercise
More informationLemma. Let G be a graph and e an edge of G. Then e is a bridge of G if and only if e does not lie in any cycle of G.
Lemma. Let G be a graph and e an edge of G. Then e is a bridge of G if and only if e does not lie in any cycle of G. Lemma. If e = xy is a bridge of the connected graph G, then G e consists of exactly
More informationThe Resolution Algorithm
The Resolution Algorithm Introduction In this lecture we introduce the Resolution algorithm for solving instances of the NP-complete CNF- SAT decision problem. Although the algorithm does not run in polynomial
More informationV10 Metabolic networks - Graph connectivity
V10 Metabolic networks - Graph connectivity Graph connectivity is related to analyzing biological networks for - finding cliques - edge betweenness - modular decomposition that have been or will be covered
More informationTHE LINEAR CHROMATIC NUMBER OF A GRAPH
THE LINEAR CHROMATIC NUMBER OF A GRAPH DANIEL CAPRONI, JOSHUA EDGERTON, MARGARET RAHMOELLER, MYCHAEL SANCHEZ, ANNA TRACY Abstract. We study linear colorings and the linear chromatic number of graphs and
More informationThe Graphs of Triangulations of Polygons
The Graphs of Triangulations of Polygons Matthew O Meara Research Experience for Undergraduates Summer 006 Basic Considerations Let Γ(n) be the graph with vertices being the labeled planar triangulation
More informationOn the Convexity Number of Graphs
On the Convexity Number of Graphs Mitre C. Dourado 1, Fábio Protti, Dieter Rautenbach 3, and Jayme L. Szwarcfiter 4 1 ICE, Universidade Federal Rural do Rio de Janeiro and NCE - UFRJ, Brazil, email: mitre@nce.ufrj.br
More informationMath.3336: Discrete Mathematics. Chapter 10 Graph Theory
Math.3336: Discrete Mathematics Chapter 10 Graph Theory Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
More informationFOUR EDGE-INDEPENDENT SPANNING TREES 1
FOUR EDGE-INDEPENDENT SPANNING TREES 1 Alexander Hoyer and Robin Thomas School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT We prove an ear-decomposition theorem
More informationLecture 4: Walks, Trails, Paths and Connectivity
Lecture 4: Walks, Trails, Paths and Connectivity Rosa Orellana Math 38 April 6, 2015 Graph Decompositions Def: A decomposition of a graph is a list of subgraphs such that each edge appears in exactly one
More informationGraph theory - solutions to problem set 1
Graph theory - solutions to problem set 1 1. (a) Is C n a subgraph of K n? Exercises (b) For what values of n and m is K n,n a subgraph of K m? (c) For what n is C n a subgraph of K n,n? (a) Yes! (you
More informationThis is not the chapter you re looking for [handwave]
Chapter 4 This is not the chapter you re looking for [handwave] The plan of this course was to have 4 parts, and the fourth part would be half on analyzing random graphs, and looking at different models,
More information8.2 Paths and Cycles
8.2 Paths and Cycles Degree a b c d e f Definition The degree of a vertex is the number of edges incident to it. A loop contributes 2 to the degree of the vertex. (G) is the maximum degree of G. δ(g) is
More informationAbstract. 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 informationCartesian Products of Graphs and Metric Spaces
Europ. J. Combinatorics (2000) 21, 847 851 Article No. 10.1006/eujc.2000.0401 Available online at http://www.idealibrary.com on Cartesian Products of Graphs and Metric Spaces S. AVGUSTINOVICH AND D. FON-DER-FLAASS
More informationGraph Connectivity G G G
Graph Connectivity 1 Introduction We have seen that trees are minimally connected graphs, i.e., deleting any edge of the tree gives us a disconnected graph. What makes trees so susceptible to edge deletions?
More informationCLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN
CLAW-FREE 3-CONNECTED P 11 -FREE GRAPHS ARE HAMILTONIAN TOMASZ LUCZAK AND FLORIAN PFENDER Abstract. We show that every 3-connected claw-free graph which contains no induced copy of P 11 is hamiltonian.
More informationDescription of grading scheme and advice for final exam (and HW, quizzes, etc).
The median for this midterm was 72.25. This isn t bad considering how many of you did not know definitions. I expect grades to improve on the final exam if you learn definitions (make flashcards) and follow
More informationBasic Graph Theory with Applications to Economics
Basic Graph Theory with Applications to Economics Debasis Mishra February, 0 What is a Graph? Let N = {,..., n} be a finite set. Let E be a collection of ordered or unordered pairs of distinct elements
More information8 Matroid Intersection
8 Matroid Intersection 8.1 Definition and examples 8.2 Matroid Intersection Algorithm 8.1 Definitions Given two matroids M 1 = (X, I 1 ) and M 2 = (X, I 2 ) on the same set X, their intersection is M 1
More informationFaster parameterized algorithms for Minimum Fill-In
Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender Pinar Heggernes Yngve Villanger Abstract We present two parameterized algorithms for the Minimum Fill-In problem, also known as Chordal
More informationParameterized graph separation problems
Parameterized graph separation problems Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary, dmarx@cs.bme.hu Abstract.
More informationMath 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 informationModule 7. Independent sets, coverings. and matchings. Contents
Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................
More information2. Lecture notes on non-bipartite matching
Massachusetts Institute of Technology 18.433: Combinatorial Optimization Michel X. Goemans February 15th, 013. Lecture notes on non-bipartite matching Given a graph G = (V, E), we are interested in finding
More information