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

Save this PDF as:

Size: px
Start display at page:

Download "Every tree contains a large induced subgraph with all degrees odd"

## Transcription

1 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 of Cambridge, England Abstract: Caro, Krasikov and Roditty [] proved that every tree of order n contains an induced subgraph of order at least n 2 with all degrees odd, and conjectured a better bound. In this note we prove that every tree of order n contains an induced subgraph of order at least 2 n+1 with all degrees odd; this bound is best possible for every value of n. 1

2 Gallai (see [4], 5 Problem 17) proved that we can partition the vertices of any graph into two sets, each of which induces a subgraph with all degrees even; we can also partition the vertices into two sets so that one set induces a subgraph with all degrees even and the other induces a subgraph with all degrees odd. As an immediate consequence of this, we see that every graph of order n contains an induced subgraph of order at least n/2 with all degrees even. It is natural to ask whether we can partition every graph into induced subgraphs with odd degrees, but this turns out not to be possible (consider, for instance, C ). However, the results for induced subgraphs with even degrees suggest the following conjecture, the origin of which is unclear (see [2]). Conjecture. There exists ɛ > 0 such that every connected graph G contains some W V (G) with W ɛ G such that the graph induced by W has all degrees odd. Caro [2] proved that we can demand W c G, and Scott [5] proved that we can get W c G / log( G ). If the conjecture is true, then an example of Caro shows that we must have ɛ 2 7. This can be seen by considering Z 7 with each i joined to i ± 1 and i ± 2. The conjecture can be proved for some special classes of graph. In particular, Caro, Krasikov and Roditty [] showed that for trees we can take W V (G) /2, and conjectured a better bound in a slightly incorrect form. The result of this paper is the following best possible bound suggested by B. Bollobás (we use standard notation see [1]). Theorem. Let T be a tree of order n. There is a set S V (T ) such that n + 1 S 2 and Γ(x) S is odd for every x S. This bound is best possible for all n. Remark. In trees, an induced subgraph with even degrees is exactly the same as an independent set, since any nonempty subgraph of a tree must contain a vertex of degree 1. Since every tree is bipartite, it is obvious that we can always find an independent set of size T /2 ; this is easily seen to be best possible by considering any path. Proof. We note first that if the first part of the theorem is true then it is best possible for all n, as can be seen by considering P n, the path on n vertices. Now suppose that the 2

3 theorem is false, and let T be a smallest counterexample. Trivially T > 2, so diam(t ) 2. If diam(t ) = 2 then T is a star, in which case one of V (T ) or V (T ) \ {v}, where v is any endvertex of T, will do for S. If diam(t ) = then T consists of two stars with their centres joined by an edge, and is easily seen to satisfy the theorem. Thus we may assume that diam(t ) 4. Let W 0 be the set of endvertices of T, W 1 the set of endvertices of T \ W 0 and W 2 the set of endvertices of T \ (W 0 W 1 ). We write Γ i (v) for Γ(v) W i and d i (v) for Γ i (v), where i = 0, 1, 2. Note that W 2 is non-empty, since diam(t ) 4. Also, d 0 (v) > 0 if v W 1 and d 1 (v) > 0 if v W 2. If S V (T ) induces a graph with all degrees odd, then S must be even. Thus if we want to prove that we have chosen S such that S 2 ( T + 1)/, it is in fact enough to prove that S (2 T 2)/. Let us define f(n) = 2n 2. If T is any tree then we say that S V (T ) has odd degrees in T if Γ(x) S is odd for every x in S ; we say that S is good in T if S has odd degrees in T and S f( T ). It is enough to prove that for every tree T there is some S V (T ) that is good in T. We shall use the following method repeatedly. We pick V 0 V (T ) so that T = T \ V 0 is connected. Then, since T is minimal, we can find some set S V (T ) that is good in T. If we can now find S 0 V (T ) \ S such that S = S S 0 has odd degrees in T and S 0 2 V 0 /, then S is good in T, since S f( T ) + 2 V 0 / = f( T ). This method is used to prove the next three lemmas. Each lemma limits the structure of T by eliminating configurations that would enable us to exhibit a subset S V (T ) good in T. We successively refine our understanding of the structure of the minimal counterexample T until we are ready to show that no such T can exist, thus establishing the theorem. Lemma 1. If x W 2 then d 0 (x) = 0. Proof. Suppose x W 2 and d 0 (x) > 0, say v Γ 0 (x). Let w be any vertex in Γ 1 (x). If d 0 (w) = 1, say Γ 0 (w) = {y}, then consider T = T \ {v, w, y}. Since T < T, and T is connected, we can find S V (T ) that is good in T. If x S then let

