# DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

Save this PDF as:

Size: px
Start display at page:

Download "DO NOT RE-DISTRIBUTE THIS SOLUTION FILE"

## Transcription

1 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 be able to do: 5..38, 5..47, 5.3.4(a) DO NOT RE-DISTRIBUTE THIS SOLUTION FILE 5..0 (!) Let G be a graph whose odd cycles are pairwise intersecting, meaning that every two odd cycles in G have a common vertex. Prove that χ(g) 5. Proof : Let G = (V, E) be a graph whose odd cycles are pairwise intersecting. (If G has no odd cycle, then G is bipartite and hence -colorable, implying χ(g) 5; so we assume G has at least one odd cycle.) Let C be a shortest odd cycle in G. Let G = G V(C). Since all odd cycles are pairwise intersecting, when we remove V(C) from G, we delete at least one vertex from every odd cycle of G. So it follows that G has no odd cycles and hence is bipartite. Any bipartite graph is -colorable, so we have χ(g ). In addition, since C is a shortest odd cycle, the graph induced by V(C) does not contain any chords, i.e., does not contain any edges besides those in the cycle itself. It follows then that χ(g[v(c)]) = χ(c) = 3. Thus, we can color G by coloring the vertices of G with colors and the vertices of C with 3 colors, distinct from the previous two used in G. So χ(g) χ(g V(C)) + χ(g[v(c)]) = χ(g ) + χ(c) + 3 = 5 Therefore, we have shown that χ(g) 5. Proof : We prove the contrapositive statement: If G is a graph with χ(g) 6, then there exist two odd cycles in G that are disjoint, i.e., that have no common vertex. Suppose χ(g) 6, and consider an optimal coloring of G where the colors are labeled,, 3,..., χ(g). The subgraph induced by vertices colored,, and 3 must have an odd cycle C, else it would have been bipartite and we could replace these three colors by two. Similarly, the subgraph induced by vertices colored 4, 5, and 6 in the optimal coloring must also have an odd cycle C. The two odd cycles C and C are disjoint since no vertex of C has the same color as a vertex of C. In other words, the induced subgraph G[V(C)] is isomorphic to an odd cycle.

2 Variation of problem 5..5 (+) Let G be the unit-distance graph in the plane ; V(G) = R, and two points are adjacent if their Euclidean distance is. (This is an infinite graph.) (a) Prove that χ(g) 3. (b) Prove that χ(g) 4. (Hint: Find a finite graph H that is a subgraph of G and has chromatic number 4.) (c) Prove that χ(g) 9. (Hint: Tile the plane with squares having side length 0.6.) (d) Prove that χ(g) 7. (Hint: Use a different tiling of the plane, paying attention to the boundaries.) Remark: The Hadwiger-Nelson problem seeks the minimum number of colors needed to color the unit-distance graph in the plane. This problem is still open and currently all that can be said is that 4 χ(g) 7, which is what you will prove in parts (b) and (d) above. Let G = (V, E) be the unit-distance graph. (a) Since an equilateral triangle may have side lengths all of, K 3 is a subgraph of G. Thus, χ(g) ω(g) 3. (b) We seek a (finite) 4-chromatic subgraph of G to show that χ(g) 4. Consider the graph H known as the Moser spindle: v Notice that we can construct the graph at left as follows: adjoin equilateral triangles along one side, duplicate this figure, x y join two identical figures at a single vertex v, fix the position of vertex v, rotate the figures until the bottom vtcs x and y are distance apart. Then all the edges in H are length, making H a subgraph of G. Given the coloring shown, we see that χ(h) 4. Also, since α(h) =, we have that χ(h) V(H) α(h) = 7 > 3, implying that χ(h) 4. Combining these two inequalities, we conclude that χ(h) = 4. Since H is a subgraph of G, it follows that χ(g) 4. Alternative: The Golomb graph is another 4-chromatic subgraph of G.

3 (c) To prove the upper bound, χ(g) 9, we construct a 9-coloring of G by tiling the plane using squares of side length 0.6. Note that each square of side length 0.6 has a diagonal length of (0.6) <, so no two points inside (or or on the border of) the square are distance apart. (d) We prove the upper bound, χ(g) 7, by exhibiting a proper 7-coloring of G. Since G is an infinite graph, we color the graph by regions, based on a tessellation of the plane using hexagons (!) Prove that every k-chromatic graph has at least ( k ) edges. Use this to prove that if G is the union of m complete graphs of order m, then χ(g) + m m. Suppose, for sake of contradiction, that G = (V, E) is a k-chromatic graph with E < ( k ). Let S = {,,..., k} be the set of k colors in a minimum coloring of G. Then since ( k ) is the number of pairs of distinct elements of S and E < ( k ), there exists a pair of colors i, j S such that no edge in E has endpoints with the colors i, j. In other words, no vertex of color i is adjacent to a 3

4 vertex of color j. This suggests that we can replace all vertices of color j with color i to form a new proper coloring of G that uses only (k ) colors.. This contradicts the assumption that G is k-chromatic. Therefore, it is true that G has at least ( k ) edges. Assume G = (V, E) is the union of m complete graphs of order m, where m. (This means each of the complete graphs has ( m ) edges.) Since the upper bound of edges in G occurs when the union of complete graphs is of disjoint sets of edges, we have E m ( m ). In addition, suppose χ(g) = k. We know from our previous argument that E ( k ). We have k(k ) = ( ) k E and E m k(k ) m (m ) m (m ) + m m ( ) m = m (m ) (m m + )(m m ) χ(g) = k m m + Alternative Approach: Using quadratic formula, k(k ) m (m ) = k k (m (m )) 0 + 4m (m ) k + + 4m (m ) k + 4 ( + 4m (m )) m (m ) m (m )) ( ) χ(g) = k + m m ( ) Note: For nonnegative real numbers a, b, we have a + b a + ab + b a + b ( a + b) a + b a + b 5..9 (!) Prove that if G is a color-critical graph, then the graph G generated from it by applying Mycielski s construction is also color-critical. 4

5 Suppose G is k-critical, and let G be the graph generated from G via Mycielski s construction. Since G is k-critical, we know that χ(g) = k, χ(g e) k for all e E(G), and χ(g v) k for all v V(G). We claim that G is (k + )-critical. We know, from the proof of Mycielski s theorem, that χ(g ) = k +. Then, to show that G is (k + )-critical, it is sufficient to show that χ(g e) k for all edges e E(G ). To do this, we consider three types of edges in G (notation used below comes from description of Mycielski s construction in class). Case : e = wu i for some i. Since χ(g v i ) k, consider a coloring of G v i using k colors {,,..., k }. Then extend this to a k-coloring of G e in the following way: assign v i color k, assign u l the color of v l for all l, and assign w color k. The only three vertices to have color k are v i, u i and w, but since no two of these are adjacent in G e, we have a proper k-coloring of G e. Case : e = v i v j for some i = j. Since χ(g e) k, consider a coloring of G e using k colors {,,..., k }. Then extend this to a k-coloring of G e in the following way: assign u l the color k for all l, and assign w color. Since the vertices in {u l : l V(G) } form an independent set and are precisely the set of neighbors of w, we have a proper k-coloring of G e. Case 3: e = v i u j for some i = j. If the edge e = v i u j exists in G, then it must be that v i v j in G (based on definition of Mycielski construction). Since χ(g v i v j ) k, consider a coloring of G v i v j using k colors {,,..., k }. Notice that v i and v j must have the same color in this coloring; otherwise, this coloring would be a proper coloring of G, implying that χ(g) k, which is not the case. Extend this coloring to a k-coloring of G e in the following way: assign u l the color of v l for all l, change color of v j to color k, and assign w color k. This is a proper k-coloring of G e. In each case, we have that χ(g e) k as desired. 5

6 5.3.3 (-) Prove that k 4 4k 3 + 3k is not a chromatic polynomial of any graph. Solution : If the polynomial p(k) = k 4 4k 3 + 3k was a chromatic polynomial for some graph G, then when evaluated at a positive integer k, it would give the number of ways of coloring the graph G with k colors. Note that p() = 4 < 0, so it cannot count the proper -colorings in any graph, which implies that p(k) cannot be a chromatic polynomial of any graph. Solution : Alternatively, in χ(g; k), the degree is V(G), and the second coefficient is E(G). Hence we seek a 4-vertex graph with four edges. The only such graphs are C 4 and the paw, seen in Figure, which have chromatic polynomials k(k )(k 3k + 3) and k(k ) (k ), respectively. In particular, neither are equal to the given polynomial. G Figure : The paw graph. L(G) (!) Prove that the number of proper k-colorings of a connected graph G is less than k(k ) n if k 3 and G is not a tree. What happens when k =? If G is connected but not a tree, let T be a spanning tree of G, and choose e E(G) E(T) with e = uv. Every proper coloring of G must be a proper coloring of the subgraph T, and there are exactly k(k ) n proper k-colorings of T by Proposition It suffices to show that at least one of these is not a proper k-coloring of G. Since T is bipartite and k 3, we can construct such a coloring by taking a -coloring of T and changing the endpoints of e, u and v, to a third color. While this is still a proper k-coloring of T (edge e = uv does not exist in T), it is not a proper k-coloring of G since u v in G. If k =, then T has exactly two proper -colorings, and these are both proper colorings of G if G is bipartite. (If G is not bipartite, then the given statement still holds when k =.) The number a(g) of acyclic orientations of G satisfies the recurrence a(g) = a(g e) + a(g e). The number of spanning trees of G appears to satisfy the same recurrence; does the number of acyclic orientations of G always equal the number of spanning trees? Why or why not? We know τ(g) satisfies the recurrence τ(g) = τ(g e) + τ(g e). This is the recurrence satisfied by a(g), but the initial conditions are different. An edgeless graph has one acyclic orientation (the empty one), but it has no spanning tree unless it has only one vertex. 6

7 A connected graph containing a loop has spanning trees but no acyclic orientation. A tree of order n has one spanning tree and n acyclic orientations. The complete graph K n has n n spanning trees and n! acyclic orientations; n n > n! if n Use Brooks Theorem on an appropriate graph to prove that if G is a simple graph with (G) = 3, then G is 4-edge-colorable. (Comment: The result is a special case of Vizing s Theorem; do not use Vizing s Theorem to prove this.) Suppose G is a simple graph with (G) = 3. Assume G is connected. (If G is not connected, then repeat the subsequent argument for each component of G.) Consider the line graph L(G). Since G is connected, L(G) is connected, and (G) = 3 implies that an edge of G is incident to at most other edges at each of its endpoints, so (L(G)) 4. Note that if L(G) is a 4-regular graph, then it must be that G is a 3-regular (simple) graph. This implies that G has at least 6 edges and so L(G) has at least 6 vertices, so L(G) is not K 5. We consider three cases. Case : L(G) is an odd cycle. Then χ(l(g)) = 3. Case : L(G) is a complete graph. Then L(G) has at most 4 vertices, and so χ(l(g)) 4. Case 3: L(G) is neither an odd cycle nor a complete graph. By Brooks Theorem, it follows that χ(l(g)) (L(G)) 4. Finally we have so G is 4-edge-colorable. χ (G) = χ(l(g)) 4 7

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

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

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

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

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

### UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE

UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs

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

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

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

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

### Small Maximal Independent Sets and Faster Exact Graph Coloring

Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science The Exact Graph Coloring Problem: Given an undirected

### Mathematical induction. Niloufar Shafiei

Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of

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

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

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

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

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

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

### The degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

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

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

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

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

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

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

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

### Lecture 3: Linear Programming Relaxations and Rounding

Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can

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

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

### Divisor graphs have arbitrary order and size

Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G

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

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

### Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

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

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

### The Geometer s Sketchpad: Non-Euclidean Geometry & The Poincaré Disk

The Geometer s Sketchpad: Non-Euclidean Geometry & The Poincaré Disk Nicholas Jackiw njackiw@kcptech.com KCP Technologies, Inc. ICTMT11 2013 Bari Overview. The study of hyperbolic geometry and non-euclidean

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

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

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

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

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

### Mathematical Induction. Mary Barnes Sue Gordon

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

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

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

### The Pointless Machine and Escape of the Clones

MATH 64091 Jenya Soprunova, KSU The Pointless Machine and Escape of the Clones The Pointless Machine that operates on ordered pairs of positive integers (a, b) has three modes: In Mode 1 the machine adds

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

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

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

### BOUNDARY EDGE DOMINATION IN GRAPHS

BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 0-4874, ISSN (o) 0-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 197-04 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

### Minimum degree condition forcing complete graph immersion

Minimum degree condition forcing complete graph immersion Matt DeVos Department of Mathematics Simon Fraser University Burnaby, B.C. V5A 1S6 Jacob Fox Department of Mathematics MIT Cambridge, MA 02139

