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

Save this PDF as:

Size: px
Start display at page:

Download "Cycles in a Graph Whose Lengths Differ by One or Two"

## Transcription

1 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 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS UNIVERSITY OF FLORIDA GAINESVILLE, FL U.S.A This note is dedicated to the memory of our friend and colleague Paul Erdős. Received July 5, 1996 Abstract: Several problems concerning the distribution of cycle lengths in a graph have been proposed by P. Erdös and colleagues. In this note two variations of the following such question are answered. In a simple graph where every vertex has degree at least three, must there exist two cycles whose lengths differ by one or two? c 1998 John Wiley & Sons, Inc. J Graph Theory 27: 11 15, INTRODUCTION Several questions concerning the distribution of cycle lengths in a graph have been posed by P. Erdős and colleagues. One of these questions is the following. Question. In a simple graph where every vertex has degree at least three, must there exist two cycles whose lengths differ by one or two? Other open problems concerning the existence of cycles of specified length are mentioned by Erdős in [2]. For example, Erdős and A. Gyárfás asked: If G is a graph with minimum degree three, must G have a cycle of length 2 r for some integer r? More generally, Erdős asked (and c 1998 John Wiley & Sons, Inc. CCC /98/

2 12 JOURNAL OF GRAPH THEORY offered \$100) for a proof of the existence or nonexistence of a sequence a 1 <a 2 < of density 0 and an absolute constant c for which every graph on n vertices and cn edges contains a cycle of length a i for some i. In this note, the above Question is answered in the affirmative. The conclusion cannot be strengthened to two cycles whose lengths differ by one because, in a bipartite graph, two such cycles do not exist. However, the assertion can be pushed in two directions, given in the following two theorems. Let K n,c n,p n denote the complete graph, cycle and path, respectively, on n vertices, and let K m,n denote the complete bipartite graph with parts of sizes m and n. Theorem 1. With the exception of K 1 and K 2, every simple graph having at most two vertices of degree less than three contains two cycles whose lengths differ by one or two. Theorem 2. Every nonbipartite 3-connected graph has two cycles whose lengths differ by one. Theorem 1 is best possible in the sense that each of the graphs C 3,P 3 and K 2,3 have three vertices of degree less than three but contain no two cycles whose lengths differ by one or two. However, if one allows additional exceptions, then Theorem 1 can be extended. With exactly twelve exceptions, every simple graph having at most three vertices of degree less than three contains two cycles whose lengths differ by one or two. In addition to K 1 and K 2, the exceptions are C 3,P 3 and K 2,3, and the seven graphs obtained from C 3,P 3 and K 2,3 by attaching a single pendant edge to one or more vertices of degree two. The proof of this result proceeds exactly as in the proof in Section 2 of Theorem 1, but requires a tedious case by case analysis of the exceptional graphs in the induction step. Similar results can likely be obtained for four or five vertices of degree less than three, if one can determine the exceptions and has the perseverance to carry out the case by case analysis. The following question, however, is open. Conjecture. Let k be any nonnegative integer. With finitely many exceptions, every simple graph having at most k vertices of degree less than three has two cycles whose lengths differ by one or two. Concerning Theorem 2, the 3-connectedness requirement is necessary. If it is assumed instead that G is 2-connected and, in addition, that every vertex has degree at least d, the corresponding statement is false. The counterexample (for d =3) in Figure 1 has only cycles of lengths 4, 6, 9, 11, 13 and 15. This example can easily be generalized to an infinite family of counterexamples by attaching a sufficiently large odd number of copies of K d,d e in a ring, as in the figure. FIGURE 1. A counterexample.

