# GRAPH CONNECTIVITY. 9 Elementary Properties

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 9 Elementary Properties 30 GRAPH CONNECTIVITY 9 Elementary Properties Definition 9.1: A graph G is said to be connected if for every pair of vertices there is a path joining them. The maximal connected subgraphs are called components. Definition 9.2: The connectivity number κ(g) is defined as the minimum number of vertices whose removal from G results in a disconnected graph or in the trivial graph (=a single vertex). A graph G is said to be k-connected if κ(g) k. Clearly, if G is k-connected then V (G) k + 1 and for n, m > 2, κ(k n ) = n 1, κ(c n ) = 2, κ(p n ) = 1 and κ(k n,m ) = min(m, n). Definition 9.3: The connectivity number λ(g) is defined as the minimum number of edges whose removal from G results in a disconnected graph or in the trivial graph (=a single vertex). A graph G is said to be k-edge-connected if λ(g) k. Theorem 9.1 (Whitney): Let G be an arbitrary graph, then κ(g) λ(g) δ(g). Proof: Let v be a vertex with d(v) = δ(g), then removing all edges incident to v disconnects v from the other vertices of G. Therefore, λ(g) δ(g). If λ(g) = 0 or 1, then κ(g) = λ(g). On the other hand, if λ(g) = k 2, let x 1 y 1, x 2 y 2,...,x k y k are be the edges whose removal causes G to be disconnected (where some of the x i, resp. y i, vertices might be identical). Denote V 1 and V 2 as the components of this disconnected graph. Then, either V 1 contains a vertex v different from x 1, x 2,...,x k, meaning that removing x 1,..., x k causes v to be disconnected from V 2. Or, V 1 = {x 1,...,x k }, where

2 9 Elementary Properties 31 V 1 k (some x i s might be identical). Now, in this case, x 1 has at most k neighbors (being V 1 1 in V 1 and k ( V 1 1) in V 2 ). Moreover, λ(g) = k, thus, d(x 1 ) = k and the removal of the k neighbors of x 1 cause G to be disconnected. Let G be a graph of order n k If G is not k-connected then there are two disjoint sets of vertices V 1 and V 2, with V 1 = n 1 1, V 2 = n 2 1 and n 1 + n 2 + k 1 = n such that the vertices of V i have a degree of at most n i 1+k 1, i = 1, 2. (Indeed, the k 1 vertices that are not in V 1 V 2 separate the sets V 1 and V 2 ). Corollary 9.1 (Bondy (1969)): Let G be a graph with vertices x 1, x 2,..., x n, d(x 1 ) d(x 2 )... d(x n ). Suppose for some k, 0 k n, that d(x j ) j + k 1, for j = 1, 2,..., n 1 d(x n k+1 ), then G is k-connected. Proof: Suppose that G is not k-connected. Then V 1, V 2 V (G) such that V 1 V 2 =, V 1 = n 1, V 2 = n 2, n 1 + n 2 = n k + 1 and d(x) n i + k 2 for x V i. Now, X = {x j j n k + 1} is a set of k elements all with a degree larger than or equal to d(x n k+1 ). Hence, there is at least one x X (V 1 V 2 ). Without loss of generality, say in X V 2. Thus, n 2 d(x n k+1 )+1 (k 1) = d(x n k+1 ) k+2 and n 1 = n k+1 n 2 n 1 d(x n k+1 ). Take x j V 1 such that j is maximal (j n 1 ), then n 1 + k 1 d(x n1 ) d(x j ) n 1 + k 2 (by construction). Thus, if G is a graph with vertices x 1, x 2,..., x n, with d(x 1 )... d(x n ) = (G) and d(x j ) j for j = 1,...,n (G) 1, then G is connected. The reverse is, obviously, not true. Corollary 9.2 (Chartrand and Harary (1968)): Let G K n be a graph of order n, then κ(g) 2δ(G) + 2 n. Proof: Let k = 2δ(G) + 2 n. It suffices to show d(x j ) j + k 1, for j = 1,...,n 1 δ(g) (because d(x n k+1 ) δ(g)). This is certainly true if d(x j ) n 1 δ(g) + k 1 for all j = 1,..., n 1 δ(g) and n 1 δ(g) + k 1 = δ(g). Exercises 9.1: On graph connectivity:

3 9 Elementary Properties Give 4 graphs G 1, G 2, G 3 and G 4 such that 0 < κ(g 1 ) = λ(g 1 ) = δ(g 1 ), 0 < κ(g 2 ) < λ(g 2 ) = δ(g 2 ), 0 < κ(g 3 ) = λ(g 3 ) < δ(g 3 ), and 0 < κ(g 4 ) < λ(g 4 ) < δ(g 4 ). 2. Give a graph G such that κ(g) = 2δ(G) + 2 n > Determine the minimum e(n) such that all graphs with n vertices and e(n) edges are connected (= 1-connected). 4. Let G be a graph with n vertices and e edges, show κ(g) λ(g) 2e/n. 5. Let G be a graph with δ(g) n/2, then G connected. Moreover, λ(g) = δ(g) [Hint: Prove that any component C i of G, after removing λ(g) < δ(g) edges, contains at least δ(g) + 1 vertices.]. 6. Let G be any 3-regular graph, i.e., δ(g) = (G) = 3, then κ(g) = λ(g). Draw a 4-regular planar graph G such that κ(g) λ(g). Theorem 9.2: Given the integers n, δ, κ and λ, there is a graph G of order n such that δ(g) = δ, κ(g) = κ, and λ(g) = λ if and only if one of the following conditions is satisfied: 1. 0 κ λ δ < n/2, δ + 2 n κ λ = δ < n 1, 3. κ = λ = δ = n 1. Of course, if κ(g) = 0, then so is λ(g). Proof: Let G be any graph of order n with δ(g) = δ, κ(g) = κ, and λ(g) = λ. Then, (a) δ(g) < n/2, that is, condition 1 is true, or (b) n/2 δ(g) < n 1, meaning that 2δ 2 n/2 n 1, or 2δ +2 n 1. Thus, by Corollary 1.2 and Exercise we have condition 2. Or (c) if δ(g) = n 1, then G = K n and κ(g) = λ(g) = δ(g) = n 1. Thus we have to show that if condition 1, 2 or 3 is satisfied then there is a graph G with appropriate constants n, κ, λ, δ. Suppose that condition 1 holds. Let G 1 = K δ+1, G 2 = K n δ 1, u 1,...,u δ+1 G 1 and v 1,..., v δ+1 G 2 (notice, K δ+1 G 2 ). Next, set G = G 1 G 2 and add the edges u 1 v 1,...,u κ v κ and u κ+1 v 1,...,u λ v 1 to G. Then, κ(g) = κ, by removing the vertices v 1,...,v κ,

4 10 Menger s Theorem 33 λ(g) = λ, by removing the edges between G 1 and G 2, and δ(g) = δ, by considering the vertex u δ+1. Suppose that condition 2 holds. Let G 1 = K κ, G 2 = K a, G 3 = K b and G 0 = G 1 + (G 2 G 3 ), where a = (n κ)/2 and b = (n 1 κ)/2 (notice, a+b = n κ 1) 7. To construct G, add a vertex v to G 0 and joint it to the vertices of G 1 and to δ κ vertices of G 3 (this is possible because 2δ + 2 n κ implies that δ κ b). Then, κ(g) = κ, by removing the vertices of G 1, λ(g) = λ, by removing the edges to v, and δ(g) = δ, by considering the vertex v. Finally, if condition 3, holds, set G = K n. 10 Menger s Theorem Definition 10.1: The local connectivity κ(x, y) of two non-adjacent vertices is the minimum number of vertices separating x from y. If x and y are adjacent vertices, their local connectivity is defined as κ H (x, y) + 1 where H = G xy. Similarly, we define the local edge-connectivity λ(x, y). Clearly, κ(g) = min{κ(x, y) x, y G, x y}. The aim of this section is to discuss the fundamental connections between κ(x, y) and the set of xy paths. Two paths in a graph G are said to be independent if every common vertex is an endvertex of both paths. A set of independent xy paths is a set of paths any two of which are independent. Obviously, if there are k independent xy paths then κ(x, y) k. Menger s Theorem states that the converse is true. We prove the theorem by means of an elegant proof by Dirac (1969). Theorem 10.1 (Menger (1926)): Let x, y G, x y. There exists a set of κ(x, y) independent paths between x and y and this set is maximal. Proof: We use induction on m = n + e, the sum of the number of vertices and edges in G. We show that if S = {w 1, w 2,..., w k } is a minimum set (that is, a subset of the smallest size) that separates x and y, then G has at least k independent paths between x and y. The case for k = 1 is clear, and this takes care of the small values of m, required for the induction. (1) Assume that x and y have a common neighbor z Γ(x) Γ(y). Then necessarily z S. In the smaller graph G z the set S z is a minimum 7 G+H is used here to reflect the graph obtained by G H and adding an edge between every vertex x G and y H

5 10 Menger s Theorem 34 set that separates x and y, and so the induction hypothesis yields that there are k 1 independent paths between x and y in G z. Together with the path xzy, there are k independent paths in G as required. (2) Assume that Γ(x) Γ(y) = and denote by H x and H y as the connected components of G S for x and y, respectively. (2a) Suppose that the separating set S Γ(x) and S Γ(y). Let z be a new vertex, and define G z to be the graph with the vertices V (H x S z) having the edges of G[H x S] together with the edges zw i for all i = 1,...,k. The graph G z is connected and it is smaller than G. Indeed, in order for S to be a minimum separating set, all w i vertices have to be adjacent to some vertex in H y. This shows that e(g z ) e(g) and, moreover, assumption (2a) rules out the case H y = y, therefore n(g z ) < n(g) in the present case. If T is any set that separates x and z in G z, then T will separate x from all w i S (T S) in G. This means that T separates x and y in G. Since k is the size of a minimum separating set, T = k. We noted that G z is smaller than G, and thus by the induction hypothesis, there are k independent paths from x to z in G z. This is possible only if there exist k independent paths from x to w i, for i = 1,..., k, in H x. Using a symmetric argument one finds k independent paths from y to w i in H y. Combining these paths proves the theorem. (2b) Suppose that all separating sets S are a subset of Γ(x) or Γ(y). Let P be the shortest path from x to y in G, then P contains at least 4 vertices, we refer to the second and third node as u and v. Define G n as G uv (that is, remove the edge between u and v). If the smallest set T that separates x from y in G n has a size k, then by induction, we are done. Suppose that T < k, then x and y are still connected in G T and every path from x to y in G T necessarily travels along the edge uv. Therefore, u, v T. Also, T u = T u and T v = T v are both minimum separating sets in G (of size k). Thus, T v Γ(x) or T v Γ(y) (by (2b)). Now, P is the shortest path, so v Γ(x), hence, T v Γ(y). Moreover, u Γ(x), thus T u Γ(x). Combining these two results we find T Γ(x) Γ(y) (and T is not empty). Which contradicts assumption (2). The set is maximal, because the existence of k independent paths between x and y implies that κ(x, y) k. Another way to state this result is the following: A necessary and sufficient condition for a graph to be k-connected is that any two distinct vertices x and y can be joined by k independent paths.

6 11 Additional Exercises 35 Exercises 10.1: On Menger s Theorem: Let G be a graph with G k +1, then G is k-connected if and only if for all k-element subsets V 1, V 2 V (G), there is a set of k paths from V 1 to V 2 which have no vertex in common. [V 1 V 2 is not necessarily empty, thus, some paths might be trivial paths]. Let U be a set of vertices of a graph G and let x be a vertex not in U. An xu fan is defined as a set of U paths from x to U, any two of which have only the vertex x in common. Theorem 10.2 (Dirac (1960)): A graph G is k-connected if and only if G k + 1 and for any k-set U V (G) and x V (G) U, there is an xu fan. Proof: (a) Suppose that G is k-connected, U V (G), U = k and x V (G) U. Let H be the graph obtained from G by adding a vertex y and joining y to every vertex in U. Clearly, H is also k-connected. Therefore, by Menger s theorem, we find that there are k independent xy paths in H. Omitting the edges incident with y, we find the required xu fan. (b) Suppose G k + 1 and that S is a (k 1)-set separating x and y, for some vertices x and y. Then, G does not contain an x(s y) fan. Exercises 10.2: On Dirac s Theorem: 1. If G is k-connected (k 2), then for any set of k vertices {a 1,...,a k } there is a cycle containing all of them. [Hint: Use induction on k and distinguish between the case where the cycle C contains an additional vertex x {a 1,..., a k 1 } and the case where it does not.] 2. Give an example of a graph for which there is for any set of k points, a cycle containing all of them, but that is not k-connected (k > 2). 11 Additional Exercises Definition 11.1: Let k 1. Consider the set B k of all binary sequences of length k. For instance, B 3 = {000; 001; 010; 100; 011; 101; 110; 111}. Let Q k be the graph (called the k-cube) with V (Q k ) = B k, where uv E(Q k ) if and only if the sequences u and v differ in exactly one place.

7 11 Additional Exercises 36 Exercises 11.1: On k-cube graphs Q k : Determine the order of Q k. Show that Q k is regular, and determine e(q k ) for each k 1. Compute χ(q k ) for all k 1. Prove that κ(q k ) = λ(q k ) = δ(q k ) = k [Hint: use induction on k. Consider the graphs G 0 and G 1 induced by the vertices 0u and 1u, respectively. Let S be a minimal set that disconnects Q k, then S must disconnect G 0 or G 1 ]. Determine the k values for which Q k is planar.

### Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

### 3. Eulerian and Hamiltonian Graphs

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

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

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

### Connectivity and cuts

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

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

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

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

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

### ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

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

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

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

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

### An inequality for the group chromatic number of a graph

An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

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

### SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

### ZERO-DIVISOR AND IDEAL-DIVISOR GRAPHS OF COMMUTATIVE RINGS

ZERO-DIVISOR AND IDEAL-DIVISOR GRAPHS OF COMMUTATIVE RINGS T. BRAND, M. JAMESON, M. MCGOWAN, AND J.D. MCKEEL Abstract. For a commutative ring R, we can form the zero-divisor graph Γ(R) or the ideal-divisor

### The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

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

### P. Jeyanthi and N. Angel Benseera

Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel

### Full and Complete Binary Trees

Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full

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

### Class One: Degree Sequences

Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of

### Mathematical Induction

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

### Non-Separable Detachments of Graphs

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2001-12. Published by the Egrerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.

### 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...............................

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

### When is a graph planar?

When is a graph planar? Theorem(Euler, 1758) If a plane multigraph G with k components has n vertices, e edges, and f faces, then n e + f = 1 + k. Corollary If G is a simple, planar graph with n(g) 3,

### 1. Determine all real numbers a, b, c, d that satisfy the following system of equations.

altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c

### Analysis of Algorithms, I

Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadth-first search (BFS) 4 Applications

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

### SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

### On the crossing number of K m,n

On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

### Single machine parallel batch scheduling with unbounded capacity

Workshop on Combinatorics and Graph Theory 21th, April, 2006 Nankai University Single machine parallel batch scheduling with unbounded capacity Yuan Jinjiang Department of mathematics, Zhengzhou University

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### Tenacity and rupture degree of permutation graphs of complete bipartite graphs

Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

### POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).

### 3. Mathematical Induction

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

### An inequality for the group chromatic number of a graph

Discrete Mathematics 307 (2007) 3076 3080 www.elsevier.com/locate/disc Note An inequality for the group chromatic number of a graph Hong-Jian Lai a, Xiangwen Li b,,1, Gexin Yu c a Department of Mathematics,

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

### GRAPH THEORY LECTURE 4: TREES

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

### Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

### 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.

### Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers

### PART I. THE REAL NUMBERS

PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS

### Degree Hypergroupoids Associated with Hypergraphs

Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

### Week 5: Binary Relations

1 Binary Relations Week 5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all

### Odd induced subgraphs in graphs of maximum degree three

Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing

### 8. Matchings and Factors

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

### Resource Allocation with Time Intervals

Resource Allocation with Time Intervals Andreas Darmann Ulrich Pferschy Joachim Schauer Abstract We study a resource allocation problem where jobs have the following characteristics: Each job consumes

### Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

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

### Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

### Data Structures and Algorithms Written Examination

Data Structures and Algorithms Written Examination 22 February 2013 FIRST NAME STUDENT NUMBER LAST NAME SIGNATURE Instructions for students: Write First Name, Last Name, Student Number and Signature where

### M-Degrees of Quadrangle-Free Planar Graphs

M-Degrees of Quadrangle-Free Planar Graphs Oleg V. Borodin, 1 Alexandr V. Kostochka, 1,2 Naeem N. Sheikh, 2 and Gexin Yu 3 1 SOBOLEV INSTITUTE OF MATHEMATICS NOVOSIBIRSK 630090, RUSSIA E-mail: brdnoleg@math.nsc.ru

### Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

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

### 5 Directed acyclic graphs

5 Directed acyclic graphs (5.1) Introduction In many statistical studies we have prior knowledge about a temporal or causal ordering of the variables. In this chapter we will use directed graphs to incorporate

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

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

### On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

### Lecture Notes on GRAPH THEORY Tero Harju

Lecture Notes on GRAPH THEORY Tero Harju Department of Mathematics University of Turku FIN-20014 Turku, Finland e-mail: harju@utu.fi 1994 2011 Contents 1 Introduction..........................................................

### Pythagorean Triples Pythagorean triple similar primitive

Pythagorean Triples One of the most far-reaching problems to appear in Diophantus Arithmetica was his Problem II-8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2

### SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE

SHOT YLE OVES OF PHS WITH MINIMUM DEEE THEE TOMÁŠ KISE, DNIEL KÁL, END LIDIKÝ, PVEL NEJEDLÝ OET ŠÁML, ND bstract. The Shortest ycle over onjecture of lon and Tarsi asserts that the edges of every bridgeless

### Product irregularity strength of certain graphs

Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer

### . 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We

### A New Approach to Dynamic All Pairs Shortest Paths

A New Approach to Dynamic All Pairs Shortest Paths Camil Demetrescu Giuseppe F. Italiano Abstract We study novel combinatorial properties of graphs that allow us to devise a completely new approach to

### SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces

### R u t c o r Research R e p o r t. Boolean functions with a simple certificate for CNF complexity. Ondřej Čepeka Petr Kučera b Petr Savický c

R u t c o r Research R e p o r t Boolean functions with a simple certificate for CNF complexity Ondřej Čepeka Petr Kučera b Petr Savický c RRR 2-2010, January 24, 2010 RUTCOR Rutgers Center for Operations

### SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

### Sample Induction Proofs

Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given

### Special Classes of Divisor Cordial Graphs

International Mathematical Forum, Vol. 7,, no. 35, 737-749 Special Classes of Divisor Cordial Graphs R. Varatharajan Department of Mathematics, Sri S.R.N.M. College Sattur - 66 3, Tamil Nadu, India varatharajansrnm@gmail.com

### Tree-representation of set families and applications to combinatorial decompositions

Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no

### A Study of Sufficient Conditions for Hamiltonian Cycles

DeLeon 1 A Study of Sufficient Conditions for Hamiltonian Cycles Melissa DeLeon Department of Mathematics and Computer Science Seton Hall University South Orange, New Jersey 07079, U.S.A. ABSTRACT A graph

### Fundamentals of Media Theory

Fundamentals of Media Theory ergei Ovchinnikov Mathematics Department an Francisco tate University an Francisco, CA 94132 sergei@sfsu.edu Abstract Media theory is a new branch of discrete applied mathematics

### Total colorings of planar graphs with small maximum degree

Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong

### AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.

### THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

### 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].

### THIN GROUPS OF FRACTIONS

Contemporary Mathematics THIN GROUPS OF FRACTIONS Patrick DEHORNOY Abstract. A number of properties of spherical Artin Tits groups extend to Garside groups, defined as the groups of fractions of monoids

### No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results