Graph Theory Problems and Solutions

Save this PDF as:

Size: px
Start display at page:

Transcription

1 raph Theory Problems and Solutions Tom Davis November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is even.. Show that every simple graph has two vertices of the same degree.. Show that if n people attend a party and some shake hands with others (but not with themselves), then at the end, there are at least two people who have shaken hands with the same number of people.. Prove that a complete graph with n vertices contains n(n )/ edges. 5. Prove that a finite graph is bipartite if and only if it contains no cycles of odd length. 6. Show that if every component of a graph is bipartite, then the graph is bipartite. 7. Prove that if u is a vertex of odd degree in a graph, then there exists a path from u to another vertex v of the graph where v also has odd degree. 8. If the distance d(u, v) between two vertices u and v that can be connected by a path in a graph is defined to be the length of the shortest path connecting them, then prove that the distance function satisfies the triangle inequality: d(u, v) + d(v, w) d(u, w). 9. Show that any graph where the degree of every vertex is even has an Eulerian cycle. Show that if there are exactly two vertices a and b of odd degree, there is an Eulerian path from a to b. Show that if there are more than two vertices of odd degree, it is impossible to construct an Eulerian path. 0. Show that in a directed graph where every vertex has the same number of incoming as outgoing paths there exists an Eulerian path for the graph.. Consider the sequence 0000 as being arranged in a circular pattern. Notice that every one of the eight possible binary triples: 000, 00, 0,..., appear exactly once in the circular list. Can you construct a similar list of length 6 where all the four binary digit patterns appear exactly once each? Of length where all five binary digit patterns appear exactly once?. An n-cube is a cube in n dimensions. A cube in one dimension is a line segment; in two dimensions, it s a square, in three, a normal cube, and in general, to go to the next dimension, a copy of the cube is made and all corresponding vertices are connected. If we consider

2 the cube to be composed of the vertices and edges only, show that every n-cube has a Hamiltonian circuit.. Show that a tree with n vertices has exactly n edges.. If u and v are two vertices of a tree, show that there is a unique path connecting them. 5. Show that any tree with at least two vertices is bipartite. 6. Solve Instant Insanity. Figure : Instant Insanity locks Figure shows four unwrapped cubes that form the instant insanity puzzle. The letters,, and stand for the colors red, white, blue and green. The object of the puzzle is to stack the blocks in a pile of in such a way that each of the colors appears exactly once on each of the four sides of the stack. 7. (The Schröder-ernstein Theorem) Show that if set A can be mapped onto a subset of and can be mapped onto a subset of A, then sets A and have the same cardinality. (Two sets have the same cardinality if there exists a and onto mapping between them.)

3 Solutions. Prove that the sum of the degrees of the vertices of any finite graph is even. Proof: Each edge ends at two vertices. If we begin with just the vertices and no edges, every vertex has degree zero, so the sum of those degrees is zero, an even number. Now add edges one at a time, each of which connects one vertex to another, or connects a vertex to itself (if you allow that). Either the degree of two vertices is increased by one (for a total of two) or one vertex s degree is increased by two. In either case, the sum of the degrees is increased by two, so the sum remains even.. Show that every simple finite graph has two vertices of the same degree. Proof: This can be shown using the pigeon hole principle. Assume that the graph has n vertices. Each of those vertices is connected to either 0,,,..., n other vertices. If any of the vertices is connected to n vertices, then it is connected to all the others, so there cannot be a vertex connected to 0 others. Thus it is impossible to have a graph with n vertices where one is vertex has degree 0 and another has degree n. Thus the vertices can have at most n different degrees, but since there are n vertices, at least two must have the same degree.. Show that if n people attend a party and some shake hands with others (but not with themselves), then at the end, there are at least two people who have shaken hands with the same number of people. Proof: See problem. Each person is a vertex, and a handshake with another person is an edge to that person.. Prove that a complete graph with n vertices contains n(n )/ edges. Proof: This is easy to prove by induction. If n =, zero edges are required, and ( 0)/ = 0. Assume that a complete graph with k vertices has k(k )/. hen we add the (k + ) st vertex, we need to connect it to the k original vertices, requiring k additional edges. e will then have k(k )/ + k = (k + )((k + ) )/ vertices, and we are done. 5. Prove that a finite graph is bipartite if and only if it contains no cycles of odd length. Proof: To show that a graph is bipartite, we need to show that we can divide its vertices into two subsets A and such that every edge in the graph connects a vertex in set A to a vertex in set. Proceed as follows: Choose any vertex from the graph and put it in set A. Follow every edge from that vertex and put all vertices at the other end in set. Erase all the vertices you used. Now for every vertex in, follow all edges from each and put the vertices on the other end in A, erasing all the vertices you used. Alternate back and forth in this manner until you cannot proceed. This process cannot encounter a vertex that is already in one set that needs to be moved to the other, since if it did, that would represent an odd number of steps from it to itself, so there would be a cycle of odd length. If the graph is not connected, there may still be vertices that have not been assigned. epeat the process in the previous paragraph until all vertices are assigned either to set A or to set.

