# On planar regular graphs degree three without Hamiltonian cycles 1

Save this PDF as:

Size: px
Start display at page:

Download "On planar regular graphs degree three without Hamiltonian cycles 1"

## Transcription

1 On planar regular graphs degree three without Hamiltonian cycles 1 E. Grinbergs Computing Centre of Latvian State University Abstract. Necessary condition to have Hamiltonian cycle in planar graph is given. Examples of regular planar graphs degree three without Hamiltonian cycle are built. In this article, by graph we mean finite connected nonoriented graph without loops, multiedges, and vertices of degree one. Let us call the nontrivial cut of the graph any set of edges removing which graph falls into two connected components with at least three vertices in each. The minimal number of edges contained in the nontrivial cut we call the quasiconnectivity. Finally, finite regular planar graph degree three we call the map if its quasiconnectivity is at least two, i.e. it does not have isthmi. It is well known that map may not have Hamiltonian cycle. However, for the only example of the map without Hamiltonian cycle that repeatedly appears in literature [1, p. 210; 2, p. 57], quasiconnectivity is but three (with besides three minimal nontrivial cuts). On the other side, mostly interesting are just these maps that have quasi-connectivity of its maximal value -- five, at least as the only possible counterexamples of the hypothesis of the four colour theorem. We are going to establish one characteristic of planar graphs having Hamiltonian cycle that would, in its turn, let us build maps of quasiconnectivity five or four without such cycles. 1 Emanuels Grinbergs ( ) published this article in Russian in the Latvian Mathematical Annals, vol 4, 1968, pp 51-58, the translation is performed by D. Zeps.

2 Let us consider planar embedding of the graph G (i.e. planar topological graph according Berge, depicting G ) with definite Hamiltonian cycle H in it. The edges not contained in H let us call the chords. Because of the planarity of considered embedding, H is a closed Jordan curve without selfcrossings and, consequently, divides the plane into two parts -- outer, containing infinitely remote point of the plane, -- and inner. Each chord has end vertices on H passing only along outer or inner part of the plane. These chords, together with faces into which the two parts of the plane are divided, may be called outer and inner respectively. We define the weight of the face bordered by elementary cycle to be the length of the bordering cycle [or number of vertices of the border] minus two. If faces are considered so that the sum of the length of bordering cycles of them is equal to, the sum S of their weights may be expressed as follows: S 2. (1) Let now h -- length of the considered Hamiltonian cycle H. S1 and S2 are sums of weights of inner and outer faces respectively. Then S S h 2. (2) 1 2 To prove it, let us eliminate all chords. Then equalities hold in (2) by definition. Let us now restore all chords one by one. By restoring each subsequent chord, addends in S1 and S 2, and sums itself, do not change. For the first sum, let us follow changes in the right side of (1). Number increases by one because one of the faces, say A, due to added chord, partitions into two new faces. Sum increases by two because all edges constituting border of A go also into border of just one of the new faces. Thus, value of the left side does not change. In consequence, expression (2) remains true after all chords are restored in their place. If the set of all faces of an embedding of the graph in plane are partitioned into two subsets with equal total weights S1 and S 2, i.e. S1 S 2, (3) then such partition may be called isobaric but the set of all edges contained in both these partitions -- the border of that partition. Then the obtained result may be formulated by the following theorem: Theorem. If planar graph G has Hamiltonian cycle H, then for any embedding in plane there exists an isobaric partition so that the border of it is H.

3 Let us add some remarks. Firstly, it is clear that the formulated theorem remains true for planar multigraphs too (of course, without loops, isthmi, and vertices of first order). Secondly, for our aims important is just expression (3) because expression S 1 S2 2( h 2) following from second sign of equality in (2) is simply some alternative form of Euler s formula. Finally, non-existence of isobaric partition may be rather convenient sufficient condition for non-existence of Hamiltonian cycle. However, if such partitions are at hand, it is hardly purposeful to use these conditions of the formulated theorem to solve the problem about existence of the Hamiltonian cycle in the given planar graph or to find such cycles. The theorem should be useful the other way around: if at first, the set of available weights of edges is limited, then it is possible to build planar embeddings that one of the following holds: a) isobaric partition does not exist; b) isobaric partition exists, but no one of them has Hamiltonian cycle as its boundary. Acquired planar graphs, by virtue of the theorem, should be without Hamiltonian cycles. Maps satisfying a) may be built if for its building, it is used just one face with the weight not multiple of three, and arbitrary number of faces of weights that are multiples of three, i.e. faces with 3k 2 vertices for natural k. Then, for any partition of the set of all faces into two subsets, only for one part sum of weights should be multiple of three. Isobaric partitions, as follows, should not be there. In order to build map with b) holding, we may take three faces with common vertex with weights that are comparable by module of three, but not multiples of three, but all other faces, as higher, with weights multiples of three. Then, for any isobaric partition, first three faces should go into one subset of partition; border of partition would not go through x, and, as follows, Hamiltonian cycle would not be there. It seems to us that the building of the map G is easer to perform for the dual graph of the map we are looking for, i.e. for planar triangulation of G '. For Hamiltonian cycle H in G, there corresponds the cut H ' in G' that separates one from another two trees, which may be taken as bichromatic components to get proper colouring of vertices of G '. However, if in G there is no Hamiltonian cycle, then G ' is without such cuts; for proper colouring of vertices of G ', any bichromatic component is not tree but either