3 CYCLES IN A GRAPH 13 A natural extension of Theorem 2 would be a condition guaranteeing the existence of cycles of three more more consecutive lengths. The only nonbipartite 3-connected graphs that we know of without cycles of three consecutive lengths are K 4 and the Petersen graph. Problem. Does there exist a function f(k) such that every nonbipartite 3-connected graph with minimum degree at least f(k) contains cycles of k consecutive lengths? 2. THE PROOFS The proofs of Theorems 1 and 2 rely on the two lemmas which are based on an approach of Thomassen and Toft [4] to nonseparating cycles in graphs. The terminology of bridges is originally due to Tutte [5] (also see Bondy and Murty [1], Voss [6] or West [7]). Let C be a cycle in a graph. A C-bridge is either (1) an edge not in C whose endpoints are in C or (2) a component of G V (C) together with the edges (and vertices of attachment) that connect it to C. The vertices of the bridge that are not vertices of attachment are called internal vertices. Two C-bridges A and B are said to conf lict if either (1) they have three common vertices of attachment or (2) there are four vertices v 1,v 2,v 3,v 4 in cyclic order on C such that v 1,v 3 are vertices of attachment of A and v 2,v 4 are vertices of attachment of B. TwoC-bridges that do not conflict are said to avoid each other. Lemma 1. Let G be a 2-connected graph, not a cycle, and let C be an induced cycle in G some bridge B of which has as many internal vertices are possible. Then either (1) B is the only C-bridge, or else (2) B is a C-bridge with exactly two vertices of attachment, and every other C-bridge is a path having the same two vertices of attachment to C as B. Proof. Let B be any C-bridge different from B. Denote by S and S the sets of vertices of attachment of B and B, respectively, to C. Because G is 2-connected, S 2 and S 2. Let x, y S and let P be an xy-path in B. We claim that S = {x, y}, and hence that S = {x, y} too. Suppose, to the contrary, that S {x, y}, and consider z S \{x, y}. Denote by P the xy-segment of C not including z. Since P P is a cycle, there is an induced cycle C with V (C ) V (P P ). One of the bridges of C has as internal vertices all the internal vertices of B and, in addition, the vertex z, contradicting the maximality hypothesis on C. We conclude that S = {x, y}. Similar reasoning shows that neither B x nor B y contains an induced cycle. Therefore B {x, y} is a tree having at most one vertex adjacent to each of x and y. It readily follows from the 2-connectedness of G that B = P. Lemma 2. Let G be a nonbipartite 2-connected graph, not a cycle, and let C be an induced odd cycle in G some bridge B of which has as many internal vertices as possible. Then every other bridge of C is bipartite and avoids B. Proof. Let B be a C-bridge different from B. Denote by S and S the sets of vertices of attachment of B and B, respectively, to C. Because G is 2-connected, S 2 and S 2. Let x, y S. Neither B x nor B y contains an induced odd cycle because one of the bridges of such a cycle would have as internal vertices all the internal vertices of B as well as x or y, respectively, contradicting the maximality hypothesis on C. The connectedness of B {x, y} now implies that B itself is bipartite.

4 14 JOURNAL OF GRAPH THEORY Let P be any xy-path in B, and let P be the xy-path in C for which the cycle P P is odd. Let C be an induced odd cycle with V (C ) V (P P ). The cycle C has a bridge whose internal vertices include all the internal vertices of B. By the maximality hypothesis on C, one deduces that S V (P ). If x and y are the only vertices of attachment of B to C, then it is clear that B and B avoid one another, as claimed. Therefore, suppose that S 3, and let the vertices of S, in cyclic order on C, bev 1,v 2,...,v m. For 1 i m, denote by P i the v i v i+1 -segment of C, and let P i be a v iv i+1 -path in B (indices modulo m). Because C is odd, m i=1 E(P i) is odd, and because B is bipartite, m i=1 E(P i ) is even. It follows that the cycle P i P i is odd for some i, 1 i m. As noted above, this implies that S V (P i ). Thus B and B avoid one another. Proof of Theorem 1. The proof is by induction on the number n of vertices in the graph G. Theorem 1 is vacuously true for n 3. Let G be a graph on n>3 vertices and assume the theorem is true for graphs with fewer than n vertices. By considering an appropriate block of G, we may suppose that G is 2-connected. Let C and B be as described in Lemma 1. By this lemma, if there is a C-bridge other than B, each such bridge is necessarily a path; moreover, all C-bridges, including B, have the same two vertices of attachment x, y. Every other vertex of C is thus of degree two. Because G is assumed to have at most two vertices of degree less than three, the length of C is three or four. In the former case, there is exactly one path bridge, of length two; in the latter case, x and y are nonconsecutive vertices of C and there is exactly one path bridge, of length one. In both cases, G has cycles of lengths three and four. Therefore, it may be assumed that B is the only C-bridge. There can be at most two vertices on C that are not vertices of B. Hence, unless C is a 4-cycle with alternate vertices in B, there exist two vertices of attachment of B to C, say x and y, for which the two xy-paths in C differ in length by one or two. Denote these two xy-paths of C by P 1 and P 2, and let P be an xy-path in B. The cycles P P 1 and P P 2 differ in length by one or two, which proves the theorem. In the case that C is a 4-cycle to which B has two vertices of attachment, the bridge B itself is a simple graph in which every vertex, except possibly its two vertices of attachment to C, has degree at least three. By induction, either the theorem is proved or B is K 1, clearly impossible, or K 2, impossible because C is induced. Proof of Theorem 2. Let C and B be as described in Lemma 2. We claim that B is the only bridge of C. By way of contradiction, suppose that C has a second bridge B. By Lemma 2, the bridges B and B avoid one another. There is thus a segment of C, connecting two consecutive vertices of attachment x, y of B to C, which contains every vertex of attachment of B to C (and no other vertex of attachment of B to C). But then {x, y} is a 2-vertex cut of G, contradicting the hypothesis of 3-connectedness. Thus B is indeed the only bridge of C. Since C is odd, there exist two vertices of C, say x and y, for which the two xy-segments of C, P 1 and P 2, differ in length by one. Moreover, because B is the only bridge of C, x and y are vertices of attachment of B to C. Let P be an xy-path in B. The cycles P P 1 and P P 2 differ in length by one. Remarks. The fact used in the proof of Theorem 2, that G contains an odd cycle C with only one bridge B, is also an immediate corollary of a theorem of Tutte stating that the induced nonseparating cycles in a 3-connected graph generate its cycle space [4].

5 CYCLES IN A GRAPH 15 Since this paper was accepted for publication, A. K. Kelmans has drawn the authors' attention to an article of his [3] in which nonseparating cycles are treated and in which results of a similar nature to our Lemma 1 may be found. References [1] J. A. Bondy and U. S. R. Murty, Graph theory with applications, MacMillan, London (1976). [2] P. Erdős, Some old and new problems in various branches of combinatorics, Discrete Math. 165/166 (1997), [3] A. K. Kelmans, Algebraic methods in graph theory (Szeged 1978) Vol. I, Colloq. Math. Soc. János Bolyai, vol. 25, North-Holland, Amsterdam/New York (1981). [4] C. Thomassen and B. Toft, Non-separating induced cycles in graphs, J. Combinatorial Theory B 31 (1981), [5] W. T. Tutte, How to draw a graph, Proc. London Math. Soc. 3 (1963), [6] H. J. Voss, Cycles and bridges in graphs, VEB Deutscher Verlag der Wissenschaften/Kluwer Academic Publishers, Berlin/Dordrecht, [7] D. B. West, Introduction to graph theory, Prentice-Hall, Upper Saddle River, NJ (1996).

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

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

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

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

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

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

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

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

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

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

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

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

### NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1

NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1 R. Thangadurai Stat-Math Division, Indian Statistical Institute, 203, B. T. Road, Kolkata 700035, INDIA thanga v@isical.ac.in Received: 11/28/01,

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

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

### Chapter I Logic and Proofs

MATH 1130 1 Discrete Structures Chapter I Logic and Proofs Propositions A proposition is a statement that is either true (T) or false (F), but or both. s Propositions: 1. I am a man.. I am taller than

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

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

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

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

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

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

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

### CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

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

### Edge looseness of plane graphs

Also available at http://amc-journal.eu ISSN 1855-966 (printed edn.), ISSN 1855-974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 9 (015) 89 96 Edge looseness of plane graphs Július Czap Department of

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

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

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

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

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

### 2-partition-transitive tournaments

-partition-transitive tournaments Barry Guiduli András Gyárfás Stéphan Thomassé Peter Weidl Abstract Given a tournament score sequence s 1 s s n, we prove that there exists a tournament T on vertex set

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

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

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

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

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

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

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

### A counterexample to a result on the tree graph of a graph

AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 63(3) (2015), Pages 368 373 A counterexample to a result on the tree graph of a graph Ana Paulina Figueroa Departamento de Matemáticas Instituto Tecnológico

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

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

### Generalized Induced Factor Problems

Egerváry Research Group on Combinatorial Optimization Technical reports TR-2002-07. 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.

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

### Characterizations of Arboricity of Graphs

Characterizations of Arboricity of Graphs Ruth Haas Smith College Northampton, MA USA Abstract The aim of this paper is to give several characterizations for the following two classes of graphs: (i) graphs

### Sparse halves in dense triangle-free graphs

Sparse halves in dense triangle-free graphs Sergey Norin a,1 Liana E. Yepremyan b, a Department of Mathematics and Statistics McGill University Montréal, Canada b School of Computer Science McGill University