4 There is no reason that the graph has to be finite for this argument to work, but the proof does have to be modified slightly, and probably requires the axiom of choice to proove: divide the graph into connected components and select a vertex from each component and put it in set A. Then use the same process as above. The select a vertex from each component requires the axiom of choice. 6. Show that if every component of a graph is bipartite, then the graph is bipartite. Proof: If the components are divided into sets A and, A and, et cetera, then let A = i A i and = i i. 7. Prove that if u is a vertex of odd degree in a graph, then there exists a path from u to another vertex v of the graph where v also has odd degree. Proof: e will build a path that does not reuse any edges. As we build the path, imagine erasing the edge we used to leave so that we will not use it again. egin at vertex u and select an arbitrary path away from it. This will be the first component of the path. If, at any point, the path reaches a vertex of odd degree, we will be done, but each time we arrive at a vertex of even degree, we are guaranteed that there is another vertex out, and, having left, we effectively erase two edges from that meet at the vertex. Since the vertex originally was of even degree, coming in and going out reduces its degree by two, so it remains even. In this way, there is always a way to continue when we arrive at a vertex of even degree. Since there are only a finite number of edges, the tour must end eventually, and the only way it can end is if we arrive at a vertex of odd degree. 8. If the distance d(u, v) between two vertices u and v that can be connected by a path in a graph is defined to be the length of the shortest path connecting them, then prove that the distance function satisfies the triangle inequality: d(u, v) + d(v, w) d(u, w). Proof: If you simply connect the paths from u to v to the path connecting v to w you will have a valid path of length d(u, v) + d(v, w). Since we are looking for the path of minimal length, if there is a shorter path it will be shorter than this one, so the triangle inequality will be satisfied. 9. Show that any graph where the degree of every vertex is even has an Eulerian cycle. Show that if there are exactly two vertices a and b of odd degree, there is an Eulerian path from a to b. Show that if there are more than two vertices of odd degree, it is impossible to construct an Eulerian path. Proof: One way to prove this is by induction on the number of vertices. e will first solve the problem in the case that there are two vertices of odd degree. (If all vertices have even degree, temporarily remove some edge in the graph between vertices a and b and then a and b will have odd degree. Find the path from a to b which we will show how to do below, and then follow the removed edge from b back to a to make a cycle.) Suppose the odd-degree vertices are a and b. egin at a and follow edges from one vertex to the next, crossing off edges so that you won t use them again until you arrive at vertex b and you have used all the vertices into b. hy is it certain that you will eventually arrive at b? ell, suppose that you don t. How could this happen? After you leave a, if you arrive at a vertex that is not b, there were, before you arrived, an even number of unused edges leading into it. That means that when you arrive, there is guaranteed to be an unused path away from that vertex, so you can continue your route. After entering and leaving a vertex, you reduce the number of edges by, so the vertex remains one with an even number (possibly zero)

5 of unused paths. So if you have not yet arrived at vertex b, you can never get stuck at any other vertex, since there s always a way out. Since the graph is finite, you cannot continue forever, so eventually you will have to arrive at vertex b. (And it has to be possible to get to vertex b since the graph is connected.) Note that a similar argument can be used to show that you can wait until you have used all the edges connecting to b. If b has more than one edge, leave each time you arrive until you get stuck at b. Now you have a path something like this: (a, a, a,..., a n, b) leading from a to b. If all the edges are used in this path, you are done. If not, imagine that you have erased all the edges that you used. hat remains will be a number of components of the graph (perhaps only one) where all the members of each component have even degree. Since b will not be in any of the components, all of them must have fewer vertices than the original graph. 0. Show that in a directed graph where every vertex has the same number of incoming as outgoing paths there exists an Eulerian path for the graph. Proof: The proof above works basically without change. Note that each time a vertex is visited, one incoming and one outgoing node is used, so the equality of incoming and outgoing edges is preserved.. Consider the sequence 0000 as being arranged in a circular pattern. Notice that every one of the eight possible binary triples: 000, 00, 0,..., appear exactly once in the circular list. Can you construct a similar list of length 6 where all the four binary digit patterns appear exactly once each? Of length where all five binary digit patterns appear exactly once? Figure : Circular inary Patterns Proof: Consider the figure. It is a graph with four vertices, each labeled with one of the possible pairs of binary digits. Imagine that each represents the last two digits in the pattern so far. The arrows leading away from a vertex are labeled either 0 or : the two possible values for the next digit that can be added to the pattern, and the ends of the arrows indicate the new final two digits. To achieve every possible three-digit combination, we need to traverse the graph with an Eulerian cycle. ecause of the result in the previous problem, there are always two arrows out and two arrows into each vertex, and because of the result in the previous problem, there must be an Eulerian circuit. 5

6 The situation is the same for any number of digits except that the graph will become more and more complex. For the -digit version, there will be 8 vertices and 6 edges, and so on. ut in every case, there will be two edges entering and two leaving each vertex, so an Eulerian circuit is possible.. An n-cube is a cube in n dimensions. A cube in one dimension is a line segment; in two dimensions, it s a square, in three, a normal cube, and in general, to go to the next dimension, a copy of the cube is made and all corresponding vertices are connected. If we consider the cube to be composed of the vertices and edges only, show that every n-cube has a Hamiltonian circuit. Proof: The proof is easy, and can be done by induction. If n =, we simply need to visit each vertex of a two-vertex graph with an edge connecting them. Assume that it s true for n = k. To build a (k + )-cube, we take two copies of the k-cube and connect the corresponding edges. Take the Hamiltonian circuit on one cube and reverse it on the other. Then choose an edge on one that is part of the circuit and the corresponding edge on the other and delete them from the circuit. Finally, add to the path connections from the corresponding endpoints on the cubes which will produce a circuit on the (k + )-cube.. Show that a tree with n vertices has exactly n edges. Proof: e can prove this by induction. If n =, the graph cannot have any edges or there would be a loop, with the vertex connecting to itself, so there must be n = 0 edges. Suppose that every tree with k vertices has precisely k edges. If the tree T contains k + vertices, we will show that it contains a vertex with a single edge connected to it. If not, start at any vertex, and start following edges marking each vertex as we pass it. If we ever come to a marked vertex, there is a loop in the edges which is impossible. ut since each vertex is assumed to have more than one vertex coming out, there is never a reason that we have to stop at one, so we much eventually encounter a marked vertex, which is a contradiction. Take the vertex with a single edge connecting to it, and delete it and its edge from the tree T. The new graph T will have k vertices. It must be connected, since the only thing we lopped off was a vertex that was not connected to anything else, and all other vertices must be connected. If there were no loops before, removing an edge certainly cannot produce a loop, so T is a tree. y the induction hypothesis, T has k edges. ut to convert T to T we need to add one edge and one vertex, so T also satisfies the formula.. If u and v are two vertices of a tree, show that there is a unique path connecting them. Since it s a tree, it is connected, and therefore there has to be at least one path connecting u and v. Suppose there are two different paths P and Q connecting u to v. everse Q to make a path Q leading from v to u, and the path made by concatenating P and Q leads from u back to itself. Now this path P Q is not necessarily be a loop, since it may use some of the same edges in both directions, but we did assume that there are some differences between P and Q. e can, from P Q, generate a simple loop. egin at u and continue back one node at a time until the paths P and Q differ. (Of course they may differ right away.) At this point, the paths bifurcate. Continue along both paths of the bifurcation until they join again for the first time, and this must occur eventually, since we know they are joined at the end. The two fragments of P and Q form a (possibly) smaller circuit in the tree, which is impossible. 6