4 S = S {v, w}; if x S then let S = S {w, y}. In both cases, S has odd degrees in T, and S = S + 2 f( T ) + 2 = f( T ), so S is good in T. If d 0 (w) > 1 then pick y, z Γ 0 (w). Consider T = T \ {v, y, z}. We can find some S V (T ) that is good in T. Then if w S let S = S {y, z}; if w S and x S then let S = S {v, w}; and if w S and x S then let S = S {w, y}. In each case it is easily seen that S is good in T. Thus if x W 2 we must have d 0 (x) = 0. Lemma 2. If x W 2 then d 1 (x) = 1; and if Γ 1 (x) = {v}, say, then d 0 (v) = 2. Proof. Let x be any vertex in W 2. We know from Lemma 1 that d 0 (x) = 0. Suppose first that d 1 (x) > 1. If d 0 (v) = 1 for every v in Γ 1 (x) then let V 0 = {x} Γ 1 (x) {Γ 0 (v) : v Γ 1 (x)}, so V 0 = 2d 1 (x) We can find S good in T \ V 0. Setting S 0 = V 0 \ {x}, we find that S = S S 0 has odd degrees in T and S 0 = V 0 1 > 2 V 0 /, since V 0 5, so S is good in T. Thus if d 1 (x) > 1 we cannot have d 0 (v) = 1 for every v in Γ 1 (x). Pick two vertices v, w in Γ 1 (x) to maximise d 0 (v) + d 0 (w). If d 0 (v) + d 0 (w) =, say Γ 0 (v) = {y 0 } and Γ 0 (w) = {y 1, y 2 }, then set V 0 = {v, w, y 0, y 1, y 2 } and T = T \ V 0. We can find S good in T. If x S then let S 0 = V 0 \ {y 0 }; if x / S then let S 0 = V 0 \ {y 1 }. In either case, S = S S 0 has odd degrees in T and S = S + 4 f( T 5) + 4 > f( T ), so S is good in T. If d 0 (v) + d 0 (w) 4 then pick y 0 Γ 0 (v) and y 1 Γ 0 (w). Let V 0 = {v, w} Γ 0 (v) Γ 0 (w) and T = T \ V 0. We can find S good in T. Let S 0 = V 0 \ Y, where Y is some subset of {y 1, y 2 } chosen to ensure that Γ(v) (S S 0 ) and Γ(w) (S S 0 ) are odd. Then S = S S 0 has odd degrees in T, and V 0 6, so S f( T V 0 ) + V 0 2 = f( T ) + V 0 / 2 f( T ). Therefore S is good in T. We have proved that we must have d 1 (x) = 1, say Γ 1 (x) = {v}. Now suppose that d 0 (v) 2. Let V 0 = {v, x} Γ 0 (v) and T = T \ V 0 ; we can find S good in T. If d 0 (v) is odd then take S 0 = V 0 \ {x} and if d 0 (v) is even take S 0 = V 0 \ {x, y}, where y is any element of Γ 0 (v). In either case S 0 2 V 0 /, and we see that S = S S 0 is good in T. Thus we have shown that Γ 1 (x) = {v}, for some v, and d 0 (v) = 2. 4

5 The final lemma, which follows, and the proof of the theorem each proceed by considering a longest path in T. Let x 0,..., x m be such a path, where m = diam(t ) 4. Note that x i W i for i = 0, 1, 2. The following lemma limits the possibilities for the neighbours of x. Lemma. The vertex x satisfies d 0 (x ) = 0. Proof. Suppose that d 0 (x ) > 0, say v Γ 0 (x ). We know by Lemma 1 that d 0 (x 2 ) = 0, and by Lemma 2 we know that Γ 1 (x 2 ) = {x 1 } and Γ 0 (x 1 ) = {y, z}, say. Let T = T \ {v, y, z}. We can find some S good in T. If x 1 S then let S = S {y, z}; if x 1 S and x 2 S then x S, so let S = (S \ {x 2 }) {v, x 1, y}; if x 1 S and x 2 S then let S = S {x 1, y}. In each case S is good in T. We are now ready to complete the proof of the theorem. We claim that by deleting x, and taking from each resulting component a large set that has odd degrees in that component (and thus in T ), we can find a set that is good in T. Now T \ {x } has d(x ) components, say T 1,..., T k. It is enough to find sets S i V (T i ) such that S i has odd degrees in T i, i = 1,..., k, and k i=1 S i f( T ), for then S = k 1 S i is good in T. Each component of T \ {x } contains one neighbour of x. We may assume that T 1 contains x 4 and T 2 contains x 2. The remaining components are all stars. Indeed, we know from Lemma that d 0 (x ) = 0, thus each remaining T i contains a vertex from Γ 1 (x ) Γ 2 (x ). If T i contains v Γ 1 (x ) it is clearly a star; if T i contains v Γ 2 (x ) then Lemma 2 tells us that it must be a star. It is then trivial to verify that, since T i is a star, we can find S i V (T i ) having odd degrees in T i such that S i 2 T i /, for i > 2. Now we can find S 1 good in T 1, and by Lemma 2 we have that T 2 has all degrees odd, so setting S 2 = V (T 2 ) we have k S i S S i i=1 i>2 f( T 1 ) ( T T 1 5) > f( T 1 ) + 2 ( T T 1 ) = f( T ). Thus if we set S = k i=1 S i, then S is good in T. This contradicts the supposition that T contains no good set, thereby establishing the theorem. 5

