Non-Hamiltonian and Non-Traceable Regular 3-Connected Planar Graphs
|
|
- Baldwin Greene
- 6 years ago
- Views:
Transcription
1 Introduction Quartic Quintic Conclusion Non-Hamiltonian and Non-Traceable Regular 3-Connected Planar Graphs Nico Van Cleemput Carol T. Zamfirescu Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics, Computer Science and Statistics Ghent University Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 1
2 Introduction Quartic Quintic Conclusion 1 Introduction Definitions Cubic Quartic Quintic Summary 2 Quartic Upper bound c 4 Lower bound c 4 Upper bound p 4 3 Quintic Upper bound p 5 4 Conclusion Summary Future work Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 2
3 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Here, a polyhedron is a planar 3-connected graph. The word regular is used exclusively in the graph-theoretical sense of having all vertices of the same degree. By Euler s formula, there are k-regular polyhedra for exactly three values of k: 3, 4, or 5. Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 3
4 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Let c k be the order of the smallest non-hamiltonian k-regular polyhedron. Let p k be the order of the smallest non-traceable k-regular polyhedron. Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 4
5 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Cubic polyhedra hamiltonicity Tait conjectured in 1884 that every cubic polyhedron is hamiltonian. The conjecture became famous because it implied the Four Colour Theorem (at that time still the Four Colour Problem) Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 5
6 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Cubic polyhedra hamiltonicity The first to construct a counterexample (of order 46) was Tutte in 1946 Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 6
7 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Cubic polyhedra hamiltonicity Lederberg, Bosák, and Barnette (pairwise independently) described a smaller counterexample having 38 vertices. Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 7
8 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Cubic polyhedra hamiltonicity After a long series of papers by various authors (e.g., Butler, Barnette, Wegner, Okamura), Holton and McKay showed that all cubic polyhedra on up to 36 vertices are hamiltonian. Theorem (Holton and McKay, 1988) c 3 = 38 Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 8
9 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Cubic polyhedra traceability Balinski asked whether cubic non-traceable polyhedra exist Brown and independently Grünbaum and Motzkin proved the existence of such graphs Klee asked for determining p 3 Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 9
10 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Cubic polyhedra traceability In 1970 T. Zamfirescu constructed this cubic non-traceable planar graph on 88 vertices Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 10
11 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Cubic polyhedra traceability Based on work of Okamura, Knorr improved a result of Hoffmann by showing that all cubic planar graphs on up to 52 vertices are traceable. Theorem (Knorr, 2010 and Zamfirescu, 1970) 54 p 3 88 Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 11
12 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Quartic polyhedra hamiltonicity Following work of Sachs from 1967 and Walther from 1969, Zaks proved in 1976 that there exists a quartic non-hamiltonian polyhedron of order 209. The actual number given in Zaks paper is false, as pointed out in work of Owens therein the correct number can be found. Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 12
13 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Quartic polyhedra hamiltonicity Theorem (Sachs, 1967) If there exists a non-hamiltonian (non-traceable) cubic polyhedron of order n, then there exists a non-traceable (non-hamiltonian) quartic polyhedron on 9n 2 vertices. On page 132 of Bosák s book it is claimed that converting the Lederberg-Bosák-Barnette graph with this method gives a quartic non-hamiltonian polyhedron of order 161. However, the correct number should be = 171. Theorem (Sachs, 1967 combined with Bosák, 1990) c Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 13
14 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Quartic polyhedra traceability Zaks showed that p Using Sachs theorem on Zamfirescu s 88-vertex graph gives a non-traceable quartic polyhedron on 396 vertices. Theorem (Sachs, 1967 combined with Zamfirescu, 1970) p Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 14
15 Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Quintic polyhedra Previous work includes papers by Walther, as well as Harant, Owens, Tkáč, and Walther. Zaks showed that c and p Owens proved that c 5 76 and p Theorem (Owens, 1980) c 5 76 p Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 15
16 Summary Introduction Quartic Quintic Conclusion Definitions Cubic Quartic Quintic Summary Hamiltonicity Traceability Cubic c 3 = p 3 88 Quartic c p Quintic c 5 76 p Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 16
17 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Upper bound hamiltonicity Theorem (Van Cleemput and Zamfirescu, 2017+) c 4 39 Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 17
18 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Upper bound hamiltonicity weak strong Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 18
19 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Upper bound hamiltonicity Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 19
20 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Upper bound hamiltonicity x F 1 y F 3 F 2 z Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 20
21 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Upper bound hamiltonicity x F 1 y F 3 F 2 z Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 21
22 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity Check all quartic polyhedra for being hamiltonian. Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 22
23 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity hamiltonicity check Simple backtracking algorithm that tries to construct a cycle from the first vertex. Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 23
24 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity hamiltonicity check No optimisation Start reachable No unreachable vertices Faces on two sides Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 24
25 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity hamiltonicity check No optimisation 2 5 Start reachable No unreachable vertices Faces on two sides No plane graph Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 24
26 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity generation 100% Generating graphs Checking hamiltonicity 50% 0% Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 25
27 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity generation Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 26
28 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity generation Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 27
29 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity generation Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 28
30 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity generation Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 29
31 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity generation Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 30
32 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity generation 100% 50% Not constructed Type 1 Type 2 Remaining 0% Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 31
33 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity generation Without filtering With filtering Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 32
34 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Lower bound hamiltonicity Theorem (Van Cleemput and Zamfirescu, 2017+) c 4 34 Vertices Time minutes minutes hours hours days days days years years Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 33
35 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Upper bound traceability Theorem (Van Cleemput and Zamfirescu, 2017+) p 4 78 Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 34
36 Introduction Quartic Quintic Conclusion Upper bound c 4 Lower bound c 4 Upper bound p 4 Upper bound traceability = 78 vertices Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 35
37 Introduction Quartic Quintic Conclusion Upper bound p 5 Upper bound traceability Theorem (Van Cleemput and Zamfirescu, 2017+) p α α α α β α β α Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 36
38 Introduction Quartic Quintic Conclusion Upper bound p 5 Upper bound traceability α β Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 37
39 Summary Introduction Quartic Quintic Conclusion Summary Future work Hamiltonicity Traceability Cubic c 3 = p 3 88 Quartic c p c p 4 78 Quintic c 5 76 p c p Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 38
40 Introduction Quartic Quintic Conclusion Summary Future work Future work c 4 35? Hamiltonicity for quintic case Lower bounds for traceability Nico Van Cleemput, Carol T. Zamfirescu Non-Hamiltonian and Non-Traceable Regular Polyhedra 39
Generation of hypohamiltonian graphs
Generation of hypohamiltonian graphs Jan Goedgebeur* Carol T. Zamfirescu * Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer Science Ghent University,
More informationand Heinz-Jürgen Voss
Discussiones Mathematicae Graph Theory 22 (2002 ) 193 198 ON k-trestles IN POLYHEDRAL GRAPHS Michal Tkáč Department of Mathematics The Faculty of Business Economics in Košice University of Economics in
More informationMock Exam. Juanjo Rué Discrete Mathematics II, Winter Deadline: 14th January 2014 (Tuesday) by 10:00, at the end of the lecture.
Mock Exam Juanjo Rué Discrete Mathematics II, Winter 2013-2014 Deadline: 14th January 2014 (Tuesday) by 10:00, at the end of the lecture. Problem 1 (2 points): 1. State the definition of perfect graph
More informationWeek 9: Planar and non-planar graphs. 1st and 3rd of November, 2017
(1/26) MA284 : Discrete Mathematics Week 9: Planar and non-planar graphs http://www.maths.nuigalway.ie/~niall/ma284/ 1st and 3rd of November, 2017 1 Recall... planar graphs and Euler s formula 2 Non-planar
More informationBrief History. Graph Theory. What is a graph? Types of graphs Directed graph: a graph that has edges with specific directions
Brief History Graph Theory What is a graph? It all began in 1736 when Leonhard Euler gave a proof that not all seven bridges over the Pregolya River could all be walked over once and end up where you started.
More informationMathematics and Statistics, Part A: Graph Theory Revision Exercises: Sheet 3
Mathematics and Statistics, Part A: Graph Theory Revision Exercises: Sheet 3 1. Prove Caley s theorem. There are n n 2 distinct labelled trees on n vertices. (i) Sketch a tree with 11 edges and find the
More informationarxiv: v4 [math.co] 6 Dec 2015
Planar Hypohamiltonian Graphs on 40 Vertices Mohammadreza Jooyandeh, Brendan D. McKay arxiv:1302.2698v4 [math.co] 6 Dec 2015 Research School of Computer Science, Australian National University, ACT 0200,
More informationDiscrete Mathematics Course Review 3
21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has
More informationOn vertex-degree restricted subgraphs in polyhedral graphs
Discrete Mathematics 256 (2002) 105 114 www.elsevier.com/locate/disc On vertex-degree restricted subgraphs in polyhedral graphs Igor Fabrici Department of Mathematics, Technical University Ilmenau, PF
More informationarxiv: v1 [math.co] 18 Nov 2016
Nonempty intersection of longest paths in 2K 2 -free graphs arxiv:1611.05967v1 [math.co] 18 Nov 2016 Gili Golan and Songling Shan Vanderbilt University, Nashville, TN37240 Abstract In 1966, Gallai asked
More informationON PROPERTIES OF MAXIMAL 1-PLANAR GRAPHS 1
Discussiones Mathematicae Graph Theory 32 (2012) 737 747 doi:10.7151/dmgt.1639 ON PROPERTIES OF MAXIMAL 1-PLANAR GRAPHS 1 Dávid Hudák, Tomáš Madaras Institute of Mathematics, Faculty of Sciences University
More informationPublic Defence. Jan Goedgebeur
Generation Algorithms for Mathematical and Chemical Problems Public Defence Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics, Computer Science and Statistics Ghent
More informationEuler Characteristic
Euler Characteristic Rebecca Robinson May 15, 2007 Euler Characteristic Rebecca Robinson 1 PLANAR GRAPHS 1 Planar graphs v = 5, e = 4, f = 1 v e + f = 2 v = 6, e = 7, f = 3 v = 4, e = 6, f = 4 v e + f
More informationAutomated Conjecturing for Proof Discovery
Automated Conjecturing for Proof Discovery Craig Larson (joint work with Nico Van Cleemput) Virginia Commonwealth University Ghent University CombinaTexas Texas A&M University 8 May 2016 Kiran Chilakamarri
More informationINTRODUCTION TO GRAPH THEORY. 1. Definitions
INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident with
More informationConstruction of planar triangulations with minimum degree 5
Construction of planar triangulations with minimum degree 5 G. Brinkmann Fakultät für Mathematik Universität Bielefeld D 33501 Bielefeld, Germany gunnar@mathematik.uni-bielefeld.de Brendan D. McKay Department
More informationWorksheet 28: Wednesday November 18 Euler and Topology
Worksheet 28: Wednesday November 18 Euler and Topology The Konigsberg Problem: The Foundation of Topology The Konigsberg Bridge Problem is a very famous problem solved by Euler in 1735. The process he
More information8 NP-complete problem Hard problems: demo
Ch8 NPC Millennium Prize Problems http://en.wikipedia.org/wiki/millennium_prize_problems 8 NP-complete problem Hard problems: demo NP-hard (Non-deterministic Polynomial-time hard), in computational complexity
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 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 informationWeek 10: Colouring graphs, and Euler s paths. 14 and 16 November, 2018
Wednesday's slides (1/34) MA284 : Discrete Mathematics Week 10: Colouring graphs, and Euler s paths http://www.maths.nuigalway.ie/ niall/ma284/ 14 and 16 November, 2018 1 Colouring The Four Colour Theorem
More informationNon-Hamiltonian 3 Regular Graphs with Arbitrary Girth
Universal Journal of Applied Mathematics 2(1): 72-78, 2014 DOI: 10.13189/ujam.2014.020111 http://www.hrpub.org Non-Hamiltonian 3 Regular Graphs with Arbitrary Girth M. Haythorpe School of Computer Science,
More informationInduced Forests in Planar Graphs
Induced Forests in Planar Graphs Franklin Wu Advisor: Jacques Verstraete May 28, 2010 1 Contents 1 Introduction 3 1.1 Graphs............................... 3 1.2 Planar Graphs...........................
More information6 Planar Graphs. 6.1 Euler's Formula
6 Planar Graphs Roughly speaking, a graph is planar if and only if it can be drawn in the plane without any two of its edges crossing. More formally, an embedding of a graph G = (V; E) is a function f
More information14 More Graphs: Euler Tours and Hamilton Cycles
14 More Graphs: Euler Tours and Hamilton Cycles 14.1 Degrees The degree of a vertex is the number of edges coming out of it. The following is sometimes called the First Theorem of Graph Theory : Lemma
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationarxiv: v2 [math.co] 23 Jan 2018
CONNECTIVITY OF CUBICAL POLYTOPES HOA THI BUI, GUILLERMO PINEDA-VILLAVICENCIO, AND JULIEN UGON arxiv:1801.06747v2 [math.co] 23 Jan 2018 Abstract. A cubical polytope is a polytope with all its facets being
More informationWeek 9: Planar and non-planar graphs. 7 and 9 November, 2018
(1/27) MA284 : Discrete Mathematics Week 9: Planar and non-planar graphs http://www.maths.nuigalway.ie/ niall/ma284/ 7 and 9 November, 2018 1 Planar graphs and Euler s formula 2 Non-planar graphs K 5 K
More informationPOLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if
POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :
More informationTopics on Computing and Mathematical Sciences I Graph Theory (13) Summary and Review
Topics on Computing and Mathematical Sciences I Graph Theory () Summary and Review Yoshio Okamoto Tokyo Institute of Technology July, 00 Schedule Basic Topics Definition of Graphs; Paths and Cycles Cycles;
More informationAcyclic Colorings of Graph Subdivisions
Acyclic Colorings of Graph Subdivisions Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides, and Md. Saidur Rahman 3 Department of Computer Science, University of Manitoba Department of Computer Science,
More informationWeek 10: Colouring graphs, and Euler s paths. 14 and 16 November, 2018
MA284 : Discrete Mathematics Week 10: Colouring graphs, and Euler s paths http://www.maths.nuigalway.ie/ niall/ma284/ 14 and 16 November, 2018 1 Colouring The Four Colour Theorem 2 Graph colouring Chromatic
More informationIntroduction to. Graph Theory. Second Edition. Douglas B. West. University of Illinois Urbana. ftentice iiilil PRENTICE HALL
Introduction to Graph Theory Second Edition Douglas B. West University of Illinois Urbana ftentice iiilil PRENTICE HALL Upper Saddle River, NJ 07458 Contents Preface xi Chapter 1 Fundamental Concepts 1
More informationTWO CONTRIBUTIONS OF EULER
TWO CONTRIBUTIONS OF EULER SIEMION FAJTLOWICZ. MATH 4315 Eulerian Tours. Although some mathematical problems which now can be thought of as graph-theoretical, go back to the times of Euclid, the invention
More informationA Topologically Convex Vertex-Ununfoldable Polyhedron
A Topologically Convex Vertex-Ununfoldable Polyhedron Zachary Abel 1 Erik D. Demaine 2 Martin L. Demaine 2 1 MIT Department of Mathematics 2 MIT CSAIL CCCG 2011 Abel, Demaine, and Demaine (MIT) A Vertex-Ununfoldable
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 informationLinear programming and the efficiency of the simplex algorithm for transportation polytopes
Linear programming and the efficiency of the simplex algorithm for transportation polytopes Edward D. Kim University of Wisconsin-La Crosse February 20, 2015 Loras College Department of Mathematics Colloquium
More information1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationChapter 6 GRAPH COLORING
Chapter 6 GRAPH COLORING A k-coloring of (the vertex set of) a graph G is a function c : V (G) {1, 2,..., k} such that c (u) 6= c (v) whenever u is adjacent to v. Ifak-coloring of G exists, then G is called
More informationCircuit Walks in Integral Polyhedra
Circuit Walks in Integral Polyhedra Charles Viss Steffen Borgwardt University of Colorado Denver Optimization and Discrete Geometry: Theory and Practice Tel Aviv University, April 2018 LINEAR PROGRAMMING
More informationFinal Exam Math 38 Graph Theory Spring 2017 Due on Friday, June 2, at 12:50 pm. Good Luck!!
Final Exam Math 38 Graph Theory Spring 2017 Due on Friday, June 2, at 12:50 pm NAME: Instructions: You can use the textbook (Doug West s Introduction to Graph Theory, without solutions), your notes from
More informationStructure generation
Structure generation Generation of generalized cubic graphs N. Van Cleemput Exhaustive isomorph-free structure generation Create all structures from a given class of combinatorial structures without isomorphic
More informationThe Fibonacci hypercube
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 187 196 The Fibonacci hypercube Fred J. Rispoli Department of Mathematics and Computer Science Dowling College, Oakdale, NY 11769 U.S.A. Steven
More informationPart II. Graph Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 53 Paper 3, Section II 15H Define the Ramsey numbers R(s, t) for integers s, t 2. Show that R(s, t) exists for all s,
More informationOn the maximum number of edges in plane graph with fixed exterior face degree
On the maximum number of edges in plane graph with fixed exterior face degree arxiv:708.02024v [math.co] 7 Aug 207 Niran Abbas Ali a, Gek L. Chia b,e, Hazim Michman Trao c and Adem Kilicman d a,c,d Department
More informationCOMP331/557. Chapter 2: The Geometry of Linear Programming. (Bertsimas & Tsitsiklis, Chapter 2)
COMP331/557 Chapter 2: The Geometry of Linear Programming (Bertsimas & Tsitsiklis, Chapter 2) 49 Polyhedra and Polytopes Definition 2.1. Let A 2 R m n and b 2 R m. a set {x 2 R n A x b} is called polyhedron
More informationarxiv: v2 [math.co] 8 Oct 2012
House of Graphs: a database of interesting graphs Gunnar Brinkmann a, Kris Coolsaet a, Jan Goedgebeur a, Hadrien Mélot b arxiv:1204.3549v2 [math.co] 8 Oct 2012 Abstract a Applied Mathematics & Computer
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 informationThe Traveling Salesman Problem on Grids with Forbidden Neighborhoods
The Traveling Salesman Problem on Grids with Forbidden Neighborhoods Anja Fischer Philipp Hungerländer April 0, 06 We introduce the Traveling Salesman Problem with forbidden neighborhoods (TSPFN). This
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 informationEdge Guards for Polyhedra in Three-Space
Edge Guards for Polyhedra in Three-Space Javier Cano Csaba D. Tóth Jorge Urrutia Abstract It is shown that every polyhedron in R with m edges can be guarded with at most 27 2m The bound improves to 5 6
More informationON LOCAL STRUCTURE OF 1-PLANAR GRAPHS OF MINIMUM DEGREE 5 AND GIRTH 4
Discussiones Mathematicae Graph Theory 9 (009 ) 385 00 ON LOCAL STRUCTURE OF -PLANAR GRAPHS OF MINIMUM DEGREE 5 AND GIRTH Dávid Hudák and Tomáš Madaras Institute of Mathematics, Faculty of Sciences University
More informationChapter 14 Section 3 - Slide 1
AND Chapter 14 Section 3 - Slide 1 Chapter 14 Graph Theory Chapter 14 Section 3 - Slide WHAT YOU WILL LEARN Graphs, paths and circuits The Königsberg bridge problem Euler paths and Euler circuits Hamilton
More informationORIE 6300 Mathematical Programming I September 2, Lecture 3
ORIE 6300 Mathematical Programming I September 2, 2014 Lecturer: David P. Williamson Lecture 3 Scribe: Divya Singhvi Last time we discussed how to take dual of an LP in two different ways. Today we will
More informationLine Arrangements. Applications
Computational Geometry Chapter 9 Line Arrangements 1 Line Arrangements Applications On the Agenda 2 1 Complexity of a Line Arrangement Given a set L of n lines in the plane, their arrangement A(L) is the
More informationLecture 1: Examples, connectedness, paths and cycles
Lecture 1: Examples, connectedness, paths and cycles Anders Johansson 2011-10-22 lör Outline The course plan Examples and applications of graphs Relations The definition of graphs as relations Connectedness,
More information1 Maximum Degrees of Iterated Line Graphs
1 Maximum Degrees of Iterated Line Graphs Note. All graphs in this section are simple. Problem 1. A simple graph G is promising if and only if G is not terminal. 1.1 Lemmas Notation. We denote the line
More informationOn ɛ-unit distance graphs
On ɛ-unit distance graphs Geoffrey Exoo Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809 g-exoo@indstate.edu April 9, 003 Abstract We consider a variation on
More informationAlgorithms for Drawing Polyhedra from 3-Connected Planar Graphs
Informatica 28 (2004) 239 243 239 Algorithms for Drawing Polyhedra from 3-Connected Planar Graphs Alen Orbanić, Marko Boben, Gašper Jaklič and Tomaž Pisanski IMFM, OTR, Jadranska 19, Ljubljana, Slovenia
More informationTraveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost
Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R
More informationAssignment 1 Introduction to Graph Theory CO342
Assignment 1 Introduction to Graph Theory CO342 This assignment will be marked out of a total of thirty points, and is due on Thursday 18th May at 10am in class. Throughout the assignment, the graphs are
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 informationBasic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions
Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc
More informationGRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS
GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS DR. ANDREW SCHWARTZ, PH.D. 10.1 Graphs and Graph Models (1) A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes)
More informationDiscrete Mathematics Introduction
Discrete Mathematics Introduction Saad Mneimneh 1 Introduction College mathematics will often focus on calculus, and while it is true that calculus is the most important field that started modern mathematics,
More informationAcyclic edge-coloring of planar graphs: colors suffice when is large
Acyclic edge-coloring of planar graphs: colors suffice when is large Daniel W. Cranston May 14, 2017 Abstract An acyclic edge-coloring of a graph G is a proper edge-coloring of G such that the subgraph
More informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 15 Graphs: Planar Graphs 1 Outline What is a Planar Graph? Euler Planar Formula Platonic Solids Five Color Theorem Kuratowski s Theorem 2 What is a Planar Graph? Definition
More informationDOMINATING SETS WHOSE CLOSED STARS FORM SPANNING TREES
DOMINATING SETS WHOSE CLOSED STARS FORM SPANNING TREES Jerrold W. Grossman Department of Mathematical Sciences Oakland University Rochester, MI 48309-4401 e-mail: grossman@oakland.edu Abstract For a subset
More informationMatching Theory. Figure 1: Is this graph bipartite?
Matching Theory 1 Introduction A matching M of a graph is a subset of E such that no two edges in M share a vertex; edges which have this property are called independent edges. A matching M is said to
More informationList Colouring Squares of Planar Graphs
Electronic Notes in Discrete Mathematics 9 (007) 515 519 www.elsevier.com/locate/endm List Colouring Squares of Planar Graphs Frédéric Havet a,1, Jan van den Heuvel b,1, Colin McDiarmid c,1, and Bruce
More informationCPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60
CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost
More informationThe Art Gallery Problem
The Art Gallery Problem Connor Bohlken Nebraska Wesleyan University cbohlken@nebrwesleyan.edu May 11, 2016 Abstract Given a polygonal art gallery of n vertices, how many security guards are necessary to
More informationAssignments are handed in on Tuesdays in even weeks. Deadlines are:
Tutorials at 2 3, 3 4 and 4 5 in M413b, on Tuesdays, in odd weeks. i.e. on the following dates. Tuesday the 28th January, 11th February, 25th February, 11th March, 25th March, 6th May. Assignments are
More informationA THREE AND FIVE COLOR THEOREM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 52, October 1975 A THREE AND FIVE COLOR THEOREM FRANK R. BERNHART1 ABSTRACT. Let / be a face of a plane graph G. The Three and Five Color Theorem
More informationIntroductory Combinatorics
Introductory Combinatorics Third Edition KENNETH P. BOGART Dartmouth College,. " A Harcourt Science and Technology Company San Diego San Francisco New York Boston London Toronto Sydney Tokyo xm CONTENTS
More informationOn Exploring Temporal Graphs of Small Pathwidth
On Exploring Temporal Graphs of Small Pathwidth Hans L. Bodlaender Tom C. van der Zanden arxiv:1807.11869v1 [cs.ds] 31 Jul 2018 Abstract We show that the Temporal Graph Exploration Problem is NP-complete,
More informationElements of Graph Theory
Elements of Graph Theory Quick review of Chapters 9.1 9.5, 9.7 (studied in Mt1348/2008) = all basic concepts must be known New topics we will mostly skip shortest paths (Chapter 9.6), as that was covered
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 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 simple algorithm for 4-coloring 3-colorable planar graphs
A simple algorithm for 4-coloring 3-colorable planar graphs Ken-ichi Kawarabayashi 1 National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan Kenta Ozeki 2 Department of
More informationAn Eberhard-like theorem for pentagons and heptagons
An Eberhard-like theorem for pentagons and heptagons Robert Šámal joint work with M. DeVos, A. Georgakopoulos, B. Mohar Charles University, Prague Simon Fraser University, Burnaby CanaDAM May 26, 2009
More informationComputational Combinatorics
Computational Combinatorics Derrick Stolee Iowa State University dstolee@iastate.edu http://www.math.iastate.edu/dstolee/ November 3 & 5, 2014 Math 101 Graphs Combinatorial Object: Graphs A graph G of
More informationCS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS QUESTION BANK 1. Define Graph. 2. Define Simple graph. 3. Write few problems
More informationSpanning trees and orientations of graphs
Journal of Combinatorics Volume 1, Number 2, 101 111, 2010 Spanning trees and orientations of graphs Carsten Thomassen A conjecture of Merino and Welsh says that the number of spanning trees τ(g) of a
More informationEuler s Formula. Math 123. March 2006
Euler s Formula Math 123 March 2006 1 Purpose Although Euler s Formula is relatively simple to memorize, it is actually a manifestation of a very deep mathematical phenomenon. In this activity, we will
More informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems Convex polyhedra Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October 2017 Ábrahám
More informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems 6. Convex polyhedra Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October 2017 Ábrahám
More informationOne simple example is that of a cube. Each face is a square (=regular quadrilateral) and each vertex is connected to exactly three squares.
Berkeley Math Circle Intermediate I, 1/23, 1/20, 2/6 Presenter: Elysée Wilson-Egolf Topic: Polygons, Polyhedra, Polytope Series Part 1 Polygon Angle Formula Let s start simple. How do we find the sum of
More informationSimple Graph. General Graph
Graph Theory A graph is a collection of points (also called vertices) and lines (also called edges), with each edge ending at a vertex In general, it is allowed for more than one edge to have the same
More informationSome Open Problems in Graph T
Some Open Problems in Graph T February 11, 2004 0-0 Sources Graph Theory Open Problems - Six problems suitable f uate research projects http://dimacs.rutgers.edu/ hochberg/undopen/graphth Douglas West
More informationQuestion. Why is the third shape not convex?
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationApproximation Algorithms
15-251: Great Ideas in Theoretical Computer Science Spring 2019, Lecture 14 March 5, 2019 Approximation Algorithms 1 2 SAT 3SAT Clique Hamiltonian- Cycle given a Boolean formula F, is it satisfiable? same,
More informationPrism-hamiltonicity of triangulations
Prism-hamiltonicity of triangulations Daniel P. Biebighauser and M. N. Ellingham September 23, 2005 Abstract The prism over a graph G is the Cartesian product G K 2 of G with the complete graph K 2. If
More informationTopics on Computing and Mathematical Sciences I Graph Theory (3) Trees and Matchings I
Topics on Computing and Mathematical Sciences I Graph Theory (3) Trees and Matchings I Yoshio Okamoto Tokyo Institute of Technology April 23, 2008 Y. Okamoto (Tokyo Tech) TCMSI Graph Theory (3) 2008-04-23
More informationA Study of the Rigidity of Regular Polytopes
A Study of the Rigidity of Regular Polytopes A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University By Helene
More informationNANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION MH 1301 DISCRETE MATHEMATICS TIME ALLOWED: 2 HOURS
NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION 2015-2016 MH 1301 DISCRETE MATHEMATICS May 2016 TIME ALLOWED: 2 HOURS INSTRUCTIONS TO CANDIDATES 1. This examination paper contains FIVE (5) questions
More informationOverview 1 Drawings and the Crossing Number 3 Basic definitions, overview of computational complexity. 2 Edge-insertion Heuristic 5 Heuristic crossing
On the Crossing Number of Almost Planar Graphs Petr Hliněný Faculty of Informatics, Masaryk University Botanická 68a, 602 00 Brno, Czech Rep. e-mail: hlineny@fi.muni.cz http://www.fi.muni.cz/~hlineny joint
More informationTHE FOUR-COLOR THEOREM. Joshua D. Chesler
THE FOUR-COLOR THEOREM by Joshua D. Chesler A Thesis Submitted to the Faculty of the DEPARTMENT OF MATHEMATICS In Partial Fulfillment of the Requirements For the Degree of MASTER OF SCIENCE In the Graduate
More informationGuts of surfaces and colored Jones knot polynomials
Guts of surfaces and colored Jones knot polynomials David Futer, Efstratia Kalfagianni, and Jessica S. Purcell Knots in Poland III: Conference on Knot Theory and its Ramifications, Stefan Banach International
More informationUndirected Network Summary
Undirected Network Summary Notice that the network above has multiple edges joining nodes a to d and the network has a loop at node d. Also c is called an isolated node as it is not connected to any other
More information