7 5. Show that any tree with at least two vertices is bipartite. Proof: This is a trivial consequence of problem 5. A tree has no cycles, so it certainly does not contain any cycles of odd length. 6. Solve Instant Insanity. Figure : Instant Insanity locks Figure shows four unwrapped cubes that form the instant insanity puzzle. The letters,, and stand for the colors red, white, blue and green. The object of the puzzle is to stack the blocks in a pile of in such a way that each of the colors appears exactly once on each of the four sides of the stack. Solution: Any cube can have any pair of opposite faces appear on opposite sides of the stack of four. y turning the cube upside-down, the clockwise-counterclockwise orientation of those faces can be flipped, if necessary. Figure : Individual Cube raphs For each cube, we ll draw a graph connecting the pairs of colors on opposite faces, so each cube s graph will consist of four vertices, corresponding to the four possible colors, and three edges that correspond to the pairs of colors that are opposite each other on each different cube. All of the four graphs are illustrated in figure. Next, combine all sets of graph edges using the same set of four vertices, but retain the labels on the edges so that we obtain the graph in figure 5, which includes multiple connections between some pairs of vertices. 7

8 Figure 5: Combined Cube raphs To solve instant insanity, we need to find two subgraphs, each of which uses all four nodes, and each of which uses one each of the four numbered vertices. Each node must have exactly two of the edges coming from it. A little experimentation indicates that there is only one way to do this, and it is illustrated in figure 6. Figure 6: Instant Insanity Solution If we align the front and back faces of the cube as mandated by the graph on the left of figure 6 and the left and right faces as mandated by the graph on the right of that figure then stack them on the top and bottom faces, we will obtain the unique solution. 7. (The Schröder-ernstein Theorem) Show that if set A can be mapped onto a subset of and can be mapped onto a subset of A, then sets A and have the same cardinality. (Two sets have the same cardinality if there exists a and onto mapping between them.) Proof: hat we d like to prove is that if the function f : A is an injection from A into and if g : A is an injection from set into A, then we can find a bijection h : A mapping A and onto. raph theory provides a nice way to visualize the proof. Imagine drawing a horizontal line and placing a vertex (dot) for every element of set A above the line and a vertex for every element of below the line. Next, for every element a A, draw a blue arrow from a to f(a). All of these blue arrows will go down. Similarly, for every element b, draw a red arrow from b to g(b). All the red arrows will go up. For those who know about sets of large cardinality, it is clear that this may be impossible, since the sets will have more elements than there are points of a plane, but for visualization purposes, this is not a bad way to think about what s going on. 8