4 Fig. 1. Map without Hamiltonian cycles: f 9 1; f 21 ; f 3 ; f 25; q Fig. 2. Map without Hamiltonian cycles: f 4 1; f 5 18 ; f 8 4 ; f 23; q 4

5 Fig. 3. Map without Hamiltonian cycles: f 6 3 ; f 5 18 ; f 8 3 ; f 24; q 5 has even cycle or isn t connected or both. For the length of boundary cycles of faces ofg, there correspond degrees of vertices in G ' so that the task can be reduced to finding planar triangulations with arbitrary number of vertices of degree 5, 8, 11,... and one vertex of degree not comparable with two by module three in case a), or three pairwise adjacent vertices of degree comparable between themselves but not two by module three in case b). On fig. 1-3, some maps obtained in the described way are given. Borders of special faces, weights of which are not multiples of three, are drawn with bold lines. We will denote by f i -- number of faces with i vertices, by f - summary number of faces; by q -- quasi-connectivity; by A, B, C, D -- colours of one of the proper colourings of faces with four colours. The map given on fig. 1 is dual to triangulation on fig. 1, I in [3]. Maps shown on fig. 1 and 2 correspond to case a) but on 3 -- case b). Among the

6 maps built by us in the described way, two last maps (fig. 2, 3) have least possible f for q 4 and 5. It would be interesting to state minimal values for maps without Hamiltonian cycles with q 3, 4 or5. Since maps from [1,2] have f 25 at q 3, upper limits for these minimal values are known. For the general number of faces, edges, vertices, or maximal number of vertices of one face, maps without Hamiltonian cycle does not have upper limit. Really, it is possible to show the way of building maps with each of these values being arbitrary large. Let us describe one way of such building for dual triangulation G '. We choose natural numbers and with condition 2(mod3) (4) holding. We are building elementary cycle C 1 of length 3 with another elementary cycle C 0 within it of the same length, within which we put vertex x connecting it via edges with all vertices ofc 0. After that, in a zigzag way, we triangulize area between C0 and C 1 : we connect by edge one vertex of C0 with one vertex of C 1, then after, we build new edges by moving end points alternatively along C0 and C1 by one edge in the same direction. In result, we get triangulation of the inside ofc 1; vertex x has degree 3, all vertices of C0 have degree 5, but to vertices of C 1 from inside, there come edges in twos. Further, by steps of the same type we build parts of G ' that lay between cycles Ci and C i 1 ( i 1,2,..., ), namely, we partition all vertices of C i into triples of following one after another vertices. To vertices of each triple we assign degrees 8, 5, 8, and in accordance with layout of fig. 4, we build transition to C i 1 (the numbers indicated are degrees of vertices). By feasibility of splitting vertices in triples and by getting prescribed values of degrees, following features of our cycles are ensured: i 1 1) cycles of Ci have lengths 3 1 i 4 ; Fig. 4 Layout for building graph G '.

7 2) from inside to vertices of C i come two edges. These features are true because they hold firstly for i 1 and further, when we move from i toi 1, because the construction being used retains them during augmentation. We end the building of the triangulation by uniting all vertices of C 1 with vertex z taken outside C 1. The degree of z should be equal to 4, and by virtue of (4), we have: 4 2(mod 3). Now, if we go over to map have G i that is dual to 3 vertices, consequently, weight 3 2 G ', then face corresponding to x should that is not multiple of three. The weights of all other faces would be 3, 6 or 4 2, and therefore multiples of three so that no isobaric partitions, no Hamiltonian cycles are possible. It is easy to see that all graphs G ' built in the described way are four-chromatic. Finally, let us remark that by stated theorem it is easy to get analogue proposition for maps that are 3H-graphs. As is well known, regular graph degree three is called 3Hgraph if there exists such regular colouring of edges with three colours that edges of each two colours compose Hamiltonian cycle. Let map G be 3H-graph and H 1, H 2, H 3 be Hamiltonian cycles by virtue of definition of 3H-graph. The following are known facts that may be easily proven: we get regular colouring of faces of G with colours 0,1,2,3 if number of colour of each face equals number of cycles H within which this face lies; by suitable numbering of colours of edges present in the definition of 3Hgraph, regular colouring of edges with colours 0, 1, 2 is obtained if edge that touches faces with colours i and j obtains colour numbered i j 3. Let, finally, i be sum of weights of all faces with colour i. Using the theorem for each Hamiltonian cycle H j, we see that sum of each two values of i equals to sum of both others, consequently, all i have the same value. Thus, the following holds: Corollary. If map is 3H-graph, then exists such partition of the set of all faces into four subsets A i ( i 0,1,2,3 ) having equal summary weights that colouring of all faces of subset A i with i colours is regular and have all indicated above features. i

8 Exempli gratia of a map that is 3H-graph, it is possible to point to the projection of dodecahedron that has all faces of weight three. Literature: 1. K. Berge. The theory of graphs, trans. in Russ., M, IL, O. Ore. Theory of graphs. Providence, E. Grinbergs, I. Ilziņa. About colouring vertices of nonoriented graphs. Automatika i vicislitelnaja tehnika 7, in Russ., Rīga, Zinātne, E. Grinberg On Planar Gomogenous Graphs Degree Three Without Hamilton Circuits 2 Annotation A necessary condition for Hamilton circuits of a planar graph is given in this paper. There are given examples of gomogenous planar graphs degree three having no Hamilton circuits. Submitted on 2 August This annotation is given in the form it was published in 1968.

### Sum of Degrees of Vertices Theorem

Sum of Degrees of Vertices Theorem Theorem (Sum of Degrees of Vertices Theorem) Suppose a graph has n vertices with degrees d 1, d 2, d 3,...,d n. Add together all degrees to get a new number d 1 + d 2

### Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902

Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler Different Graphs, Similar Properties

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

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

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

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

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

### Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College

Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1

### V. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005

V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer

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

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

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

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

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

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

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

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

### The Clar Structure of Fullerenes

The Clar Structure of Fullerenes Liz Hartung Massachusetts College of Liberal Arts June 12, 2013 Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, 2013 1 / 25

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

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

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

### Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique

### Topological Treatment of Platonic, Archimedean, and Related Polyhedra

Forum Geometricorum Volume 15 (015) 43 51. FORUM GEOM ISSN 1534-1178 Topological Treatment of Platonic, Archimedean, and Related Polyhedra Tom M. Apostol and Mamikon A. Mnatsakanian Abstract. Platonic

### Removing even crossings

Removing even crossings Michael J. Pelsmajer a, Marcus Schaefer b, Daniel Štefankovič c a Department of Applied Mathematics, Illinois Institute of Technology, Chicago, IL 60616, USA b Department of Computer

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

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

### Examination paper for MA0301 Elementær diskret matematikk

Department of Mathematical Sciences Examination paper for MA0301 Elementær diskret matematikk Academic contact during examination: Iris Marjan Smit a, Sverre Olaf Smalø b Phone: a 9285 0781, b 7359 1750

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

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

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

### Disjoint Compatible Geometric Matchings

Disjoint Compatible Geometric Matchings Mashhood Ishaque Diane L. Souvaine Csaba D. Tóth Abstract We prove that for every even set of n pairwise disjoint line segments in the plane in general position,

### Matthias F.M. Stallmann Department of Computer Science North Carolina State University Raleigh, NC 27695-8206

Matthias F.M. Stallmann Department of Computer Science North Carolina State University Raleigh, NC 27695-8206 August, 1990 UNIFORM PLANAR EMBEDDING IS NP-COMPLETE* MATTHIAS F.M. STALLMANN Key Words. planar

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

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

### SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM

SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM ALEX WRIGHT 1. Intoduction A fixed point of a function f from a set X into itself is a point x 0 satisfying f(x 0 ) = x 0. Theorems which establish the

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

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

### On the Relationship between Classes P and NP

Journal of Computer Science 8 (7): 1036-1040, 2012 ISSN 1549-3636 2012 Science Publications On the Relationship between Classes P and NP Anatoly D. Plotnikov Department of Computer Systems and Networks,

### Asymptotically Faster Algorithms for the Parameterized face cover Problem

Asymptotically Faster Algorithms for the Parameterized face cover Problem Faisal N. Abu-Khzam 1, Henning Fernau 2 and Michael A. Langston 3 1 Division of Computer Science and Mathematics, Lebanese American

### Extremal Wiener Index of Trees with All Degrees Odd

MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287-292 ISSN 0340-6253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of

### CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

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

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

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

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

### arxiv:1409.4299v1 [cs.cg] 15 Sep 2014

Planar Embeddings with Small and Uniform Faces Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl 3, and Ignaz Rutter 3,4 arxiv:409.499v [cs.cg] 5 Sep 04 Department of Engineering, Roma Tre University, Italy

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

### Section Summary. Introduction to Graphs Graph Taxonomy Graph Models

Chapter 10 Chapter Summary Graphs and Graph Models Graph Terminology and Special Types of Graphs Representing Graphs and Graph Isomorphism Connectivity Euler and Hamiltonian Graphs Shortest-Path Problems

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

### From Perfect Matchings to the Four Colour Theorem

From Perfect Matchings to the Four Colour Theorem Aguilar (Cinvestav), Flores (UNAM), Pérez (HP), Santos (Cantabria), Zaragoza (UAM-A) Universidad Autónoma Metropolitana Unidad Azcapotzalco Departamento

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

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

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

### ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS

ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS DOV TAMARI 1. Introduction and general idea. In this note a natural problem arising in connection with so-called Birkhoff-Witt algebras of Lie

### each college c i C has a capacity q i - the maximum number of students it will admit

n colleges in a set C, m applicants in a set A, where m is much larger than n. each college c i C has a capacity q i - the maximum number of students it will admit each college c i has a strict order i

### Introduction to computer science

Introduction to computer science Michael A. Nielsen University of Queensland Goals: 1. Introduce the notion of the computational complexity of a problem, and define the major computational complexity classes.

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

### Coloring a set of touching strings

Coloring a set of touching strings Louis Esperet Daniel Gonçalves Arnaud Labourel Abstract For a family of geometric objects in the plane F = {S 1,..., S n }, define χ(f) as the least integer l such that

### FIBRATION SEQUENCES AND PULLBACK SQUARES. Contents. 2. Connectivity and fiber sequences. 3

FIRTION SEQUENES ND PULLK SQURES RY MLKIEWIH bstract. We lay out some foundational facts about fibration sequences and pullback squares of topological spaces. We pay careful attention to connectivity ranges

### A FIBONACCI TILING OF THE PLANE

A FIBONACCI TILING OF THE PLANE Charles W. Huegy Polygonics, 2 Mann St., Irvine, CA 92612-2709 Douglas B. West University of Illinois, Urbana, IL 61801-2975, west@math.uiuc.edu Abstract. We describe a

### OPTIMAL DESIGN OF DISTRIBUTED SENSOR NETWORKS FOR FIELD RECONSTRUCTION

OPTIMAL DESIGN OF DISTRIBUTED SENSOR NETWORKS FOR FIELD RECONSTRUCTION Sérgio Pequito, Stephen Kruzick, Soummya Kar, José M. F. Moura, A. Pedro Aguiar Department of Electrical and Computer Engineering

### TU e. Advanced Algorithms: experimentation project. The problem: load balancing with bounded look-ahead. Input: integer m 2: number of machines

The problem: load balancing with bounded look-ahead Input: integer m 2: number of machines integer k 0: the look-ahead numbers t 1,..., t n : the job sizes Problem: assign jobs to machines machine to which

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

### Arrangements And Duality

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

### Solving Geometric Problems with the Rotating Calipers *

Solving Geometric Problems with the Rotating Calipers * Godfried Toussaint School of Computer Science McGill University Montreal, Quebec, Canada ABSTRACT Shamos [1] recently showed that the diameter of

### The Software for Constructing Trails with Local Restrictions in Graphs

Open Journal of Discrete Mathematics, 203, 3, 86-92 http://dxdoiorg/04236/ojdm2033207 Published Online April 203 (http://wwwscirporg/journal/ojdm) The Software for Constructing Trails with Local Restrictions

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

### Euler Paths and Euler Circuits

Euler Paths and Euler Circuits An Euler path is a path that uses every edge of a graph exactly once. An Euler circuit is a circuit that uses every edge of a graph exactly once. An Euler path starts and

### INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

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

### Graph Theory Origin and Seven Bridges of Königsberg -Rhishikesh

Graph Theory Origin and Seven Bridges of Königsberg -Rhishikesh Graph Theory: Graph theory can be defined as the study of graphs; Graphs are mathematical structures used to model pair-wise relations between

### Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )

1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the

### CSC 373: Algorithm Design and Analysis Lecture 16

CSC 373: Algorithm Design and Analysis Lecture 16 Allan Borodin February 25, 2013 Some materials are from Stephen Cook s IIT talk and Keven Wayne s slides. 1 / 17 Announcements and Outline Announcements

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

### SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

### Lecture 7: NP-Complete Problems

IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NP-Complete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit

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

### Arithmetic and Algebra of Matrices

Arithmetic and Algebra of Matrices Math 572: Algebra for Middle School Teachers The University of Montana 1 The Real Numbers 2 Classroom Connection: Systems of Linear Equations 3 Rational Numbers 4 Irrational

### Information Visualization on the Base of Hierarchical Graph Models

Information Visualization on the Base of Hierarchical Graph Models V.N. KASYANOV Laboratory for Program Construction and Optimization Institute of Informatics Systems Lavrentiev pr. 6, Novosibirsk, 630090

### Regular Augmentations of Planar Graphs with Low Degree

Regular Augmentations of Planar Graphs with Low Degree Bachelor Thesis of Huyen Chau Nguyen At the Department of Informatics Institute of Theoretical Computer Science Reviewers: Advisors: Prof. Dr. Dorothea

### ON COMPUTATIONAL COMPLEXITY OF PLANE CURVE INVARIANTS

ON COMPUTATIONAL COMPLEXITY OF PLANE CURVE INVARIANTS FEDOR DUZHIN AND TAO BIAOSHUAI ABSTRACT. The theory of generic smooth closed plane curves initiated by Vladimir Arnold is a beautiful fusion of topology,

### Complexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar

Complexity Theory IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Outline Goals Computation of Problems Concepts and Definitions Complexity Classes and Problems Polynomial Time Reductions Examples

### Diversity Coloring for Distributed Data Storage in Networks 1

Diversity Coloring for Distributed Data Storage in Networks 1 Anxiao (Andrew) Jiang and Jehoshua Bruck California Institute of Technology Pasadena, CA 9115, U.S.A. {jax, bruck}@paradise.caltech.edu Abstract

### On one-factorizations of replacement products

Filomat 27:1 (2013), 57 63 DOI 10.2298/FIL1301057A Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On one-factorizations of replacement

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

### Multi-layer Structure of Data Center Based on Steiner Triple System

Journal of Computational Information Systems 9: 11 (2013) 4371 4378 Available at http://www.jofcis.com Multi-layer Structure of Data Center Based on Steiner Triple System Jianfei ZHANG 1, Zhiyi FANG 1,

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### Recall that two vectors in are perpendicular or orthogonal provided that their dot

Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal

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

### An algorithmic classification of open surfaces

An algorithmic classification of open surfaces Sylvain Maillot January 8, 2013 Abstract We propose a formulation for the homeomorphism problem for open n-dimensional manifolds and use the Kerekjarto classification

### Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

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

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

### ! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.

Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three

### Angle Bisectors in a Triangle

346/ ANGLE BISECTORS IN A TRIANGLE Angle Bisectors in a Triangle I. F. Sharygin In this article, we have collected some geometric facts which are directly or tangentially related to the angle bisectors

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

### FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM

International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT

### Foundations of Logic and Mathematics

Yves Nievergelt Foundations of Logic and Mathematics Applications to Computer Science and Cryptography Birkhäuser Boston Basel Berlin Contents Preface Outline xiii xv A Theory 1 0 Boolean Algebraic Logic

### On the Number of Planar Orientations with Prescribed Degrees

On the Number of Planar Orientations with Prescribed Degrees Stefan Felsner Florian Zickfeld Technische Universität Berlin, Fachbereich Mathematik Straße des 7. Juni 6, 06 Berlin, Germany {felsner,zickfeld}@math.tu-berlin.de

### half-line the set of all points on a line on a given side of a given point of the line

Geometry Week 3 Sec 2.1 to 2.4 Definition: section 2.1 half-line the set of all points on a line on a given side of a given point of the line notation: is the half-line that contains all points on the

### The Open University s repository of research publications and other research outputs

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite: