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

Save this PDF as:

Size: px
Start display at page:

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

Transcription

1 Graph theory Po-Shen Loh June Well-known 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 edges. Deduce that the number of odd-degree vertices is always an even number. edges. By counting in two ways, we see that the sum of all degrees equals twice the number of. A graph is called bipartite if it is possible to separate the vertices into two groups, such that all of the graph s edges only cross between the groups (no edge has both endpoints in the same group). Prove that this property holds if and only if the graph has no cycles of odd length. Separate into connected components. For each, choose a special vertex, and color based on parity of length of shortest path from that special vertex. 3. Every connected graph with all degrees even has an Eulerian circuit, i.e., a walk that traverses each edge exactly once. Start walking from a vertex v 1 without repeating any edges, and observe that by the parity condition, the walk can only get stuck at v 1, so we get one cycle. If we still have more edges left to hit, connectivity implies that some vertex v on our current walk is adjacent to an unused edge, so start the process again from v. Splice the two walks together at v, and repeat until done. 4. Suppose that a graph has at least as many edges as vertices. Show that it contains a cycle. As long as there are vertices with degree exactly 1, delete both the vertex and its incident edge. Also delete all isolated vertices. These operations preserve E V, but we can never delete everything because once V = 1, E must be 0, so we can never get down to only 1 vertex or less. Therefore we end up with a nonempty graph with all degrees, and by taking a walk around and eventually hitting itself, we get a cycle. 5. Suppose that the graph G has all degrees at most. Prove that it is possible to color the vertices of G using + 1 colors, such that no pair of adjacent vertices receives the same color. Consider the greedy algorithm for coloring vertices. 6. Let G 1, G, G 3 be three (possibly overlapping) graphs on the same vertex set, and suppose that G 1 can be properly colored with colors, G can be properly colored with 3 colors, and G 3 can be properly colored with 4 colors. Let G be the graph on the same vertex set, formed by taking the union of the edges appearing in G 1, G, G 3. Prove that G can be properly colored with 4 colors. Product coloring. 1

2 7. Let G be a graph. It is possible to partition the vertices into two groups such that for each vertex, at least half of its neighbors ended up in the other group. Take a max-cut: the bipartition which maximizes the number of crossing edges. 8. Let δ be the minimum degree of G, and suppose that δ. Then G contains a cycle of size δ + 1. In particular, it contains a path with δ edges. Take a longest path. Let v be its last endpoint. By maximality, every one of v s δ neighbors lie on the path. So path has length δ (Dirac.) Let G be a graph on n vertices with all degrees at least n/. Show that G has a Hamiltonian cycle. Suppose the longest path has t vertices x 1,..., x t. We will show there is a cycle of t vertices as well. Suppose not. All neighbors of x 1 and x t must lie on the path or else it is not longest. Minimum degree condition implies that both have degree t/. But if x 1 x k, then x t x k 1 or else we can re-route to get a cycle. So, each of x 1 s t/ neighbors on the path prohibit a potential neighbor of x t. Yet x t s neighbors come from indices 1... t 1, so there is not enough space for x t to have t/ neighbors there, avoiding the prohibited ones. Now if this longest path is not the full n vertices, then we get a cycle C missing some vertex x. But min-degree n/ implies that the graph is connected (smallest connected component is n/+1), so there is a shortest path from x to C, and adding this to the cycle gives a longer path than t, contradiction. 1.1 Matching Consider a bipartite graph G = (V, E) with partition V = A B. A matching is a collection of edges which have no endpoints in common. We say that A has a perfect matching to B if there is a matching which hits every vertex in A. Theorem. (Hall s Marriage Theorem) For any set S A, let N(S) denote the set of vertices (necessarily in B) which are adjacent to at least one vertex in S. Then, A has a perfect matching to B if and only if N(S) S for every S A. This has traditionally been called the marriage theorem because of the possible interpretation of edges as acceptable pairings, with the objective of maximizing the number of pairings. In real life, however, perhaps there may be varying degrees of acceptability. This may be formalized by giving each vertex (in both parts) an ordering of its incident edges. Then, a matching M is called unstable if there is an edge e = ab M for which both a and b both prefer the edge e to their current partner (according to M). Theorem. (Stable Marriage Theorem) A stable matching always exists, for every bipartite graph and every collection of preference orderings. 1. Planarity When we represent graphs by drawing them in the plane, we draw edges as curves, permitting intersections. If a graph has the property that it can be drawn in the plane without any intersecting edges, then it is called planar. Here is the tip of the iceberg. One of the most famous results on planar graphs is the Four-Color Theorem, which says that every planar graph can be properly colored using only four colors. But perhaps the most useful planarity theorem in Olympiad problems is the Euler Formula: Theorem. Every connected planar graph satisfies V E + F =, where V is the number of vertices, E is the number of edges, and F is the number of faces.

3 Actually prove that V E + F = 1 + C, where C is the number of connected components. Each connecting curve is piecewise-linear, and if we add vertices at the corners, this will keep V E invariant. Now we have a planar graph where all connecting curves are straight line segments. Then induction on E + V. True when E = 0, because F = 1 and V = C. If there is a leaf (vertex of degree 1), delete both the vertex and its single incident edge, and V E remains invariant. If there are no leaves, then every edge is part of a cycle. Delete an arbitrary edge, and that will drop E by 1, but also drop F by 1 because the edge was part of a cycle boundary, and now that has merged two previously distinct faces. Now, use the theorem to solve the following problems: 1. Prove that K 5 is not planar.. Prove that K 3,3 is not planar. 3. Prove that K 4,4 is not planar. 4. Prove that every planar graph can be properly colored using at most 6 colors. The Euler criterion immediately implies that every connected graph has at least E (3V 6) crossings. As it turns out, one can do much better: Theorem. (Ajtai, Chvátal, Newborn, Szemeredi; Leighton.) Every connected graph with E 4V has at E least 3 64V crossings. 1.3 Extremal graph theory The classical starting point is Turán s theorem, which proves the extremality of the following graph: let T r (n) be the complete r-partite graph with its n vertices distributed among its r parts as evenly as possible (because rounding errors may occur). Theorem. (Turán.) For r 3, the Turán graph T r 1 (n) is the unique n-vertex graph with the maximum number of edges subject to having no K r subgraphs. There are many proofs of Turán s theorem, and one particular approach using Zykov symmetrization appears in the free online textbook of R. Diestel. The following results are somewhat easier to establish, and the reader is encouraged to attempt them: 1. Every graph G with average degree d contains a subgraph H such that all vertices of H have degree at least d/ (with respect to H). Condition on G is that the number of edges is at least nd/. If there is a vertex with degree < d/, then delete it, and it costs 1 vertex and < d/ edges, so the condition is preserved. But it can t go on forever, because once there is 1 vertex left, average degree is 0.. (Approximation to Erdős-Sós conjecture.) Let T be a tree with t edges. Then every graph with average degree at least t contains T as a subgraph. Graph has subgraph with minimum degree at least t. Then embed greedily. Suppose we already put down v vertices. (v < t + 1 or else we are done.) Pick a current node to which to adjoin a new leaf. Degree is at least t, and v 1 vertices are already down (so blocked for embedding), so t v + 1 > 0 choices remain. Pick one of them for the new leaf, and continue. 3. We say that a graph G is t-degenerate if every subgraph has a vertex of degree t. Show that G can be properly colored with t + 1 colors. Iteratively peel off vertex of degree t, and put these into an ordering. That is, v 1 is the first vertex pulled off, then v, etc. Now greedily color from v n to v 1. 3

4 Ramsey theory Complete disorder is impossible. T. S. Motzkin, on the theme of Ramsey Theory. The Ramsey Number R(s, t) is the minimum integer n for which every red-blue coloring of the edges of K n contains a completely red K s or a completely blue K t. Ramsey s Theorem states that R(s, t) is always finite, and we will prove this in the first exercise below. The interesting question in this field is to find upper and lower bounds for these numbers, as well as for quantities defined in a similar spirit. 1. Prove by induction that R(s, t) ( ) s+t s 1. Note that in particular, R(3, 3) 6. Observe that R(s, t) R(s 1, t) +R(s, t 1), because if we have that many vertices, then if we select one vertex, then it cannot simultaneously have < R(s 1, t) red neighbors and < R(s, t 1) blue neighbors, so we can inductively build either a red K s or a blue K t. But ( ) ( ) ( ) (s 1) + t s + (t 1) s + t + =, (s ) s 1 s 1 because in Pascal s Triangle the sum of two adjacent guys in a row equals the guy directly below them in the next row.. Show that R(t, t) t. Then show that R(t, t) > t/ for t 3, i.e., there is a red-blue coloring of the edges of the complete graph on t/, such that there are no monochromatic K t. The first bound follows immediately from the Erdős-Szekeres bound. The second is an application of the probabilistic method. Let n = t/, and consider a random coloring of the edges of K n, where each edge independently receives its color with equal probabilities. For each set S of t vertices, define the event E S to be when all ( t ) edges in S are the same color. It suffices to show that P [some E S occurs] < 1. But by the union bound, the LHS is ( ) n ( (t ) ) nt t t! t This final quantity is less than 1 for all t 3. = + t ( ) t/ t t + t t! = t/. t! 3. (IMO 1964/4.) Seventeen people correspond by mail with one another each one with all the rest. In their letters only 3 different topics are discussed. Each pair of correspondents deals with only one of these topics. Prove that there are at least 3 people who write to each other about the same topic. This is asking us to prove that the 3-color Ramsey Number R(3, 3, 3) is 17. By the same observation as in the previous problem, R(a, b, c) R(a 1, b, c)+r(a, b 1, c)+r(a, b, c 1) 1. Then using symmetry, R(3, 3, 3) 3R(3, 3, ) 1. It suffices to show that R(3, 3, ) 6. But this is immediate, because if we have 6 vertices, if we even use the 3rd color on a single edge, we already get a K. So we cannot use the 3rd color. But then from above, we know R(3, 3) 6, so we are done. 3 Problems 1. Prove that every n-vertex graph with n + 1 edges contains at least two (possibly overlapping) cycles. Does it always contain at least 3? Since the graph has at least n edges, there is a cycle. Delete one edge of that cycle. There are still at least n edges, so there is another cycle. 4

5 . (Open.) Does every 3-uniform hypergraph with at least 1000n edges contain a (not necessarily spanning) tight cycle: 3. (USAMO 1986/.) Five professors attended a lecture. Each fell asleep just twice. For each pair there was a moment when both were asleep. Show that there was a moment when three of them were asleep. Assume there is never a moment when three people were simultaneously asleep. The timeline then produces a permutation of the edges of K 5, where the first edge is the first pair of simultaneously asleep professors. This permutation must hit each vertex exactly 4 times, and those times can be spread over at most intervals. It is relatively easy to show (via cases) that it is impossible for a single one of those intervals to hit a vertex 3 or more times, so we conclude that each interval hits every vertex exactly twice. This then corresponds to an Eulerian tour of K 5. However, the vertex at which the tour begins and ends is hit in 3 distinct intervals. 4. (IMO 1983 shortlist.) A country has 1983 cities. Every pair of cities is connected by a road. Each road is owned by one of 10 companies. Prove that there must be a way to travel in a circuit of odd length along a sequence of roads that are all owned by a single company. For each company, define a (not necessarily induced or spanning) subgraph of K 1983 by taking every edge owned by the company. The condition implies that K 1983 is the union of these 10 (possibly overlapping) subgraphs. Yet if each subgraph is bipartite, then the chromatic number of K 1983 would be bounded by 1 0 = 104, contradiction. 5. (From Ehud Friedgut.) Let T 1 and T be two edge-disjoint spanning trees on the same vertex set. Prove that their union G is 4-colorable. Now let T 3 be a third spanning tree, also edge-disjoint from both T 1 and T. Prove that their union G is 8-colorable. Is it always 6-colorable? It is always 6-colorable due to 5-degeneracy. Every induced k-vertex subgraph spans at most 3(k 1) edges, with equality if and only if all three trees are connected on the subgraph. Therefore, there is always a vertex of degree at most A tournament is a complete graph in which every edge has been oriented toward one of its endpoints. Prove that every tournament has a Hamiltonian path: one which passes through each vertex, respecting the orientations of the edges. Take a median order. 7. You are given a grid, with the property that in every row, exactly 3 squares are shaded, and in every column, exactly 3 squares are shaded. An example is below. 5

6 Prove that there must always be a shaded transversal, i.e., a choice of 10 shaded squares such that no two selected squares are in the same row or column. An example is below. Hall s theorem. 8. (MOP 007/4/K.) Let S be a set of 10 6 points in 3-dimensional space. Show that at least 79 distinct distances are formed between pairs of points of S. Zarankiewicz counting for the excluded K 3,3 in the unit distance graph. This upperbounds the number of edges in each constant-distance graph, and therefore lower-bounds the number of distinct distances. 9. (MOP 007/10/K4.) Let S be a set of n points in space, such that no 4 lie in the same plane. Pick any n + 1 segments determined by the points. Show that they form at least n (possibly overlapping) triangles. In fact, every n-vertex graph with at least n + 1 edges already contains at least n triangles. No geometry is needed. 10. (Open.) Determine, as a function of n, the minimum number of crossings that appear in any plane drawing of K n. 11. (Bondy ) There are n points in the plane such that every pair of points has distance 1. Show that there are at most 3n (unordered) pairs of points that span distance exactly 1 each. The unit distance graph is planar. 1. (St. Petersburg 1997/13.) The sides of a convex polyhedron are all triangles. At least 5 edges meet at each vertex, and no two vertices of degree 5 are connected by an edge. Prove that this polyhedron has a face whose vertices have degree 5, 6, 6, respectively. By Euler, E 3V 6, so in particular the sum of degrees is less than 6V. We will use this for a contradiction. Suppose there are no 5,6,6 faces. We will count the number of edges which connect vertices of degree 5 to vertices of degree 7. 6

7 Let x i be the number of vertices of degree i for each i. No 5,6,6 implies that each 5-vertex has at most neighbors of degree 6, thus it contributes 3 edges which cross from degree 5 to degree 7. On the other hand, any vertex of degree d has at most d/ neighbors of degree 5 because no two degree-5 guys are adjacent. Thus, double-counting gives: 3x 5 d x d d=7 x 5 d=7 x d 1 3 Note that for d 7, the cumbersome expression satisfies d/ /3 d 6. Adding to the LHS so that it becomes 6 times the number of vertices: 6x 5 + 6x 6 + d=7 d. x 5 d=7 x d (d 6) 6x d 5x 5 + 6x 6 + d=7 x d d. Recognize the LHS as 6V and the RHS as sum of degrees, and this contradicts our opening observation. 7

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

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

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

Planar Tree Transformation: Results and Counterexample

Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem

Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

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

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

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

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.

1 Plane and Planar Graphs. Definition 1 A graph G(V,E) is called plane if

Plane and Planar Graphs Definition A graph G(V,E) is called plane if V is a set of points in the plane; E is a set of curves in the plane such that. every curve contains at most two vertices and these

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

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?

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.

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

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

Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

Coloring Eulerian triangulations of the projective plane

Coloring Eulerian triangulations of the projective plane Bojan Mohar 1 Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia bojan.mohar@uni-lj.si Abstract A simple characterization

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

CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992

CS268: Geometric Algorithms Handout #5 Design and Analysis Original Handout #15 Stanford University Tuesday, 25 February 1992 Original Lecture #6: 28 January 1991 Topics: Triangulating Simple Polygons

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

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:

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

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

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

/ 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

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

Discrete Mathematics Problems

Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................

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

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

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

Intersection Dimension and Maximum Degree

Intersection Dimension and Maximum Degree N.R. Aravind and C.R. Subramanian The Institute of Mathematical Sciences, Taramani, Chennai - 600 113, India. email: {nraravind,crs}@imsc.res.in Abstract We show

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

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

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

Exponential time algorithms for graph coloring

Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].

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

Arrangements And Duality

Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,

Graph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency.

Mária Markošová Graph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency. Isomorphism of graphs. Paths, cycles, trials.

Week 2 Polygon Triangulation

Week 2 Polygon Triangulation What is a polygon? Last week A polygonal chain is a connected series of line segments A closed polygonal chain is a polygonal chain, such that there is also a line segment

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest.

2 Trees What is a tree? Forests and Trees: A forest is a graph with no cycles, a tree is a connected forest. Theorem 2.1 If G is a forest, then comp(g) = V (G) E(G). Proof: We proceed by induction on E(G).

Week 5 Integral Polyhedra

Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory

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

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.

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

Rational exponents in extremal graph theory

Rational exponents in extremal graph theory Boris Bukh David Conlon Abstract Given a family of graphs H, the extremal number ex(n, H) is the largest m for which there exists a graph with n vertices and

On an anti-ramsey type result

On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element

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

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

Lecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002

Lecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002 Eric Vigoda Scribe: Varsha Dani & Tom Hayes 1.1 Introduction The aim of this

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

Approximation Algorithms

Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

(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

The chromatic spectrum of mixed hypergraphs

The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex

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

MGF 1107 CH 15 LECTURE NOTES Denson. Section 15.1

1 Section 15.1 Consider the house plan below. This graph represents the house. Consider the mail route below. This graph represents the mail route. 2 Definitions 1. Graph a structure that describes relationships.

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,

Example 5.5. The heuristics are demonstrated with this example of n=5 vertices and distances in the following matrix:

39 5.3. HEURISTICS FOR THE TSP Notation: f = length of the tour given by the algortihm a f = length of the optimal tour min Most of the following heuristics are designed to solve symmetric instances of

IMO Training 2010 Russian-style Problems Alexander Remorov

Solutions: Combinatorial Geometry 1. No. Call a lattice point even if the sum of its coordinates is even, and call it odd otherwise. Call one of the legs first, and other one second. Then every time a

Collinear Points in Permutations

Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,

PROBLEM SET 7: PIGEON HOLE PRINCIPLE

PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.

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

Trees and Fundamental Circuits

Trees and Fundamental Circuits Tree A connected graph without any circuits. o must have at least one vertex. o definition implies that it must be a simple graph. o only finite trees are being considered

CSL851: Algorithmic Graph Theory Semester I Lecture 1: July 24

CSL851: Algorithmic Graph Theory Semester I 2013-2014 Lecture 1: July 24 Lecturer: Naveen Garg Scribes: Suyash Roongta Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer: These notes have

Divide-and-Conquer. Three main steps : 1. divide; 2. conquer; 3. merge.

Divide-and-Conquer Three main steps : 1. divide; 2. conquer; 3. merge. 1 Let I denote the (sub)problem instance and S be its solution. The divide-and-conquer strategy can be described as follows. Procedure

12. Visibility Graphs and 3-Sum Lecture on Monday 9 th

12. Visibility Graphs and 3-Sum Lecture on Monday 9 th November, 2009 by Michael Homann 12.1 Sorting all Angular Sequences. Theorem 12.1 Consider a set P of n points in the plane.

(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

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

Social Media Mining. Graph Essentials

Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures

1 Point Inclusion in a Polygon

Comp 163: Computational Geometry Tufts University, Spring 2005 Professor Diane Souvaine Scribe: Ryan Coleman Point Inclusion and Processing Simple Polygons into Monotone Regions 1 Point Inclusion in a

Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

Ramsey numbers for bipartite graphs with small bandwidth

Ramsey numbers for bipartite graphs with small bandwidth Guilherme O. Mota 1,, Gábor N. Sárközy 2,, Mathias Schacht 3,, and Anusch Taraz 4, 1 Instituto de Matemática e Estatística, Universidade de São

Long questions answer Advanced Mathematics for Computer Application If P= , find BT. 19. If B = 1 0, find 2B and -3B.

Unit-1: Matrix Algebra Short questions answer 1. What is Matrix? 2. Define the following terms : a) Elements matrix b) Row matrix c) Column matrix d) Diagonal matrix e) Scalar matrix f) Unit matrix OR

Definition 11.1. Given a graph G on n vertices, we define the following quantities:

Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define

Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

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

arxiv:1203.1525v1 [math.co] 7 Mar 2012

Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined

THE 0/1-BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER

THE 0/1-BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER JONATHAN P. MCCAMMOND AND GÜNTER ZIEGLER Abstract. In 1933 Karol Borsuk asked whether every compact subset of R d can be decomposed

Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

On-line Ramsey numbers

On-line Ramsey numbers David Conlon Abstract Consider the following game between two players, Builder and Painter Builder draws edges one at a time and Painter colours them, in either red or blue, as each

1. Sorting (assuming sorting into ascending order) a) BUBBLE SORT

DECISION 1 Revision Notes 1. Sorting (assuming sorting into ascending order) a) BUBBLE SORT Make sure you show comparisons clearly and label each pass First Pass 8 4 3 6 1 4 8 3 6 1 4 3 8 6 1 4 3 6 8 1

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!

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

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

Generalizing the Ramsey Problem through Diameter

Generalizing the Ramsey Problem through Diameter Dhruv Mubayi Submitted: January 8, 001; Accepted: November 13, 001. MR Subject Classifications: 05C1, 05C15, 05C35, 05C55 Abstract Given a graph G and positive

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

Mathematics for Algorithm and System Analysis

Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface

Introduction to Voronoi Diagrams

C.S. 252 Prof. Roberto Tamassia Computational Geometry Sem. II, 1992 1993 Lecture 13 Date: March 22, 1993 Scribe: Scott S. Snibbe 1 Introduction Introduction to Voronoi Diagrams This lecture introduces

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

Ph.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor

Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai

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

Clique coloring B 1 -EPG graphs

Clique coloring B 1 -EPG graphs Flavia Bonomo a,c, María Pía Mazzoleni b,c, and Maya Stein d a Departamento de Computación, FCEN-UBA, Buenos Aires, Argentina. b Departamento de Matemática, FCE-UNLP, La

Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

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:

Chapter 8 Independence

Chapter 8 Independence Section 8.1 Vertex Independence and Coverings Next, we consider a problem that strikes close to home for us all, final exams. At the end of each term, students are required to take

On end degrees and infinite cycles in locally finite graphs

On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel

7. Colourings. 7.1 Vertex colouring

7. Colourings Colouring is one of the important branches of graph theory and has attracted the attention of almost all graph theorists, mainly because of the four colour theorem, the details of which can