TWO CONTRIBUTIONS OF EULER

Size: px
Start display at page:

Download "TWO CONTRIBUTIONS OF EULER"

Transcription

1 TWO CONTRIBUTIONS OF EULER SIEMION FAJTLOWICZ. MATH 4315 Eulerian Tours. Although some mathematical problems which now can be thought of as graph-theoretical, go back to the times of Euclid, the invention of the subject is credited to Leonhard Euler ( ), one of the most creative, versatile and prolific mathematicians of all times. Euler was more interested in explaining the ideas and patterns of his solutions than in completeness of his arguments, and by contemporary standards many of his results would not be accepted today as proofs. Nevertheless, the impact of his work was helped rather than obstructed, by this attitude, because it emphasized the nature of mathematical discovery. This point is very well made by Polya, and Euler is one of the most quoted mathematicians in [2]. Euler was not beyond giving attention to very simple questions and even to write papers about them. The problem which directly led to development of graph theory belongs to recreational mathematics: in Konigsburg there are seven bridges on the river Pregel, and the familiar puzzle asks whether one can take a walk around the town traversing each of the bridges exactly once. The problem was almost certainly solved before, for example by carefully tabulating all possible paths, therefore ascertaing, which of them, if any, meet the requirement., ([0], 1736.)) but Euler s solution is much simpler and general. He stressed that his idea works for arbitrary system of rivers and islands, ([0.], 1736.) Euler represented the problem as the drawing to the right of the map below, and then noted that if the requested walk were possible, then at most two points, namely the beginning and the end of the tour, could have an odd number of arcs emanating from them. 1

2 2 A graph is a system consisting of two sets: vertices, (usually denoted by V ) and edges (denoted by E), plus an assignment of an unordered pair of vertices to each of the edges. Vertices u and v assigned to an edge e are called its endpoints, and we also say that edge e is incident with its endpoints, or that, it emanates from them. Two edges are incident if they share a common vertex. Two vertices belonging to the same edge are said to be adjacent. If the endpoints of e are equal then e is called a loop. Different edges may have the same endpoints assigned to them, and such edges are called multiple. Graphs without loops and without multiple edges are called simple. Unless it is explicitly stated all graphs considered here will have finite number of vertices and edges and often without loss of generality one can assume that they are simple. The degree of a vertex v in a loopless graph is the number edges emanating from v and (by convention) every loop contributes 2 to the degree count of its vertex. A graph is Eulerian if there is a sequence of vertices v 1..v m such that consecutive vertices are adjacent, and every edge is represented by a a unique pair of consecutive vertices. Informally, a graph is Eulerian if it can be drawn without lifting a pencil from the paper and without drawing any of the edges twice. An alternating sequence of vertices and edges of a graph is a walk if each of them (apart from the last one) is incident with the next one. Thus in the case of a simple graph to describe a walk it is enough to list its vertices. A walk without repeated vertices is called a path. If in addition to this, the last vertex is equal to the first, then the path is a cycle. An u, v-path in a graph G, is a path starting with u and ending with v. Let us define the relation on vertices of G by putting x y if and only if G contains a x, y-path. E.1. is an equivalence relation on vertices of a graph. (E s will denote exercises, the H s - hints for exercises with the corresponding numbers, and the S s - solutions.) The equivalence classes of the relation are called components of the graph. A graph is connected if it has just one component.

3 An Eulerian graph must be connected and each of its vertices with the exception of possibly two must have even degree. Theorem. These two conditions are also sufficient for existence of Eulerian tours. Even if we know that a graph is Eulerian it may be quite difficult to find an Eulerian tour of edges. This can be always done by listing all possible permutation of edges, but such an algorithm would require up to e! steps for a graph with e edges, and in the worst case it could be very slow, even for graphs of quite small size which is defined as the number of edges of a graph. E.2. Is it possible to have a graph with exactly one vertex of odd degree? H.2. Express the number of edges of a simple graph in terms of its degree sequence d 1, d 2..d n where d i is the degree of ith vertex (in let s say non-decreasing order.) E.3. Describe and discuss properties of an algorithm for finding an Eulerian tour in a connected graph in which all vertices have even degrees E.4. How many times the pencil has to be lifted from the paper to draw an arbitrary connected graph, without drawing any of the edges twice. E.5. Is it possible to take a walk in Konigsburg traversing each of the edges exactly once in each direction? E.6. Describe the knight-tour problem (and possibly other puzzles) in graphtheoretical terms. H.3. Start a tour using at each step only new edges as long as possible. When the process can not be continued anymore shift the tour and then extend it further if possible. Prove a stronger theorem that one can find a required tour starting with any of the edges. H.4. How many times the pencil has to be lifted to make Eulerian (i.e without duplicating edges) drawing of a graph with 4 vertices of odd degree? H.5. Extend the theory of Eulerian tours in graphs to digraphs, i.e., graphs with directed (or oriented) edges. S.1. The relation is relflexive because the 1-vertex walk v starts and terminates at v. The relation is symmetric, because if v 1..v n is walk from v to u then v n..v 1 is a walk from u to v. Finally, the relation is transitive because if X is a walk from x to y and Y is a walk from y to z then the walk Z obtained from X followed by Y is a walk from x to z. 3

4 4 S.2. The sum of d i s is twice the number of edges, because starting from sum = 0 and adding d i for each vertex (of degree d i ), we eventually count each of the edges twice. The argument shows that the sum of degrees is twice the number of edges, and in particular, the number of edges of odd degree must be even. Indeed, the sum of odd number of odd numbers is odd. S.3. A graph has a closed Eulerian tour if and only if it is connected and every vertex has even degree. Proceeding as in the hint, the traversed edges span a connected graph in which every vertex has even degree. Indeed, the number of traversed edges incident with the last (and thus also any other) vertex, must be even. The graph of traversed edges has an Eulerian tour starting at any given edge, because the tour can be cyclically rotated. Unless all edges were already visited, we can retrace the tour of the drawn edges starting at a vertex incident with a yet untraversed edge, and extend the tour further, [3]. The resulting algorithm is as good as they come: it is a simple search which finds a way out of blind alleys by making the full use of what was done previously. It is like a trial and error method in which every error can be quickly discovered and then corrected. S.4. Suppose that we have two vertices of odd degree. Joining them by a new edge we can reduce the problem to E.3, because the resulting graph will have a closed Eulerian tour which can be shifted to get a tour of the original graph starting at one of the vertices of odd degree. In general we can proceed by induction on ω - the the number of vertices of odd degrees (assuming that the graph is connected.) In this case, the number of times the pencil has to be lifted from the paper is ω/2 1. S.5. The in-degree of a vertex x in a digraph D is the number of edges of the form (y, x), and the out-degree is the number of edges of the form (x, y). A necessary condition for existance of a closed Eulerian tour is that the in-degree of each vertex is equal to its out-degree. Another necessary condition is the connectivity of the graph obtained from D by ignoring the direction of edges. The algorithm described in S.3 can be easily modified to arbitrary digraphs. S. 6. A graph is Hamiltonian if one can list its vertices, so that consecutive vertices are adjacent, and every vertex appears on the list exactly once. Let G be the graph whose vertices are chessboard squares, two being adjacent if and only if a knight placed on one of them can attack the other square. Then the question of existence of a knight-tour is the problem of whether the resulting graph is Hamiltonian. A set of vertices is independent if no two of its elements are adjacent. The question what is the maximum number of mutually non-attacking queens on the chessboard is the problem of finding a largest independent set in the graph in which

5 two squares of a chessboard are adjacent if and only if a queen placed on one of them can attack the other. Planar Graphs. When Euler discussed the problem of touring an arbitrary system of bridges he classified it as new kind of a geometry (without magnitudes) problem. Another paper of Euler which had impact on graph theory was about polyhedra, and characteristically Euler did not clearly say what he meant by this concept. A polygon is a plane area bounded by a piece-wise linear curve which does not intersect itself. A polyhedron is a solid bounded by a a finite number of polygons which are called faces. Euler stated that every polyhedron has the property that V E + F = 2, where V is the number of vertices, E - edges, and F - the number of faces. A graph is planar if it can be drawn on the plane so that the arcs representing edges do not cross. A planar drawing of a graph splits the plane into disjoint regions, called also faces or countries. Two points belong to the same face if they can be connected by an arc intersecting no edges of the graph. Theorem. The Euler formula is true for all connected planar graphs. Proof: A connected graph without cycles is called a tree. Since the number of faces of a tree is 1, in this case, the Euler formula amounts to showing that the number of edges is one less than the number of vertices. It is easy to prove that if G is a graph in which every vertex has degree greater or equal to 2, then G must contain a cycle. Thus every tree T has a vertex of degree at most 1, and if the number of vertices of T is at least 2, then T must contain vertex of degree 1. Deleting a vertex of degree 1 lowers the number of vertices and edges by 1, and thus the Euler s formula for trees follows by induction on the number of vertices n, with the case n = 1 being obvious. For arbitrary planar graphs, the formula can be now proved by deleting an edge contained in a cycle. The resulting graph will be connected and the Euler characteristic formula follows by induction on the number of edges. E. Prove that if degree of every vertex of a simple graph G is at least 2, then G contains a cycle. E. Prove or disprove that if a tree T contains a vertex of degree d, then T contains at least d vertices of degree 1. E. Prove or disprove that every tree with at least 2 vertices, contains at least two vertices of degree 1. E. Complete the proof of the theorem in the case when G contains a cycle. 5

6 6 A graph is spherical iff it can be drawn without edge-crossing on the surface of a sphere. Every orientable surface can be obtained from a sphere by repeating the process of cutting out two holes in the surface and then by gluing them up with two boundaries of a cylinder. An orientable surface looks like a sphere with a number of handles. The number of these handles is called the genus of the surface. The genus of a graph G is defined as the smallest genus of a surface on which G can be drawn without edge-crossing. The surface of genus 1 is called the torus. Represention of a graph on a surface is a triangulation if every region (which is defined in the same manner as above) is a triangle. For triangulations, or more generally for representations of graphs in which every region can be continuously deformed to a point we have V E + F = 2 2γ, where γ denotes the genus of the surface. E. 1. Let K n denotes the graph with n vertices, every two of which are joined by a (single) edge. What is the genus of K n, n 5? K n s are called complete graphs or cliques and n-vertex graphs without edges are called empty graphs. E.2. Let G be a planar triangulation with 12 vertices each of which has degree 5. What is the number of faces of G? A graph in which every vertex has degree 3 is called cubic. A fullerene is a simple planar cubic graph in which every face has 5 or 6 sides. E.3. Prove that every fullerene has exactly 12 faces of size 5. The girth of a graph is the size of a smallest cycle. E.5. (optional) Show that there are cubic planar graph of girth 5 which are not fullerenes. H. 1. If K 5 were planar then we could use Euler s characteristic. To represent K 5 on the torus, draw this graph on a page with identified parallel sides. H.2. Use Euler characteristic. H.3. Express the number of edges in terms of the number of k-sided faces. H. 4. If G contains a cycle then it contains an edge whose deletion does not disconnect the graph.

7 S.1. Suppose that K 5 is planar. Since every vertex has degree 4, the number of edges is 10, and thus Euler characteristic implies that the number of faces is 7. Since every face has at least 3 sides, the number of edges is at least 3F/2, which is a contradiction. S.3. The number of edges is 1/2(5f 5 +6f 6 ) and also 3n/2 where n is the number of vertices. Thus n = 2E/3 = 15f 5 +18f 6. Multiplying both sides of Euler characteristic by 6 and expressing everything in terms of f 5 and f 6 we get f 5 = 12. S.4. Let G be the graph obtained from G by deleting an edge contained in a cycle. Then G is connected, and we can proceed by induction on the number of faces F, ( if F = 1, then G is a tree, so the anchor condition holds true.) The number of faces F of G is F 1, the number of edges of G is E = E 1 and the number of vertices of G is V = V. Thus by induction on F 2 = V E + F = V E + F which proves the theorem. E. 6 Prove or disprove that graph is planar iff it spherical. Definitin k n,m - the complete bipartite graph denotes the graph with n + m vertices, n of which are colored red, and the remaining colored blue, so that two vertices of this graph are adjacent iff they have different colors. Complete bipartite graphs in with n = 1, are called stars. E. Prove or disprove that k 3,3 is planar. 7 REFERENCES 0. Leonhard Euler, Comm. Acad. Sci. Petrop. 8, publ Leonhard Euler, The Seven Bridges of Konigsburg, in The Word of Mathematics, by James R. Newman, vol 1. p George Polya, Mathematical and Plausible Reasoning, Princeton University Press. 3. Hugo Steinhaus, Mathematical Snapshots, Oxford University Press. 4. R. Courant and H. Robins, What is Mathematics?

WUCT121. Discrete Mathematics. Graphs

WUCT121. Discrete Mathematics. Graphs WUCT121 Discrete Mathematics Graphs WUCT121 Graphs 1 Section 1. Graphs 1.1. Introduction Graphs are used in many fields that require analysis of routes between locations. These areas include communications,

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

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7 CS 70 Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7 An Introduction to Graphs A few centuries ago, residents of the city of Königsberg, Prussia were interested in a certain problem.

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

Fundamental Properties of Graphs

Fundamental Properties of Graphs Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,

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

Brief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions

Brief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions Brief History Graph Theory What is a graph? It all began in 1736 when Leonhard Euler gave a proof that not all seven bridges over the Pregolya River could all be walked over once and end up where you started.

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

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

CS70 - Lecture 6. Graphs: Coloring; Special Graphs. 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs:

CS70 - Lecture 6. Graphs: Coloring; Special Graphs. 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs: CS70 - Lecture 6 Graphs: Coloring; Special Graphs 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs: Trees: Three characterizations Hypercubes: Strongly connected! Administration You need

More information

Assignment 4 Solutions of graph problems

Assignment 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 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

Graph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC January 26, 2011

Graph Theory. 1 Introduction to Graphs. Martin Stynes Department of Mathematics, UCC   January 26, 2011 Graph Theory Martin Stynes Department of Mathematics, UCC email: m.stynes@ucc.ie January 26, 2011 1 Introduction to Graphs 1 A graph G = (V, E) is a non-empty set of nodes or vertices V and a (possibly

More information

Mathematics and Statistics, Part A: Graph Theory Problem Sheet 1, lectures 1-4

Mathematics and Statistics, Part A: Graph Theory Problem Sheet 1, lectures 1-4 1. Draw Mathematics and Statistics, Part A: Graph Theory Problem Sheet 1, lectures 1-4 (i) a simple graph. A simple graph has a non-empty vertex set and no duplicated edges. For example sketch G with V

More information

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

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

Number Theory and Graph Theory

Number Theory and Graph Theory 1 Number Theory and Graph Theory Chapter 7 Graph properties By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-2: Eulerian

More information

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite

More information

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. An Introduction to Graph Theory

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. An Introduction to Graph Theory SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics An Introduction to Graph Theory. Introduction. Definitions.. Vertices and Edges... The Handshaking Lemma.. Connected Graphs... Cut-Points and Bridges.

More information

Section 3.4 Basic Results of Graph Theory

Section 3.4 Basic Results of Graph Theory 1 Basic Results of Graph Theory Section 3.4 Basic Results of Graph Theory Purpose of Section: To formally introduce the symmetric relation of a (undirected) graph. We introduce such topics as Euler Tours,

More information

Discrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs

Discrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 13 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite to writing a

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

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

Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings

Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Chapter 12 and 11.1 Planar graphs, regular polyhedra, and graph colorings Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 12: Planar Graphs Math 184A / Fall 2017 1 / 45 12.1 12.2. Planar graphs Definition

More information

Euler Characteristic

Euler Characteristic Euler Characteristic Rebecca Robinson May 15, 2007 Euler Characteristic Rebecca Robinson 1 PLANAR GRAPHS 1 Planar graphs v = 5, e = 4, f = 1 v e + f = 2 v = 6, e = 7, f = 3 v = 4, e = 6, f = 4 v e + f

More information

Undirected Network Summary

Undirected Network Summary Undirected Network Summary Notice that the network above has multiple edges joining nodes a to d and the network has a loop at node d. Also c is called an isolated node as it is not connected to any other

More information

Chapter 11: Graphs and Trees. March 23, 2008

Chapter 11: Graphs and Trees. March 23, 2008 Chapter 11: Graphs and Trees March 23, 2008 Outline 1 11.1 Graphs: An Introduction 2 11.2 Paths and Circuits 3 11.3 Matrix Representations of Graphs 4 11.5 Trees Graphs: Basic Definitions Informally, a

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

An Investigation of the Planarity Condition of Grötzsch s Theorem

An Investigation of the Planarity Condition of Grötzsch s Theorem Le Chen An Investigation of the Planarity Condition of Grötzsch s Theorem The University of Chicago: VIGRE REU 2007 July 16, 2007 Abstract The idea for this paper originated from Professor László Babai

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

CHAPTER 10 GRAPHS AND TREES. Alessandro Artale UniBZ - artale/z

CHAPTER 10 GRAPHS AND TREES. Alessandro Artale UniBZ -  artale/z CHAPTER 10 GRAPHS AND TREES Alessandro Artale UniBZ - http://www.inf.unibz.it/ artale/z SECTION 10.1 Graphs: Definitions and Basic Properties Copyright Cengage Learning. All rights reserved. Graphs: Definitions

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

Ma/CS 6b Class 26: Art Galleries and Politicians

Ma/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 information

Instructor: Paul Zeitz, University of San Francisco

Instructor: Paul Zeitz, University of San Francisco Berkeley Math Circle Graph Theory and Ramsey Theory Instructor: Paul Zeitz, University of San Francisco (zeitz@usfca.edu) Definitions 1 A graph is a pair (V,E), where V is a finite set and E is a set of

More information

Coloring planar graphs

Coloring planar graphs : coloring and higher genus surfaces Math 104, Graph Theory April 2, 201 Coloring planar graphs Six Color Let G be a planar graph. Then c(g) apple 6. Proof highlights. I Proof type: Induction on V (G).

More information

Face Width and Graph Embeddings of face-width 2 and 3

Face Width and Graph Embeddings of face-width 2 and 3 Face Width and Graph Embeddings of face-width 2 and 3 Instructor: Robin Thomas Scribe: Amanda Pascoe 3/12/07 and 3/14/07 1 Representativity Recall the following: Definition 2. Let Σ be a surface, G a graph,

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

INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES

INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance

More information

MC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points

MC 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

The Konigsberg Bridge Problem

The Konigsberg Bridge Problem The Konigsberg Bridge Problem This is a classic mathematical problem. There were seven bridges across the river Pregel at Königsberg. Is it possible to take a walk in which each bridge is crossed exactly

More information

Chapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:

Chapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below: Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have

More information

CS 177 Homework 1. Julian Panetta. October 22, We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F:

CS 177 Homework 1. Julian Panetta. October 22, We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F: CS 177 Homework 1 Julian Panetta October, 009 1 Euler Characteristic 1.1 Polyhedral Formula We want to show for any polygonal disk consisting of vertex set V, edge set E, and face set F: V E + F = 1 First,

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

Planar graphs. Math Prof. Kindred - Lecture 16 Page 1

Planar graphs. Math Prof. Kindred - Lecture 16 Page 1 Planar graphs Typically a drawing of a graph is simply a notational shorthand or a more visual way to capture the structure of the graph. Now we focus on the drawings themselves. Definition A drawing of

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

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

Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015

Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015 Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015 The Seven Bridges of Königsberg In

More information

BAR-MAGNET POLYHEDRA AND NS-ORIENTATIONS OF MAPS

BAR-MAGNET POLYHEDRA AND NS-ORIENTATIONS OF MAPS University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 19, 1111 Ljubljana, Slovenia Preprint series, Vol. 42 (2004), 940 BAR-MAGNET POLYHEDRA AND NS-ORIENTATIONS

More information

Definition 1.1. A matching M in a graph G is called maximal if there is no matching M in G so that M M.

Definition 1.1. A matching M in a graph G is called maximal if there is no matching M in G so that M M. 1 Matchings Before, we defined a matching as a set of edges no two of which share an end in common. Suppose that we have a set of jobs and people and we want to match as many jobs to people as we can.

More information

Lecture 5: Graphs. Rajat Mittal. IIT Kanpur

Lecture 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 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

[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra

[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra Apex graphs with embeddings of face-width three Bojan Mohar Department of Mathematics University of Ljubljana Jadranska 19, 61111 Ljubljana Slovenia bojan.mohar@uni-lj.si Abstract Aa apex graph is a graph

More information

Basic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions

Basic 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 information

Graph Theory II. Po-Shen Loh. June edges each. Solution: Spread the n vertices around a circle. Take parallel classes.

Graph Theory II. Po-Shen Loh. June edges each. Solution: Spread the n vertices around a circle. Take parallel classes. Graph Theory II Po-Shen Loh June 009 1 Warm-up 1. Let n be odd. Partition the edge set of K n into n matchings with n 1 edges each. Solution: Spread the n vertices around a circle. Take parallel classes..

More information

6.2. Paths and Cycles

6.2. Paths and Cycles 6.2. PATHS AND CYCLES 85 6.2. Paths and Cycles 6.2.1. Paths. A path from v 0 to v n of length n is a sequence of n+1 vertices (v k ) and n edges (e k ) of the form v 0, e 1, v 1, e 2, v 2,..., e n, v n,

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

Construction of planar triangulations with minimum degree 5

Construction of planar triangulations with minimum degree 5 Construction of planar triangulations with minimum degree 5 G. Brinkmann Fakultät für Mathematik Universität Bielefeld D 33501 Bielefeld, Germany gunnar@mathematik.uni-bielefeld.de Brendan D. McKay Department

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

EULER S FORMULA AND THE FIVE COLOR THEOREM

EULER S FORMULA AND THE FIVE COLOR THEOREM EULER S FORMULA AND THE FIVE COLOR THEOREM MIN JAE SONG Abstract. In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler s formula and apply

More information

8.2 Paths and Cycles

8.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 information

Graph Theory. Part of Texas Counties.

Graph Theory. Part of Texas Counties. Graph Theory Part of Texas Counties. We would like to visit each of the above counties, crossing each county only once, starting from Harris county. Is this possible? This problem can be modeled as a graph.

More information

Ma/CS 6b Class 9: Euler s Formula

Ma/CS 6b Class 9: Euler s Formula Ma/CS 6b Class 9: Euler s Formula By Adam Sheffer Recall: Plane Graphs A plane graph is a drawing of a graph in the plane such that the edges are noncrossing curves. 1 Recall: Planar Graphs The drawing

More information

11.4 Bipartite Multigraphs

11.4 Bipartite Multigraphs 11.4 Bipartite Multigraphs Introduction Definition A graph G is bipartite if we can partition the vertices into two disjoint subsets U and V such that every edge of G has one incident vertex in U and the

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

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

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

Graph Theory Mini-course

Graph Theory Mini-course Graph Theory Mini-course Anthony Varilly PROMYS, Boston University, Boston, MA 02215 Abstract Intuitively speaking, a graph is a collection of dots and lines joining some of these dots. Many problems in

More information

Some Upper Bounds for Signed Star Domination Number of Graphs. S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour.

Some Upper Bounds for Signed Star Domination Number of Graphs. S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour. Some Upper Bounds for Signed Star Domination Number of Graphs S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour Abstract Let G be a graph with the vertex set V (G) and edge set E(G). A function

More information

2. CONNECTIVITY Connectivity

2. 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 information

Math 311. Trees Name: A Candel CSUN Math

Math 311. Trees Name: A Candel CSUN Math 1. A simple path in a graph is a path with no repeated edges. A simple circuit is a circuit without repeated edges. 2. Trees are special kinds of graphs. A tree is a connected graph with no simple circuits.

More information

The Geodesic Integral on Medial Graphs

The Geodesic Integral on Medial Graphs The Geodesic Integral on Medial Graphs Kolya Malkin August 013 We define the geodesic integral defined on paths in the duals of medial graphs on surfaces and use it to study lens elimination and connection

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

Chapter 3: Paths and Cycles

Chapter 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 information

Discrete Mathematics I So Practice Sheet Solutions 1

Discrete 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 information

A Practical 4-coloring Method of Planar Graphs

A Practical 4-coloring Method of Planar Graphs A Practical 4-coloring Method of Planar Graphs Mingshen Wu 1 and Weihu Hong 2 1 Department of Math, Stat, and Computer Science, University of Wisconsin-Stout, Menomonie, WI 54751 2 Department of Mathematics,

More information

arxiv: v1 [math.co] 4 Sep 2017

arxiv: v1 [math.co] 4 Sep 2017 Abstract Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces andacertain

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

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

11.4 Three-Dimensional Figures

11.4 Three-Dimensional Figures 11. Three-Dimensional Figures Essential Question What is the relationship between the numbers of vertices V, edges E, and faces F of a polyhedron? A polyhedron is a solid that is bounded by polygons, called

More information

V1.0: Seth Gilbert, V1.1: Steven Halim August 30, Abstract. d(e), and we assume that the distance function is non-negative (i.e., d(x, y) 0).

V1.0: Seth Gilbert, V1.1: Steven Halim August 30, Abstract. d(e), and we assume that the distance function is non-negative (i.e., d(x, y) 0). CS4234: Optimisation Algorithms Lecture 4 TRAVELLING-SALESMAN-PROBLEM (4 variants) V1.0: Seth Gilbert, V1.1: Steven Halim August 30, 2016 Abstract The goal of the TRAVELLING-SALESMAN-PROBLEM is to find

More information

Module 2: NETWORKS AND DECISION MATHEMATICS

Module 2: NETWORKS AND DECISION MATHEMATICS Further Mathematics 2017 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,

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

MATH 350 GRAPH THEORY & COMBINATORICS. Contents

MATH 350 GRAPH THEORY & COMBINATORICS. Contents 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

More information

Introduction to Graph Theory

Introduction to Graph Theory Introduction to Graph Theory George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 351 George Voutsadakis (LSSU) Introduction to Graph Theory August 2018 1 /

More information

Math 443/543 Graph Theory Notes

Math 443/543 Graph Theory Notes Math 443/543 Graph Theory Notes David Glickenstein September 3, 2008 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.

More information

v V Question: How many edges are there in a graph with 10 vertices each of degree 6?

v 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 information

Further Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks

Further Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Further Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,

More information

1 Appendix to notes 2, on Hyperbolic geometry:

1 Appendix to notes 2, on Hyperbolic geometry: 1230, notes 3 1 Appendix to notes 2, on Hyperbolic geometry: The axioms of hyperbolic geometry are axioms 1-4 of Euclid, plus an alternative to axiom 5: Axiom 5-h: Given a line l and a point p not on l,

More information

Notebook Assignments

Notebook Assignments Notebook Assignments These six assignments are a notebook using techniques from class in the single concrete context of graph theory. This is supplemental to your usual assignments, and is designed for

More information

Course Introduction / Review of Fundamentals of Graph Theory

Course 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 information

Which n-venn diagrams can be drawn with convex k-gons?

Which n-venn diagrams can be drawn with convex k-gons? Which n-venn diagrams can be drawn with convex k-gons? Jeremy Carroll Frank Ruskey Mark Weston Abstract We establish a new lower bound for the number of sides required for the component curves of simple

More information

Discrete Mathematics Course Review 3

Discrete Mathematics Course Review 3 21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has

More information

PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS

PACKING 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 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

Euler s Theorem. Brett Chenoweth. February 26, 2013

Euler s Theorem. Brett Chenoweth. February 26, 2013 Euler s Theorem Brett Chenoweth February 26, 2013 1 Introduction This summer I have spent six weeks of my holidays working on a research project funded by the AMSI. The title of my project was Euler s

More information

Math 443/543 Graph Theory Notes

Math 443/543 Graph Theory Notes Math 443/543 Graph Theory Notes David Glickenstein September 8, 2014 1 Introduction We will begin by considering several problems which may be solved using graphs, directed graphs (digraphs), and networks.

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

How can we lay cable at minimum cost to make every telephone reachable from every other? What is the fastest route between two given cities?

How can we lay cable at minimum cost to make every telephone reachable from every other? What is the fastest route between two given cities? 1 Introduction Graph theory is one of the most in-demand (i.e. profitable) and heavily-studied areas of applied mathematics and theoretical computer science. May graph theory questions are applied in this

More information

The University of Sydney MATH2969/2069. Graph Theory Tutorial 2 (Week 9) 2008

The 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 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