6 Let us note that there are many extremal graphs for the theorem. Indeed, let P 1,..., P k be paths, with P i 1 mod. Then the tree T obtained by taking an endvertex x i in P i for each i and then identifying x 1... x k gives equality in the theorem. Acknowledgment. ADS would like to thank Dr Bollobás for his helpful advice. References [1] B. Bollobás, Graph Theory, An Introductory Course (Springer-Verlag, New York, Heidelberg, Berlin, 1979). [2] Y. Caro, On induced subgraphs with odd degrees, Discrete Mathematics. To appear. [] Y. Caro, I. Krasikov and Y. Roditty, On induced subgraphs of trees with restricted degrees. To appear. [4] L. Lovász, Combinatorial Problems and Exercises (North-Holland, Amsterdam, 1979). [5] A.D. Scott, Large induced subgraphs with all degrees odd, Combinatorics, Probability and Computing. To appear. 6

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

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

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

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

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

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

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

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

### A simple existence criterion for normal spanning trees in infinite graphs

1 A simple existence criterion for normal spanning trees in infinite graphs Reinhard Diestel Halin proved in 1978 that there exists a normal spanning tree in every connected graph G that satisfies the

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

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

### Diameter of paired domination edge-critical graphs

AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 279 291 Diameter of paired domination edge-critical graphs M. Edwards R.G. Gibson Department of Mathematics and Statistics University of Victoria

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

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

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

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

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

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS 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 the identity, such that (i) the

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

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

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

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

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

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

### The edge slide graph of the n-dimensional cube

The edge slide graph of the n-dimensional cube Howida AL Fran Institute of Fundamental Sciences Massey University, Manawatu 8th Australia New Zealand Mathematics Convention December 2014 Howida AL Fran

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

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

### Chapter 4: Trees. 2. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:

9 Properties of Trees. Definitions: Chapter 4: Trees forest - a graph that contains no cycles tree - a connected forest. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:

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

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

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

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

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

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

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

### Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing:

1. GRAPHS AND COLORINGS Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing: 3 vertices 3 edges 4 vertices 4 edges 4 vertices 6 edges A graph

### arxiv: v2 [math.co] 30 Nov 2015

PLANAR GRAPH IS ON FIRE PRZEMYSŁAW GORDINOWICZ arxiv:1311.1158v [math.co] 30 Nov 015 Abstract. Let G be any connected graph on n vertices, n. Let k be any positive integer. Suppose that a fire breaks out

### Graph Theory. Introduction. Distance in Graphs. Trees. Isabela Drămnesc UVT. Computer Science Department, West University of Timişoara, Romania

Graph Theory Introduction. Distance in Graphs. Trees Isabela Drămnesc UVT Computer Science Department, West University of Timişoara, Romania November 2016 Isabela Drămnesc UVT Graph Theory and Combinatorics

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

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

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

### Graph Isomorphism Completeness for Perfect Graphs and Subclasses of Perfect Graphs

Graph Isomorphism Completeness for Perfect Graphs and Subclasses of Perfect Graphs C. Boucher D. Loker May 2006 Abstract A problem is said to be GI-complete if it is provably as hard as graph isomorphism;

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

### Lecture 4: BK inequality 27th August and 6th September, 2007

CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound

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

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

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

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

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

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

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

### Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 Cristina Bazgan a and Zsolt Tuza b,c,d a LAMSADE, Université Paris-Dauphine, Place du Marechal de Lattre de Tassigny, F-75775 Paris

### 1 Definitions. Supplementary Material for: Digraphs. Concept graphs