### A simple criterion on degree sequences of graphs

Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree

### arxiv:1112.0829v1 [math.pr] 5 Dec 2011

How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly

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

### Mathematical Induction

MCS-236: Graph Theory Handout #A5 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 2010 Mathematical Induction The following three principles governing N are equivalent. Ordinary Induction Principle.

### ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF SECTION 4.4 Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem Copyright Cengage Learning. All rights reserved.

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

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

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

### CHROMATIC POLYNOMIALS OF PLANE TRIANGULATIONS

990, 2005 D. R. Woodall, School of Mathematical Sciences, University of Nottingham CHROMATIC POLYNOMIALS OF PLANE TRIANGULATIONS. Basic results. Throughout this survey, G will denote a multigraph with

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

### Zero-Sum Magic Labelings and Null Sets of Regular Graphs

Zero-Sum Magic Labelings and Null Sets of Regular Graphs Saieed Akbari a,c Farhad Rahmati b Sanaz Zare b,c a Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran b Department

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

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

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

### 14. Trees and Their Properties

14. Trees and Their Properties This is the first of a few articles in which we shall study a special and important family of graphs, called trees, discuss their properties and introduce some of their applications.

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

### most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, The University of Newcastle Callaghan, NSW 2308, Australia University of West Bohemia

Complete catalogue of graphs of maimum degree 3 and defect at most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, 1 School of Electrical Engineering and Computer Science The University of Newcastle

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

### arxiv: v3 [math.co] 28 Sep 2014

COPS AND ROBBERS ON DIAMETER TWO GRAPHS arxiv:1312.7555v3 [math.co] 28 Sep 2014 ZSOLT ADAM WAGNER Abstract. In this shortpaper we study the game ofcops and Robbers, played on the vertices of some fixed

### ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.4 Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem

### Removing Even Crossings

EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,

### Course 421: Algebraic Topology Section 1: Topological Spaces

Course 421: Algebraic Topology Section 1: Topological Spaces David R. Wilkins Copyright c David R. Wilkins 1988 2008 Contents 1 Topological Spaces 1 1.1 Continuity and Topological Spaces...............

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

### F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

### The 4-Choosability of Plane Graphs without 4-Cycles*

Journal of Combinatorial Theory, Series B 76, 117126 (1999) Article ID jctb.1998.1893, available online at http:www.idealibrary.com on The 4-Choosability of Plane Graphs without 4-Cycles* Peter Che Bor

### Solutions for Practice problems on proofs

Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

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

### Proof: A logical argument establishing the truth of the theorem given the truth of the axioms and any previously proven theorems.

Math 232 - Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the

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

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

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

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

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

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

### The minimum number of distinct areas of triangles determined by a set of n points in the plane

The minimum number of distinct areas of triangles determined by a set of n points in the plane Rom Pinchasi Israel Institute of Technology, Technion 1 August 6, 007 Abstract We prove a conjecture of Erdős,

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

### Set systems with union and intersection constraints

Set systems with union and intersection constraints Dhruv Mubayi Reshma Ramadurai September 13, 2007 Abstract Let 2 d k be fixed and n be sufficiently large. Suppose that G is a collection of k-element

Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder and the following capabilities: 1. We can reach the first rung of the ladder. 2. If we can reach a particular rung of the ladder,

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

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

### Extreme Intersection Points in Arrangements of Lines

Extreme Intersection Points in Arrangements of Lines Rom Pinchasi August 1, 01 Abstract We provide a strengthening of the classical theorem of Erdős [3] saing that n lines in the plane, no two of which

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

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

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### On the k-path cover problem for cacti

On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we

### 1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

### ERDOS PROBLEMS ON IRREGULARITIES OF LINE SIZES AND POINT DEGREES A. GYARFAS*

BOLYAI SOCIETY MATHEMATICAL STUDIES, 11 Paul Erdos and his Mathematics. II, Budapest, 2002, pp. 367-373. ERDOS PROBLEMS ON IRREGULARITIES OF LINE SIZES AND POINT DEGREES A. GYARFAS* Problems and results

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

### GRAPHS AND ZERO-DIVISORS. In an algebra class, one uses the zero-factor property to solve polynomial equations.

GRAPHS AND ZERO-DIVISORS M. AXTELL AND J. STICKLES In an algebra class, one uses the zero-factor property to solve polynomial equations. For example, consider the equation x 2 = x. Rewriting it as x (x

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

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