9 Since f and g are injections, it s clear that every a A will have a blue arrow going down from it to some element in, and similarly, every b will have a red arrow coming up from it. ut since f and g are merely injections, it is not necessarily the case that every a A will have a red arrow coming up into it, and similarly, there may be elements b that have no blue arrows going down into them. Figure 7: The Schröder-ernstein Theorem If we look at the situations that can occur, there are really only four possibilities, all of which are illustrated in Figure 7. The four horizontal lines in the figure are meant to represent different parts of the one horizonal line with the vertices representing elements of A above and elements of below. Imagine starting at any vertex in set A. It will surely have a line connecting it down to a vertex in. Then that one will have a line going up to A, then down to, then up to A, and on and on. Now, either it continues forever, or it loops back to the initial element in A. It cannot come back to any other element in the chain, or there would be two arrows coming to that point, violating the injectiveness of g. If it s a closed loop, it looks like the bottom example in Figure 7. If it goes on forever without looping, then look at the vertex in A that we started with. If nothing points to it, we obtain a situation like that in the second line in the figure. If something points to it, keep looking back either until it continues forever (as in the top illustration), or until it halts either with an element of A or. If we start with any element in, we can just do exactly the same thing and again, we ll obtain one of the four situations above: a finite loop, a semi-infinite chain beginning with an element of A, a semi-infinite chain beginning with an element of, or a doubly-infinite chain. Note that every element of A and lies in a chain of one of these four types. From the figure, it is easy to construct a bijective function h : A as follows. If the element a A is in a chain like the first, second, or fourth lines in Figure 7, then h(a) = f(a). If a s chain is like that in the third line, then h(a) = g (a). 9

136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

Combinatorics: The Fine Art of Counting

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

CMSC 451: Graph Properties, DFS, BFS, etc.

CMSC 451: Graph Properties, DFS, BFS, etc. Slides By: Carl Kingsford Department of Computer Science University of Maryland, College Park Based on Chapter 3 of Algorithm Design by Kleinberg & Tardos. Graphs

5. GRAPHS ON SURFACES

. GRPHS ON SURCS.. Graphs graph, by itself, is a combinatorial object rather than a topological one. But when we relate a graph to a surface through the process of embedding we move into the realm of topology.

Induction Problems. Tom Davis November 7, 2005

Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily

COLORED GRAPHS AND THEIR PROPERTIES

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

Notes on polyhedra and 3-dimensional geometry

Notes on polyhedra and 3-dimensional geometry Judith Roitman / Jeremy Martin April 23, 2013 1 Polyhedra Three-dimensional geometry is a very rich field; this is just a little taste of it. Our main protagonist

2.3 Scheduling jobs on identical parallel machines

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

Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS

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

DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

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

Introduction to Graph Theory

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

Chapter 4. Trees. 4.1 Basics

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

Euler Paths and Euler Circuits

Euler Paths and Euler Circuits An Euler path is a path that uses every edge of a graph exactly once. An Euler circuit is a circuit that uses every edge of a graph exactly once. An Euler path starts and

Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

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

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

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

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

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

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

Homework 15 Solutions

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

Midterm Practice Problems

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

Solutions to Exercises 8

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

HOMEWORK #3 SOLUTIONS - MATH 3260

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

Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College

Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1

/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry

600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry 2.1 Steiner Tree Definition 2.1.1 In the Steiner Tree problem the input

Principle of (Weak) Mathematical Induction. P(1) ( n 1)(P(n) P(n + 1)) ( n 1)(P(n))

Outline We will cover (over the next few weeks) Mathematical Induction (or Weak Induction) Strong (Mathematical) Induction Constructive Induction Structural Induction Principle of (Weak) Mathematical Induction

Induction and the Division Theorem 2.1 The Method of Induction

2 Induction and the Division Theorem 2.1 The Method of Induction In the Introduction we discussed a mathematical problem whose solution required the verification of an infinite family of statements. We

diffy boxes (iterations of the ducci four number game) 1

diffy boxes (iterations of the ducci four number game) 1 Peter Trapa September 27, 2006 Begin at the beginning and go on till you come to the end: then stop. Lewis Carroll Consider the following game.

The origins of graph theory are humble, even frivolous. Biggs, E. K. Lloyd, and R. J. Wilson)

Chapter 11 Graph Theory The origins of graph theory are humble, even frivolous. Biggs, E. K. Lloyd, and R. J. Wilson) (N. Let us start with a formal definition of what is a graph. Definition 72. A graph

Permutation Groups. Rubik s Cube

Permutation Groups and Rubik s Cube Tom Davis tomrdavis@earthlink.net May 6, 2000 Abstract In this paper we ll discuss permutations (rearrangements of objects), how to combine them, and how to construct

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

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

Sample Problems in Discrete Mathematics

Sample Problems in Discrete Mathematics This handout lists some sample problems that you should be able to solve as a pre-requisite to Computer Algorithms Try to solve all of them You should also read

1 Basic Definitions and Concepts in Graph Theory

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

Mathematical Induction. Mary Barnes Sue Gordon

Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by

Lecture 4: The Chromatic Number

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

Fall 2015 Midterm 1 24/09/15 Time Limit: 80 Minutes

Math 340 Fall 2015 Midterm 1 24/09/15 Time Limit: 80 Minutes Name (Print): This exam contains 6 pages (including this cover page) and 5 problems. Enter all requested information on the top of this page,

Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique

Planarity Planarity

Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?

Introduction to the Mathematics of Zome

Introduction to the Mathematics of Zome Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles July 1, 008 Abstract This article provides a gentle introduction to the Mathematics of Zome,

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

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

Chapter 6: Colouring Graphs

17 Coloring Vertices Chapter 6: Colouring Graphs 1. Sections 17-19: Qualitative (Can we color a graph with given colors?) Section 20: Quantitative (How many ways can the coloring be done?) 2. Definitions:

CMPSCI611: Approximating MAX-CUT Lecture 20

CMPSCI611: Approximating MAX-CUT Lecture 20 For the next two lectures we ll be seeing examples of approximation algorithms for interesting NP-hard problems. Today we consider MAX-CUT, which we proved to

Pigeonhole Principle Solutions

Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such

Lecture 3. Mathematical Induction

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

Direct Proofs. CS 19: Discrete Mathematics. Direct Proof: Example. Indirect Proof: Example. Proofs by Contradiction and by Mathematical Induction

Direct Proofs CS 19: Discrete Mathematics Amit Chakrabarti Proofs by Contradiction and by Mathematical Induction At this point, we have seen a few examples of mathematical proofs. These have the following

Graph Theory. Directed and undirected graphs make useful mental models for many situations. These objects are loosely defined as follows:

Graph Theory Directed and undirected graphs make useful mental models for many situations. These objects are loosely defined as follows: Definition An undirected graph is a (finite) set of nodes, some

6. GRAPH AND MAP COLOURING

6. GRPH ND MP COLOURING 6.1. Graph Colouring Imagine the task of designing a school timetable. If we ignore the complications of having to find rooms and teachers for the classes we could propose the following

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

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

LESSON 1 PRIME NUMBERS AND FACTORISATION

LESSON 1 PRIME NUMBERS AND FACTORISATION 1.1 FACTORS: The natural numbers are the numbers 1,, 3, 4,. The integers are the naturals numbers together with 0 and the negative integers. That is the integers

Math 443/543 Graph Theory Notes 4: Connector Problems

Math 443/543 Graph Theory Notes 4: Connector Problems David Glickenstein September 19, 2012 1 Trees and the Minimal Connector Problem Here is the problem: Suppose we have a collection of cities which we

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

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

1. Relevant standard graph theory

Color identical pairs in 4-chromatic graphs Asbjørn Brændeland I argue that, given a 4-chromatic graph G and a pair of vertices {u, v} in G, if the color of u equals the color of v in every 4-coloring

V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer

Graphs and Network Flows IE411 Lecture 1

Graphs and Network Flows IE411 Lecture 1 Dr. Ted Ralphs IE411 Lecture 1 1 References for Today s Lecture Required reading Sections 17.1, 19.1 References AMO Chapter 1 and Section 2.1 and 2.2 IE411 Lecture

Connectivity and cuts

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )

1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the

3. Eulerian and Hamiltonian Graphs

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

It is not immediately obvious that this should even give an integer. Since 1 < 1 5

Math 163 - Introductory Seminar Lehigh University Spring 8 Notes on Fibonacci numbers, binomial coefficients and mathematical induction These are mostly notes from a previous class and thus include some

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

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

CHAPTER 2 GRAPHS F G C D

page 1 of Section 2.1 HPTR 2 GRPHS STION 1 INTROUTION basic terminology graph is a set of finitely many points called vertices which may be connected by edges. igs 1 3 show three assorted graphs. v1 v2

Unit 6 Geometry: Constructing Triangles and Scale Drawings

Unit 6 Geometry: Constructing Triangles and Scale Drawings Introduction In this unit, students will construct triangles from three measures of sides and/or angles, and will decide whether given conditions

Chapter 4: Trees. 2. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:

9 Properties of Trees. Definitions: Chapter 4: Trees forest - a graph that contains no cycles tree - a connected forest. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:

3. Mathematical Induction

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

Planar Graph and Trees

Dr. Nahid Sultana December 16, 2012 Tree Spanning Trees Minimum Spanning Trees Maps and Regions Eulers Formula Nonplanar graph Dual Maps and the Four Color Theorem Tree Spanning Trees Minimum Spanning

MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

Spring 2007 Math 510 Hints for practice problems

Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an -chessboard There are doors between all adjacent cells A prisoner in one

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

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

The edge slide graph of the n-dimensional cube

The edge slide graph of the n-dimensional cube Howida AL Fran Institute of Fundamental Sciences Massey University, Manawatu 8th Australia New Zealand Mathematics Convention December 2014 Howida AL Fran

Theory of Impartial Games

Theory of Impartial Games February 3, 2009 Introduction Kinds of Games We ll Discuss Much of the game theory we will talk about will be on combinatorial games which have the following properties: There

Chapter 6: Graph Theory

Chapter 6: Graph Theory Graph theory deals with routing and network problems and if it is possible to find a best route, whether that means the least expensive, least amount of time or the least distance.

New Zealand Mathematical Olympiad Committee. Induction

New Zealand Mathematical Olympiad Committee Induction Chris Tuffley 1 Proof by dominoes Mathematical induction is a useful tool for proving statements like P is true for all natural numbers n, for example

Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing:

1. GRAPHS AND COLORINGS Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing: 3 vertices 3 edges 4 vertices 4 edges 4 vertices 6 edges A graph

1. What s wrong with the following proofs by induction?

ArsDigita University Month : Discrete Mathematics - Professor Shai Simonson Problem Set 4 Induction and Recurrence Equations Thanks to Jeffrey Radcliffe and Joe Rizzo for many of the solutions. Pasted

each college c i C has a capacity q i - the maximum number of students it will admit

n colleges in a set C, m applicants in a set A, where m is much larger than n. each college c i C has a capacity q i - the maximum number of students it will admit each college c i has a strict order i

6.3 Conditional Probability and Independence

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

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

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

GRAPH THEORY LECTURE 4: TREES

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

3. Recurrence Recursive Definitions. To construct a recursively defined function:

3. RECURRENCE 10 3. Recurrence 3.1. Recursive Definitions. To construct a recursively defined function: 1. Initial Condition(s) (or basis): Prescribe initial value(s) of the function.. Recursion: Use a

Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

SAMPLES OF HIGHER RATED WRITING: LAB 5

SAMPLES OF HIGHER RATED WRITING: LAB 5 1. Task Description Lab report 5. (April 14) Graph Coloring. Following the guidelines, and keeping in mind the assessment criteria, using where appropriate experimental

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

Discrete Mathematics, Chapter 5: Induction and Recursion

Discrete Mathematics, Chapter 5: Induction and Recursion Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 5 1 / 20 Outline 1 Well-founded

ROUNDTRIP PUZZLES. Extended Introduction with solving strategies. by Glenn A. Iba

Introduction & Background ROUNDTRIP PUZZLES Extended Introduction with solving strategies by Glenn A. Iba RoundTrip puzzles first appeared in Dell Magazines in the early 1990's. They were invented by a

10. Graph Matrices Incidence Matrix

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

TREES IN SET THEORY SPENCER UNGER

TREES IN SET THEORY SPENCER UNGER 1. Introduction Although I was unaware of it while writing the first two talks, my talks in the graduate student seminar have formed a coherent series. This talk can be

(Knight) 3 : A Graphical Perspective of the Knight's Tour on a Multi-Layered Chess Board

Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-2-2016 (Knight) 3 : A Graphical Perspective of the Knight's

Euclidean Geometry. We start with the idea of an axiomatic system. An axiomatic system has four parts:

Euclidean Geometry Students are often so challenged by the details of Euclidean geometry that they miss the rich structure of the subject. We give an overview of a piece of this structure below. We start

An Interesting Way to Combine Numbers

An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis November 28, 2007 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly

1 Introduction to Counting

1 Introduction to Counting 1.1 Introduction In this chapter you will learn the fundamentals of enumerative combinatorics, the branch of mathematics concerned with counting. While enumeration problems can

Permutation Groups. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003

Permutation Groups Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003 Abstract This paper describes permutations (rearrangements of objects): how to combine them, and how

(Vertex) Colorings. We can properly color W 6 with. colors and no fewer. Of interest: What is the fewest colors necessary to properly color G?

Vertex Coloring 2.1 33 (Vertex) Colorings Definition: A coloring of a graph G is a labeling of the vertices of G with colors. [Technically, it is a function f : V (G) {1, 2,...,l}.] Definition: A proper

Chapter 6 Planarity. Section 6.1 Euler s Formula

Chapter 6 Planarity Section 6.1 Euler s Formula In Chapter 1 we introduced the puzzle of the three houses and the three utilities. The problem was to determine if we could connect each of the three utilities

This puzzle is based on the following anecdote concerning a Hungarian sociologist and his observations of circles of friends among children.

0.1 Friend Trends This puzzle is based on the following anecdote concerning a Hungarian sociologist and his observations of circles of friends among children. In the 1950s, a Hungarian sociologist S. Szalai

Homework Exam 1, Geometric Algorithms, 2016

Homework Exam 1, Geometric Algorithms, 2016 1. (3 points) Let P be a convex polyhedron in 3-dimensional space. The boundary of P is represented as a DCEL, storing the incidence relationships between the

Answers to some of the exercises.

Answers to some of the exercises. Chapter 2. Ex.2.1 (a) There are several ways to do this. Here is one possibility. The idea is to apply the k-center algorithm first to D and then for each center in D

Chapter 2 Paths and Searching

Chapter 2 Paths and Searching Section 2.1 Distance Almost every day you face a problem: You must leave your home and go to school. If you are like me, you are usually a little late, so you want to take

Geometry Unit 1. Basics of Geometry

Geometry Unit 1 Basics of Geometry Using inductive reasoning - Looking for patterns and making conjectures is part of a process called inductive reasoning Conjecture- an unproven statement that is based

Theorem 5. The composition of any two symmetries in a point is a translation. More precisely, S B S A = T 2

Isometries. Congruence mappings as isometries. The notion of isometry is a general notion commonly accepted in mathematics. It means a mapping which preserves distances. The word metric is a synonym to

Finding Triangle Vertices

About Illustrations: Illustrations of the Standards for Mathematical Practice (SMP) consist of several pieces, including a mathematics task, student dialogue, mathematical overview, teacher reflection

Mathematical induction. Niloufar Shafiei

Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://docplayer.net/20943026-Graph-theory-problems-and-solutions.html", "fetch_time": 1539648677000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2018-43/segments/1539583509958.44/warc/CC-MAIN-20181015225726-20181016011226-00304.warc.gz", "warc_record_offset": 99171012, "warc_record_length": 29172, "token_count": 11075, "char_count": 47197, "score": 4.0, "int_score": 4, "crawl": "CC-MAIN-2018-43", "snapshot_type": "longest", "language": "en", "language_score": 0.9331232309341431, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00040-of-00064.parquet"}