Supplementary Material for: van Rooij, I., Evans, P., Müller, M., Gedge, J. & Wareham, T. (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping.

### 9.1. Vertex colouring. 9. Graph colouring. Vertex colouring.

Vertex colouring. 9. Graph colouring k-vertex-critical graphs Approximation algorithms Upper bounds for the vertex chromatic number Brooks Theorem and Hajós Conjecture Chromatic Polynomials Colouring of

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

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

### A NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS

A NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS PAWE L PRA LAT Abstract. In this note we consider the on-line Ramsey numbers R(P n, P m ) for paths. Using a high performance computing clusters,

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

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

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

### Solutions to In-Class Problems Week 4, Mon.

Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science September 26 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised September 26, 2005, 1050 minutes Solutions

### Two General Methods to Reduce Delay and Change of Enumeration Algorithms

ISSN 1346-5597 NII Technical Report Two General Methods to Reduce Delay and Change of Enumeration Algorithms Takeaki Uno NII-2003-004E Apr.2003 Two General Methods to Reduce Delay and Change of Enumeration

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

### Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

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

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

### Planar Graph and Trees

Dr. Nahid Sultana December 16, 2012 Tree Spanning Trees Minimum Spanning Trees Maps and Regions Eulers Formula Nonplanar graph Dual Maps and the Four Color Theorem Tree Spanning Trees Minimum Spanning

### YILUN SHANG. e λi. i=1

LOWER BOUNDS FOR THE ESTRADA INDEX OF GRAPHS YILUN SHANG Abstract. Let G be a graph with n vertices and λ 1,λ,...,λ n be its eigenvalues. The Estrada index of G is defined as EE(G = n eλ i. In this paper,

### HOLES 5.1. INTRODUCTION

HOLES 5.1. INTRODUCTION One of the major open problems in the field of art gallery theorems is to establish a theorem for polygons with holes. A polygon with holes is a polygon P enclosing several other

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

### Discrete Applied Mathematics. The firefighter problem with more than one firefighter on trees

Discrete Applied Mathematics 161 (2013) 899 908 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The firefighter problem with

### On three zero-sum Ramsey-type problems

On three zero-sum Ramsey-type problems Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel and Yair Caro Department of Mathematics

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

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

### Determination of the normalization level of database schemas through equivalence classes of attributes

Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,

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

### Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Week 9 Lecture Notes Graph Theory For completeness I have included the definitions from last week s lecture which we will be using in today s lecture along with

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

### The Independence Number in Graphs of Maximum Degree Three

The Independence Number in Graphs of Maximum Degree Three Jochen Harant 1 Michael A. Henning 2 Dieter Rautenbach 1 and Ingo Schiermeyer 3 1 Institut für Mathematik, TU Ilmenau, Postfach 100565, D-98684

### Mathematical induction & Recursion

CS 441 Discrete Mathematics for CS Lecture 15 Mathematical induction & Recursion Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Proofs Basic proof methods: Direct, Indirect, Contradiction, By Cases,

### Available online at ScienceDirect. Procedia Computer Science 74 (2015 ) 47 52

Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 74 (05 ) 47 5 International Conference on Graph Theory and Information Security Fractional Metric Dimension of Tree and

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

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

### Set systems with union and intersection constraints

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

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

### 3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

### The number of generalized balanced lines

The number of generalized balanced lines David Orden Pedro Ramos Gelasio Salazar Abstract Let S be a set of r red points and b = r + 2δ blue points in general position in the plane, with δ 0. A line l

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

### On Total Domination in Graphs

University of Houston - Downtown Senior Project - Fall 2012 On Total Domination in Graphs Author: David Amos Advisor: Dr. Ermelinda DeLaViña Senior Project Committee: Dr. Sergiy Koshkin Dr. Ryan Pepper

### Why? A central concept in Computer Science. Algorithms are ubiquitous.

Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online

### Chapter 4. Trees. 4.1 Basics

Chapter 4 Trees 4.1 Basics A tree is a connected graph with no cycles. A forest is a collection of trees. A vertex of degree one, particularly in a tree, is called a leaf. Trees arise in a variety of applications.

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

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

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

### Routing Problems. Viswanath Nagarajan R. Ravi. Abstract. We study the distance constrained vehicle routing problem (DVRP) [20, 21]: given a set

Approximation Algorithms for Distance Constrained Vehicle Routing Problems Viswanath Nagarajan R. Ravi Abstract We study the distance constrained vehicle routing problem (DVRP) [20, 21]: given a set of

### Extremal Problems for Topological Indices in Combinatorial. Chemistry

Extremal Problems for Topological Indices in Combinatorial Chemistry Robert F Tichy and Stephan Wagner Department of Mathematics Graz University of Technology Steyrergasse 30, A-8010 Graz, Austria Phone: