Vesa Halava Tero Harju. Walks on Borders of Polygons
|
|
- Aron Miller
- 5 years ago
- Views:
Transcription
1 Vesa Halava Tero Harju Walks on Borders of Polygons TUCS Technical Report No 698, June 2005
2
3 Walks on Borders of Polygons Vesa Halava Tero Harju Department of Mathematics and TUCS - Turku Centre for Computer Science University of Turku, FIN Turku, Finland. vehalava@utu.fi, harju@utu.fi TUCS Technical Report No 698, June 2005
4 Abstract We give a graph theoretical proof for the existence of a walk connecting left and right sides of a rectangle when it is partitioned into (finitely many) rectangles colored in a specific way, and the walk is aloud to use only borders between rectangles of different color. The problem was originally introduced by J.R. Isbell in the proof of his Zig-Zag Theorem. We prove the existence of such a walk also when the problem is generalized other partitions of the rectangle, such as partitions to arbitrary polygons. Keywords: Zig-Zag; Isbell; coloring; polygon; rectangle; handshaking TUCS Laboratory Discrete Mathematics for Information Technology Laboratory
5 1 Introduction In 1966 J.R. Isbell proved his algebraic Zig-Zag Theorem [3] using a simple property of paths in a geometrical problem on rectangle partitions. We shall introduce here a bit more general form of the problem, the first version of which is stated as follows: let R be a rectangle in the plane which is partitioned into a finitely many rectangles R 1, R 2,..., R n, called small rectangles, which can be of different sizes, and which may overlap only on their sides. Every point of the rectangle R must be contained in one small rectangle. We say that the partitioning of R satisfies the color condition, if (1) the rectangles along the top border of R are colored white, (2) the rectangles along the bottom border of R are colored gray, and (3) all other small rectangles are colored either white or gray. In Figure 1(a) there is an example of a partition of a rectangle satisfying the color condition. (a) Figure 1: In (a) a partition of R satisfying the color condition is shown and in (b) the bold line presents a good path. (b) We wish to show that there always exists a good path, a path from the left hand border of R to the right hand border such that the path goes along the borders of differently colored rectangles: at each point (excepting the vertices of the small rectangles) on one side there is a white rectangle and on the other side there is a gray rectangle; see Figure 1(b) for an example of a good path. Note that a good path need not be a unique solution for an instance of our problem. 2 Origin of the problem Instead of colors Isbell [3] used signs + and for the small rectangles. More important difference to our approach is that the small rectangles in [3] were 1
6 assumed to be of one unit height so that they appeared leveled on horizontal lines. In the following we have no such restriction on the form of the rectangles. In his paper Isbell gave only an outline of proof of the existence of a good path, and he referred to his proof as hand waving, which is interesting because our proof will use handshaking! The first formal proof of the problem was given by J. M. Philip [4] in That proof employed some surplus inside information of the rectangles inherited from the algebraic problem setting in Isbell s paper. A rather simple topological proof was given in 1997 by the present authors together with L. Ilie in [2], where also an algorithm for finding a good path was given. The algorithm works also in the present more general framework of the problem, and therefore we shall shortly discuss the idea in it; for the proof, we refer to [2]. The idea is to dissolve borders of small rectangles as in the following: 1. merge the white rectangles along the top border of R to form a polygon, 2. merge iteratively to the so obtained polygon each white rectangle having a border that intersects with the border of the polygon, 3. if there is gray polygon completely inside the unified polygon it is also added to the polygon, 4. once there are no more small rectangles to be added to the polygon, the lowest border line of the obtained polygon defines a desired path. In Figure 2 we have shown the final polygon produced by the above algorithm for the partition in Figure 1(a). Figure 2: The final polygon obtained by the algorithm is indicated using cross hatching. The problem is fairly simple to state, and the existence of a good path is almost immediate to the eye when one uses colors like white and gray for the rectangles, but for a mathematician it is always nice, if not necessary, to find out how something fits to already established theory. In the next section we give a simple graph theoretical reasoning for the problem using a handshaking property of degrees in graphs. 2
7 3 A proof by handshaking We need only the first principles of graph theory. For more advanced topics, an interested reader is referred to the book by Chartrand and Lesniak [1]. In general, a graph G = (V, E) consists of a finite set of elements, called vertices, and a set E of edges of the form e = {x, y}, where x and y are different vertices. The degree deg(x) of a vertex x in G is the number of edges incident with x, i.e., deg(x) is the number of pairs e = {x, y} in E. A vertex x is said to be even, if deg(x) is even, and otherwise it is called odd. The following result is often referred to as the first theorem in graph theory. Its proof is imminent, since each edge provides one to the degree of each of its vertices. Lemma 1 (Handshaking lemma). If G = (V, E) is a graph with m edges, then 2m = deg(x). x V In particular, every graph has an even number of odd vertices. Let us return to our problem on rectangles. Let R be a rectangle together with a partitioning to white and gray small rectangles as in the above. We define a graph G R = (V, E) where the set V of vertices consists of the vertices (corner points) of the small rectangles, and the set E of edges consists of pairs {x, y} such that (x, y) is a line segment common to two small rectangles such that the other side of the line is white while the other side is gray; for an illustration, see the graph for our previous example in Figure 3. Figure 3: The graph G R of the rectangle of Figure 1. Only the vertices of degree at least one are drawn. Since the angles in the figures are 90 o, we have that 0 deg(x) 1 in G R for the vertices on the borders of R. Indeed, the only odd vertices are on the border: Lemma 2. Let x be an interior vertex of R, that is, it is not on a border of the rectangle R. Then deg(x) is is either 0, 2 or 4. 3
8 Proof. Since the rectangles have only right angles, either 3 or 4 small rectangles meet at each interior vertex; see Figure 4. The case of three rectangles meeting at x is illustrated in Figure 4(a). If there R 2 and R 3 are colored differently, then deg(x) = 2, because the line segment between either R 1 and R 2 or R 1 and R 3 also produces an edge in the graph G R. On the other hand, if R 2 and R 3 have the same color, then either deg(x) = 0 (if R 1 shares the common color) or deg(x) = 2 (if R 1 has a different color). In the case of four small rectangles, see Figure 4(b), we can suppose that adjacent rectangles have different colors, because otherwise we can merge two similarly colored small rectangles and in this way we reduce this case to the case illustrated in Figure 4(a). Now, we have deg(x) = 4. R 1 x R 2 R 3 R 1 R 2 R 3 R 4 (a) (b) Figure 4: In (a) x meets three rectangles and in (b) four rectangles. A walk in a graph G is any sequence W = e 1 e 2... e n of edges e i = {x i, x i+1 } that are compatible in the sense that e i+1 starts where e i ended. We say that W is from x 1 to x n+1, and denote this by x 1 x n+1. A walk is a path if no vertex is repeated, i.e., x i x j for i < j. Note that paths in the graphs G R correspond to non-self-intersecting walks along the borders of differently colored small rectangles. If W is a walk as in the above, then we obtain a path from x 1 to x n+1 by removing all cycles z z from W. For a graph G = (V, E) and a subset A V of its vertices, let cl(a) = {y V there is a walk x y for some x A} be the closure of the set A. We are now ready to prove that good paths always exist. Theorem 1. Let R be a rectangle with a partitioning to white and gray small rectangles satisfying the color condition. Then there exists a path from the left border to the right border using only lines between different colors. Proof. We show that there is an odd number vertices on the left border of R. Indeed, the vertices x on the left border are as in Figure 4(a), where now R 1 denotes the surrounding plane. The color changes at x, i.e., R 2 and R 3 are colored differently, if and only if deg(x) = 1. (Notice that if R 2 and R 3 have the same color, then deg(x) = 0.) The top small rectangles are white and 4
9 the bottom rectangles are gray, and therefore the color has to change an odd number of times when we descent down the left border. This shows that the number of odd vertices on the left border must be odd. Let then A be the set of vertices on the left border of R, and consider its closure cl(a) as part of the graph G R, i.e., remove all vertices of G R that are not in cl(a). The degrees of the interior vertices of cl(a) are the same as in G R, and thus they are all even. By Lemma 1 every graph has an even number of odd vertices, and therefore cl(a) must contain an odd vertex from the right border of R. Consequently there exists at least one path x y from the left border of R in G R that ends in an odd vertex on the right border of R. This proves our claim. 4 General polygonal partitions As in [2] also the present method can be generalized. We begin with partitions to polygons, and then argue that the case holds also for more general geometrical partitions to colored figures. Assume first that a rectangle R is partitioned to triangles instead of rectangles. Suppose that the coloring satisfies the color conditions as stated for rectangular partitions. Here a border triangle is one that has a side on the border, not only one vertex. In the color condition we require that the top border triangles have white color and the bottom border triangles have gray color. The graph G R for triangle partitions is defined in the same way as for rectangles. The problem for triangle partitions differs from the previous framework basically on the following points, see Figure 5: (1) The vertices of G R on the borders of R may have degree greater that one, and the degree of the interior vertices can be larger than four. (2) There can be vertices in G R on the top and bottom border of R. This is because a triangle may have a vertex on the border without sharing any side with the border. Lemma 3. In the graph G R of triangular partition of R, there is an odd number of odd vertices on both left and right borders of R. All other vertices are even. Proof. Consider a left border vertex x as in Figure 6(a), where x is a common vertex to k 2 triangles. Then again the color changes at x, i.e., R 1 and R k have different colors, if and only if deg(x) is odd. This holds equally well if x is a corner vertex of the big rectangle R. As in the case of rectangular partitions, when descending down the left border, the color changes an odd 5
10 (a) (b) Figure 5: In (a) there is a triangle partition, and in (b) the graph G R is illustrated. x R 1 R 2. R 1 R2... R k R k R 1 R 2... R k (a) (b) (c) Figure 6: In (a) the vertex x is on the left border of R; in (b) the vertex is on the top border, and in (c) the vertex is interior. number of times, and hence there is an odd number of odd vertices on the left border. The proof for the right border is symmetric to the above argument. Similarly, if x is on the top border as in Figure 6(b), then R 1 and R k have the same color, and hence deg(x) is even. This also holds if x is a vertex of the big rectangle, and symmetric argument shows that deg(x) is even for all vertices on the bottom border of R. Finally, if x is an interior vertex as in Figure 6(c), then, when we travel around x, the color of the triangles changes an even number of times since the original color of R 1 is invariant. Hence also in this case deg(x) is even. Now the same handshaking argument applies to G R as for the case of rectangles, and hence we have proved Theorem 2. For each triangular partition of a rectangle satisfying the color conditions, there is a path from the left border of the rectangle to the right border of the rectangle using only borders of triangles of different color. Since all polygons can be divided into triangles (which will have the same color as the original polygon) by adding diagonals, we obtain the following corollary. 6
11 Corollary 1. For each polygon partition of a rectangle satisfying the color conditions, there is a path from the left border of the rectangle to the right border of the rectangle using only borders of polygons of different color. Clearly, the borders of the figures taking part in the partitioning need not be straight lines. In topological terms, we can require that the small figures are homotopically equivalent to triangles and the big figure to a rectangle, that is, we require that there is a continuous transformation of the plane that maps each small figure to a triangle and the big figure to a rectangle. Indeed, an arbitrary partition of topologically connected parts can be simply defined with a continuous self-intersecting curve entering from the left border of the big picture and leaving from the right border of the picture, where, of course, the left and right borders have to be well defined. References [1] G. Chartland and L. Lesniak, Graphs & Digraphs, Chapman & Hall/CRC, Boca Raton, 2005 (4th edition). [2] V. Halava, T. Harju, and L. Ilie, On a Geometric Problem of Zig-Zags, Inform. Proc. Letters, 62 (1997), 1-4. [3] J. R. Isbell, Epimorphisms and dominoes, Proceedings of the Conference on Categorial Algebra, La Jolla, 1965, Springer, (1966). [4] J. M. Philip, A proof of Isbell s Zig-Zag Theorem, J. Algebra, 32 (1974),
12 Lemminkäisenkatu 14 A, Turku, Finland University of Turku Department of Information Technology Department of Mathematics Åbo Akademi University Department of Computer Science Institute for Advanced Management Systems Research Turku School of Economics and Business Administration Institute of Information Systems Sciences ISBN ISSN
Lecture 3: Art Gallery Problems and Polygon Triangulation
EECS 396/496: Computational Geometry Fall 2017 Lecture 3: Art Gallery Problems and Polygon Triangulation Lecturer: Huck Bennett In this lecture, we study the problem of guarding an art gallery (specified
More informationCombining Isometries- The Symmetry Group of a Square
Combining Isometries- The Symmetry Group of a Square L.A. Romero August 22, 2017 1 The Symmetry Group of a Square We begin with a definition. Definition 1.1. The symmetry group of a figure is the collection
More informationSPERNER S LEMMA MOOR XU
SPERNER S LEMMA MOOR XU Abstract. Is it possible to dissect a square into an odd number of triangles of equal area? This question was first answered by Paul Monsky in 970, and the solution requires elements
More informationOn the Number of Tilings of a Square by Rectangles
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange University of Tennessee Honors Thesis Projects University of Tennessee Honors Program 5-2012 On the Number of Tilings
More informationThe following is a summary, hand-waving certain things which actually should be proven.
1 Basics of Planar Graphs The following is a summary, hand-waving certain things which actually should be proven. 1.1 Plane Graphs A plane graph is a graph embedded in the plane such that no pair of lines
More informationLecture 20 : Trees DRAFT
CS/Math 240: Introduction to Discrete Mathematics 4/12/2011 Lecture 20 : Trees Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we discussed graphs. Today we continue this discussion,
More informationSPERNER S LEMMA, BROUWER S FIXED-POINT THEOREM, AND THE SUBDIVISION OF SQUARES INTO TRIANGLES
SPERNER S LEMMA, BROUWER S FIXED-POINT THEOREM, AND THE SUBDIVISION OF SQUARES INTO TRIANGLES AKHIL MATHEW Abstract These are notes from a talk I gave for high-schoolers at the Harvard- MIT Mathematics
More informationComputer Science 280 Fall 2002 Homework 10 Solutions
Computer Science 280 Fall 2002 Homework 10 Solutions Part A 1. How many nonisomorphic subgraphs does W 4 have? W 4 is the wheel graph obtained by adding a central vertex and 4 additional "spoke" edges
More informationMath 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem
Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem David Glickenstein November 26, 2008 1 Graph minors Let s revisit some de nitions. Let G = (V; E) be a graph. De nition 1 Removing
More informationBasics of Graph Theory
Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationLecture 15: The subspace topology, Closed sets
Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology
More informationThe Geometry of Carpentry and Joinery
The Geometry of Carpentry and Joinery Pat Morin and Jason Morrison School of Computer Science, Carleton University, 115 Colonel By Drive Ottawa, Ontario, CANADA K1S 5B6 Abstract In this paper we propose
More informationMath 170- Graph Theory Notes
1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory
More informationChapter 6. Planar Orientations. 6.1 Numberings of Digraphs
Chapter 6 Planar Orientations In this chapter we will focus on algorithms and techniques used for drawing planar graphs. The algorithms we will use are based on numbering the vertices and orienting the
More informationSlides for Faculty Oxford University Press All rights reserved.
Oxford University Press 2013 Slides for Faculty Assistance Preliminaries Author: Vivek Kulkarni vivek_kulkarni@yahoo.com Outline Following topics are covered in the slides: Basic concepts, namely, symbols,
More informationEuler s Theorem. Brett Chenoweth. February 26, 2013
Euler s Theorem Brett Chenoweth February 26, 2013 1 Introduction This summer I have spent six weeks of my holidays working on a research project funded by the AMSI. The title of my project was Euler s
More informationPartitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: lower and upper bounds on the number of pieces
Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: lower and upper bounds on the number of pieces António Leslie Bajuelos 1, Ana Paula Tomás and Fábio Marques 3 1 Dept.
More informationEULER S FORMULA AND THE FIVE COLOR THEOREM
EULER S FORMULA AND THE FIVE COLOR THEOREM MIN JAE SONG Abstract. In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler s formula and apply
More informationMC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points
MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you
More informationGraph Theory Mini-course
Graph Theory Mini-course Anthony Varilly PROMYS, Boston University, Boston, MA 02215 Abstract Intuitively speaking, a graph is a collection of dots and lines joining some of these dots. Many problems in
More informationPlanar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
More informationA digital pretopology and one of its quotients
Volume 39, 2012 Pages 13 25 http://topology.auburn.edu/tp/ A digital pretopology and one of its quotients by Josef Šlapal Electronically published on March 18, 2011 Topology Proceedings Web: http://topology.auburn.edu/tp/
More information1 Appendix to notes 2, on Hyperbolic geometry:
1230, notes 3 1 Appendix to notes 2, on Hyperbolic geometry: The axioms of hyperbolic geometry are axioms 1-4 of Euclid, plus an alternative to axiom 5: Axiom 5-h: Given a line l and a point p not on l,
More informationDiscrete mathematics
Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2017/2018 About this file This file is meant to be a guideline for the lecturer. Many
More informationTopology Homework 3. Section Section 3.3. Samuel Otten
Topology Homework 3 Section 3.1 - Section 3.3 Samuel Otten 3.1 (1) Proposition. The intersection of finitely many open sets is open and the union of finitely many closed sets is closed. Proof. Note that
More informationThe Geodesic Integral on Medial Graphs
The Geodesic Integral on Medial Graphs Kolya Malkin August 013 We define the geodesic integral defined on paths in the duals of medial graphs on surfaces and use it to study lens elimination and connection
More informationMinimum congestion spanning trees of grids and discrete toruses
Minimum congestion spanning trees of grids and discrete toruses A. Castejón Department of Applied Mathematics I Higher Technical School of Telecommunications Engineering (ETSIT) Universidad de Vigo Lagoas-Marcosende
More informationON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE**
Chin. Ann. of Math. 23B:(2002),87-9. ON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE** XU Changqing* DING Ren* Abstract The authors discuss the partition of a finite set of points in the plane
More information2. Draw a non-isosceles triangle. Now make a template of this triangle out of cardstock or cardboard.
Tessellations The figure at the left shows a tiled floor. Because the floor is entirely covered by the tiles we call this arrangement a tessellation of the plane. A regular tessellation occurs when: The
More informationarxiv: v1 [math.co] 7 Oct 2010
NIM ON THE COMPLETE GRAPH LINDSAY ERICKSON arxiv:1010.155v1 [math.co] 7 Oct 2010 Abstract The game ofnim asplayedon graphswasintroduced in [] and extended in [] by Masahiko Fukuyama. His papers detail
More informationMAT 145: PROBLEM SET 4
MAT 145: PROBLEM SET 4 DUE TO FRIDAY FEB 22 Abstract. This problem set corresponds to the sixth week of the Combinatorics Course in the Winter Quarter 2019. It was posted online on Friday Feb 15 and is
More informationLecture 22 Tuesday, April 10
CIS 160 - Spring 2018 (instructor Val Tannen) Lecture 22 Tuesday, April 10 GRAPH THEORY Directed Graphs Directed graphs (a.k.a. digraphs) are an important mathematical modeling tool in Computer Science,
More informationThe National Strategies Secondary Mathematics exemplification: Y8, 9
Mathematics exemplification: Y8, 9 183 As outcomes, Year 8 pupils should, for example: Understand a proof that the sum of the angles of a triangle is 180 and of a quadrilateral is 360, and that the exterior
More informationSome Upper Bounds for Signed Star Domination Number of Graphs. S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour.
Some Upper Bounds for Signed Star Domination Number of Graphs S. Akbari, A. Norouzi-Fard, A. Rezaei, R. Rotabi, S. Sabour Abstract Let G be a graph with the vertex set V (G) and edge set E(G). A function
More informationAcute Triangulations of Polygons
Europ. J. Combinatorics (2002) 23, 45 55 doi:10.1006/eujc.2001.0531 Available online at http://www.idealibrary.com on Acute Triangulations of Polygons H. MAEHARA We prove that every n-gon can be triangulated
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More information9 About Intersection Graphs
9 About Intersection Graphs Since this lecture we focus on selected detailed topics in Graph theory that are close to your teacher s heart... The first selected topic is that of intersection graphs, i.e.
More informationCONNECTED SPACES AND HOW TO USE THEM
CONNECTED SPACES AND HOW TO USE THEM 1. How to prove X is connected Checking that a space X is NOT connected is typically easy: you just have to find two disjoint, non-empty subsets A and B in X, such
More informationTopological Invariance under Line Graph Transformations
Symmetry 2012, 4, 329-335; doi:103390/sym4020329 Article OPEN ACCESS symmetry ISSN 2073-8994 wwwmdpicom/journal/symmetry Topological Invariance under Line Graph Transformations Allen D Parks Electromagnetic
More informationWhich n-venn diagrams can be drawn with convex k-gons?
Which n-venn diagrams can be drawn with convex k-gons? Jeremy Carroll Frank Ruskey Mark Weston Abstract We establish a new lower bound for the number of sides required for the component curves of simple
More informationEXTREME POINTS AND AFFINE EQUIVALENCE
EXTREME POINTS AND AFFINE EQUIVALENCE The purpose of this note is to use the notions of extreme points and affine transformations which are studied in the file affine-convex.pdf to prove that certain standard
More informationAn Introduction to Graph Theory
An Introduction to Graph Theory Evelyne Smith-Roberge University of Waterloo March 22, 2017 What is a graph? Definition A graph G is: a set V (G) of objects called vertices together with: a set E(G), of
More informationA Reduction of Conway s Thrackle Conjecture
A Reduction of Conway s Thrackle Conjecture Wei Li, Karen Daniels, and Konstantin Rybnikov Department of Computer Science and Department of Mathematical Sciences University of Massachusetts, Lowell 01854
More informationFinal Test in MAT 410: Introduction to Topology Answers to the Test Questions
Final Test in MAT 410: Introduction to Topology Answers to the Test Questions Stefan Kohl Question 1: Give the definition of a topological space. (3 credits) A topological space (X, τ) is a pair consisting
More informationTutte s Theorem: How to draw a graph
Spectral Graph Theory Lecture 15 Tutte s Theorem: How to draw a graph Daniel A. Spielman October 22, 2018 15.1 Overview We prove Tutte s theorem [Tut63], which shows how to use spring embeddings to obtain
More informationPreferred directions for resolving the non-uniqueness of Delaunay triangulations
Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation
More informationThe Game of Criss-Cross
Chapter 5 The Game of Criss-Cross Euler Characteristic ( ) Overview. The regions on a map and the faces of a cube both illustrate a very natural sort of situation: they are each examples of regions that
More informationAlgebraic Graph Theory- Adjacency Matrix and Spectrum
Algebraic Graph Theory- Adjacency Matrix and Spectrum Michael Levet December 24, 2013 Introduction This tutorial will introduce the adjacency matrix, as well as spectral graph theory. For those familiar
More informationDiscrete Applied Mathematics. A revision and extension of results on 4-regular, 4-connected, claw-free graphs
Discrete Applied Mathematics 159 (2011) 1225 1230 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam A revision and extension of results
More informationProduct constructions for transitive decompositions of graphs
116 Product constructions for transitive decompositions of graphs Geoffrey Pearce Abstract A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition
More informationMaximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded Cemil Dibek Tınaz Ekim Pinar Heggernes Abstract We determine the maximum number of edges that a claw-free
More informationINTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES
INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance
More informationDefinition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points.
Math 3181 Dr. Franz Rothe Name: All3181\3181_spr13t1.tex 1 Solution of Test I Definition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points. Definition
More informationHamiltonian cycles in bipartite quadrangulations on the torus
Hamiltonian cycles in bipartite quadrangulations on the torus Atsuhiro Nakamoto and Kenta Ozeki Abstract In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple
More informationPolyominoes and Polyiamonds as Fundamental Domains for Isohedral Tilings of Crystal Class D 2
Symmetry 2011, 3, 325-364; doi:10.3390/sym3020325 OPEN ACCESS symmetry ISSN 2073-8994 www.mdpi.com/journal/symmetry Article Polyominoes and Polyiamonds as Fundamental Domains for Isohedral Tilings of Crystal
More informationPolyominoes and Polyiamonds as Fundamental Domains for Isohedral Tilings of Crystal Class D 2
Symmetry 2011, 3, 325-364; doi:10.3390/sym3020325 OPEN ACCESS symmetry ISSN 2073-8994 www.mdpi.com/journal/symmetry Article Polyominoes and Polyiamonds as Fundamental Domains for Isohedral Tilings of Crystal
More informationLecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets
Lecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets Saul Glasman 14 September 2016 Let s give the definition of an open subset of R. Definition 1. Let U R. We
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 7 Graph properties By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-2: Eulerian
More informationPolygon Triangulation
Polygon Triangulation Definition Simple Polygons 1. A polygon is the region of a plane bounded by a finite collection of line segments forming a simple closed curve. 2. Simple closed curve means a certain
More informationDomination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes
Domination, Independence and Other Numbers Associated With the Intersection Graph of a Set of Half-planes Leonor Aquino-Ruivivar Mathematics Department, De La Salle University Leonorruivivar@dlsueduph
More informationRubber bands. Chapter Rubber band representation
Chapter 1 Rubber bands In the previous chapter, we already used the idea of looking at the graph geometrically, by placing its nodes on the line and replacing the edges by rubber bands. Since, however,
More informationA GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY
A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,
More informationInapproximability of the Perimeter Defense Problem
Inapproximability of the Perimeter Defense Problem Evangelos Kranakis Danny Krizanc Lata Narayanan Kun Xu Abstract We model the problem of detecting intruders using a set of infrared beams by the perimeter
More informationA note on isolate domination
Electronic Journal of Graph Theory and Applications 4 (1) (016), 94 100 A note on isolate domination I. Sahul Hamid a, S. Balamurugan b, A. Navaneethakrishnan c a Department of Mathematics, The Madura
More informationSymmetric Product Graphs
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 5-20-2015 Symmetric Product Graphs Evan Witz Follow this and additional works at: http://scholarworks.rit.edu/theses
More informationAlgorithms for Euclidean TSP
This week, paper [2] by Arora. See the slides for figures. See also http://www.cs.princeton.edu/~arora/pubs/arorageo.ps Algorithms for Introduction This lecture is about the polynomial time approximation
More informationSome bounds on chromatic number of NI graphs
International Journal of Mathematics and Soft Computing Vol.2, No.2. (2012), 79 83. ISSN 2249 3328 Some bounds on chromatic number of NI graphs Selvam Avadayappan Department of Mathematics, V.H.N.S.N.College,
More informationLecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) January 11, 2018 Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1 In this lecture
More informationWUCT121. Discrete Mathematics. Graphs
WUCT121 Discrete Mathematics Graphs WUCT121 Graphs 1 Section 1. Graphs 1.1. Introduction Graphs are used in many fields that require analysis of routes between locations. These areas include communications,
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 8 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite
More informationCS6100: Topics in Design and Analysis of Algorithms
CS6100: Topics in Design and Analysis of Algorithms Guarding and Triangulating Polygons John Augustine CS6100 (Even 2012): Guarding and Triangulating Polygons The Art Gallery Problem A simple polygon is
More informationMath 485, Graph Theory: Homework #3
Math 485, Graph Theory: Homework #3 Stephen G Simpson Due Monday, October 26, 2009 The assignment consists of Exercises 2129, 2135, 2137, 2218, 238, 2310, 2313, 2314, 2315 in the West textbook, plus the
More informationAn Investigation of the Planarity Condition of Grötzsch s Theorem
Le Chen An Investigation of the Planarity Condition of Grötzsch s Theorem The University of Chicago: VIGRE REU 2007 July 16, 2007 Abstract The idea for this paper originated from Professor László Babai
More informationSection 3.4 Basic Results of Graph Theory
1 Basic Results of Graph Theory Section 3.4 Basic Results of Graph Theory Purpose of Section: To formally introduce the symmetric relation of a (undirected) graph. We introduce such topics as Euler Tours,
More informationIntroduction III. Graphs. Motivations I. Introduction IV
Introduction I Graphs Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Graph theory was introduced in the 18th century by Leonhard Euler via the Königsberg
More informationDiscrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs
CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 13 An Introduction to Graphs Formulating a simple, precise specification of a computational problem is often a prerequisite to writing a
More informationComputational Geometry
Motivation Motivation Polygons and visibility Visibility in polygons Triangulation Proof of the Art gallery theorem Two points in a simple polygon can see each other if their connecting line segment is
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationOn the undecidability of the tiling problem. Jarkko Kari. Mathematics Department, University of Turku, Finland
On the undecidability of the tiling problem Jarkko Kari Mathematics Department, University of Turku, Finland Consider the following decision problem, the tiling problem: Given a finite set of tiles (say,
More informationFundamentals of Graph Theory MATH Fundamentals of Graph Theory. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Fundamentals of Graph Theory Benjamin V.C. Collins James A. Swenson The seven bridges of Königsberg Map: Merian-Erben [Public domain], via Wikimedia Commons The seven bridges of Königsberg Map:
More informationDefinition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1
Graph fundamentals Bipartite graph characterization Lemma. If a graph contains an odd closed walk, then it contains an odd cycle. Proof strategy: Consider a shortest closed odd walk W. If W is not a cycle,
More information6c Lecture 3 & 4: April 8 & 10, 2014
6c Lecture 3 & 4: April 8 & 10, 2014 3.1 Graphs and trees We begin by recalling some basic definitions from graph theory. Definition 3.1. A (undirected, simple) graph consists of a set of vertices V and
More informationMa/CS 6b Class 26: Art Galleries and Politicians
Ma/CS 6b Class 26: Art Galleries and Politicians By Adam Sheffer The Art Gallery Problem Problem. We wish to place security cameras at a gallery, such that they cover it completely. Every camera can cover
More informationPlanarity. 1 Introduction. 2 Topological Results
Planarity 1 Introduction A notion of drawing a graph in the plane has led to some of the most deep results in graph theory. Vaguely speaking by a drawing or embedding of a graph G in the plane we mean
More informationUniform edge-c-colorings of the Archimedean Tilings
Discrete & Computational Geometry manuscript No. (will be inserted by the editor) Uniform edge-c-colorings of the Archimedean Tilings Laura Asaro John Hyde Melanie Jensen Casey Mann Tyler Schroeder Received:
More informationThe crossing number of K 1,4,n
Discrete Mathematics 308 (2008) 1634 1638 www.elsevier.com/locate/disc The crossing number of K 1,4,n Yuanqiu Huang, Tinglei Zhao Department of Mathematics, Normal University of Hunan, Changsha 410081,
More informationPlanar Drawing of Bipartite Graph by Eliminating Minimum Number of Edges
UITS Journal Volume: Issue: 2 ISSN: 2226-32 ISSN: 2226-328 Planar Drawing of Bipartite Graph by Eliminating Minimum Number of Edges Muhammad Golam Kibria Muhammad Oarisul Hasan Rifat 2 Md. Shakil Ahamed
More informationIndexable and Strongly Indexable Graphs
Proceedings of the Pakistan Academy of Sciences 49 (2): 139-144 (2012) Copyright Pakistan Academy of Sciences ISSN: 0377-2969 Pakistan Academy of Sciences Original Article Indexable and Strongly Indexable
More informationCharacterization of Boolean Topological Logics
Characterization of Boolean Topological Logics Short Form: Boolean Topological Logics Anthony R. Fressola Denison University Granville, OH 43023 University of Illinois Urbana-Champaign, IL USA 61801-61802
More informationExtremal Graph Theory: Turán s Theorem
Bridgewater State University Virtual Commons - Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 5-9-07 Extremal Graph Theory: Turán s Theorem Vincent Vascimini
More informationFinal Exam, F11PE Solutions, Topology, Autumn 2011
Final Exam, F11PE Solutions, Topology, Autumn 2011 Question 1 (i) Given a metric space (X, d), define what it means for a set to be open in the associated metric topology. Solution: A set U X is open if,
More informationModule 7. Independent sets, coverings. and matchings. Contents
Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................
More informationOn the number of distinct directions of planes determined by n points in R 3
On the number of distinct directions of planes determined by n points in R 3 Rom Pinchasi August 27, 2007 Abstract We show that any set of n points in R 3, that is not contained in a plane, determines
More informationTilings of the Euclidean plane
Tilings of the Euclidean plane Yan Der, Robin, Cécile January 9, 2017 Abstract This document gives a quick overview of a eld of mathematics which lies in the intersection of geometry and algebra : tilings.
More informationTiling Rectangles with Gaps by Ribbon Right Trominoes
Open Journal of Discrete Mathematics, 2017, 7, 87-102 http://www.scirp.org/journal/ojdm ISSN Online: 2161-7643 ISSN Print: 2161-7635 Tiling Rectangles with Gaps by Ribbon Right Trominoes Premalatha Junius,
More informationarxiv: v2 [math.co] 13 Aug 2013
Orthogonality and minimality in the homology of locally finite graphs Reinhard Diestel Julian Pott arxiv:1307.0728v2 [math.co] 13 Aug 2013 August 14, 2013 Abstract Given a finite set E, a subset D E (viewed
More informationPolygon Partitioning. Lecture03
1 Polygon Partitioning Lecture03 2 History of Triangulation Algorithms 3 Outline Monotone polygon Triangulation of monotone polygon Trapezoidal decomposition Decomposition in monotone mountain Convex decomposition
More informationKuratowski Notes , Fall 2005, Prof. Peter Shor Revised Fall 2007
Kuratowski Notes 8.30, Fall 005, Prof. Peter Shor Revised Fall 007 Unfortunately, the OCW notes on Kuratowski s theorem seem to have several things substantially wrong with the proof, and the notes from
More informationMirrors of reflections of regular maps
ISSN 1855-3966 (printed edn), ISSN 1855-3974 (electronic edn) ARS MATHEMATICA CONTEMPORANEA 15 (018) 347 354 https://doiorg/106493/1855-3974145911d (Also available at http://amc-journaleu) Mirrors of reflections
More information