### Math 181 Handout 16. Rich Schwartz. March 9, 2010

Math 8 Handout 6 Rich Schwartz March 9, 200 The purpose of this handout is to describe continued fractions and their connection to hyperbolic geometry. The Gauss Map Given any x (0, ) we define γ(x) =

### High degree graphs contain large-star factors

High degree graphs contain large-star factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a

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

### A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

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

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

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

### Induction Problems. Tom Davis November 7, 2005

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

### Degree-associated reconstruction parameters of complete multipartite graphs and their complements

Degree-associated reconstruction parameters of complete multipartite graphs and their complements Meijie Ma, Huangping Shi, Hannah Spinoza, Douglas B. West January 23, 2014 Abstract Avertex-deleted subgraphofagraphgisacard.

### Outline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1

GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept

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

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

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

### SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH

CHAPTER 3 SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH ABSTRACT This chapter begins with the notion of block distances in graphs. Using block distance we defined the central tendencies of a block, like B-radius

### COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS

COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics

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

### In this lesson you will learn to find zeros of polynomial functions that are not factorable.

2.6. Rational zeros of polynomial functions. In this lesson you will learn to find zeros of polynomial functions that are not factorable. REVIEW OF PREREQUISITE CONCEPTS: A polynomial of n th degree has

### Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

### Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

### Zeros of a Polynomial Function

Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we

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

### TOURING PROBLEMS A MATHEMATICAL APPROACH

TOURING PROBLEMS A MATHEMATICAL APPROACH VIPUL NAIK Abstract. The article surveys touring, a problem of fun math, and employs serious techniques to attack it. The text is suitable for high school students

### An Introduction to Combinatorics and Graph Theory. David Guichard

An Introduction to Combinatorics and Graph Theory David Guichard This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/3.0/

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

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

### Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

### Sets and set operations

CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square asic discrete structures Discrete math = study of the discrete structures used

### Real Roots of Univariate Polynomials with Real Coefficients

Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials

### Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

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

### Tools for parsimonious edge-colouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR-2010-10

Tools for parsimonious edge-colouring of graphs with maximum degree three J.L. Fouquet and J.M. Vanherpe LIFO, Université d Orléans Rapport n o RR-2010-10 Tools for parsimonious edge-colouring of graphs

### 39 Symmetry of Plane Figures

39 Symmetry of Plane Figures In this section, we are interested in the symmetric properties of plane figures. By a symmetry of a plane figure we mean a motion of the plane that moves the figure so that

### Foundations of Geometry 1: Points, Lines, Segments, Angles

Chapter 3 Foundations of Geometry 1: Points, Lines, Segments, Angles 3.1 An Introduction to Proof Syllogism: The abstract form is: 1. All A is B. 2. X is A 3. X is B Example: Let s think about an example.

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

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

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

### PYTHAGOREAN TRIPLES KEITH CONRAD

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

### 4. An isosceles triangle has two sides of length 10 and one of length 12. What is its area?

1 1 2 + 1 3 + 1 5 = 2 The sum of three numbers is 17 The first is 2 times the second The third is 5 more than the second What is the value of the largest of the three numbers? 3 A chemist has 100 cc of

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

### Lines That Pass Through Regions

: Student Outcomes Given two points in the coordinate plane and a rectangular or triangular region, students determine whether the line through those points meets the region, and if it does, they describe

### Markov random fields and Gibbs measures

Chapter Markov random fields and Gibbs measures 1. Conditional independence Suppose X i is a random element of (X i, B i ), for i = 1, 2, 3, with all X i defined on the same probability space (.F, P).

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

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

### CS311H. Prof: Peter Stone. Department of Computer Science The University of Texas at Austin

CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework

### Shortcut sets for plane Euclidean networks (Extended abstract) 1

Shortcut sets for plane Euclidean networks (Extended abstract) 1 J. Cáceres a D. Garijo b A. González b A. Márquez b M. L. Puertas a P. Ribeiro c a Departamento de Matemáticas, Universidad de Almería,

### Finding and counting given length cycles

Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected

### Angles that are between parallel lines, but on opposite sides of a transversal.

GLOSSARY Appendix A Appendix A: Glossary Acute Angle An angle that measures less than 90. Acute Triangle Alternate Angles A triangle that has three acute angles. Angles that are between parallel lines,

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