DOCSLIB.ORG

Graph Minors and Hadwiger's Conjecture

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Graph Minors and Hadwiger's Conjecture GRAPH MINORS AND HADWIGER’S CONJECTURE DISSERTATION Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of The Ohio State University By Eliade Mihai Micu, M.S. The Ohio State University 2005 Dissertation Committee: Approved by Professor Neil Robertson, Adviser Professor Thomas Dowling Adviser Professor Dijen Ray-Chaudhuri Graduate Program in Mathematics ABSTRACT One of the central open problems in Graph Theory is Hadwiger’s Con- jecture, which states that any graph with no Kk+1-minor is k-colorable. Re- stated, the conjecture asserts that the clique-minor number is always an upper bound for the chromatic number. In this paper we study various connections between these invariants. We start by providing the definitions and basic results needed later on, together with a new result about coloring ”almost all” the vertices of a graph. In the second chapter, we focus on graphs with stability number equal to two, proving that if such a graph does not contain an induced C4 or an induced C5, it satisfies Hadwiger’s Conjecture. The next chapter is dedicated to proving a result which is implied by the conjecture, i.e. an inequality linking the clique-minor numbers of a graph and its complement. We conclude the paper with a result about the embedding of any finite graph in Euclidean 3-space such that all its edges are straight line segments of integer length. ii In the memory of my mother iii ACKNOWLEDGMENTS Any writing is the product not only of its authors, but also of the envi- ronment where the authors work, of the encouragements and critics gathered from colleagues and teachers and conversations after seminars and confer- ences. While I cannot do justice to all of the above, I thank explicitly my adviser Dr. Neil Robertson for his encouragement, intellectual support and guidance throughout the years. He introduced me to the field of Graph Theory and suggested many deep and stimulating problems. I also want to thank Yung-Chen Lu for bringing me to The Ohio State University and helping me to get started in Graduate School. My perception of Combinatorics and Mathematics in general has devel- oped under the influence of many people. Especially, I am pleased to mention Thomas Dowling, Dijen Ray-Chaudhuri, Neil Falkner and John Hsia. Finally, my ultimate gratitude goes towards my wife, whose tremendous love, help and support made this work possible. iv VITA January 29, 1975 . Born - Constanta, Romania 1997 ...................... B.S. Mathematics, University of Bucharest 1999 ...................... M.S. Mathematics, University of Bucharest 2000 - present . Graduate Teaching Assistant, The Ohio State University FIELDS OF STUDY Major Field: Mathematics v TABLE OF CONTENTS ABSTRACT ................................. ii DEDICATION ................................ iii ACKNOWLEDGMENTS ........................ iv VITA ...................................... v LIST OF FIGURES ............................ viii 1 INTRODUCTION ........................... 1 1.1 BasicConcepts .......................... 1 1.2 GraphColorings.......................... 8 1.3 Graph Minors and Hadwiger’s Conjecture . 14 1.4 Large Clique Minors and Connections with Other Invariants . 17 1.5 UpperBoundsfortheChromaticNumber . 25 vi 2 HADWIGER’S CONJECTURE FOR GRAPHS WITH STA- BILITY NUMBER 2 ......................... 28 2.1 Preliminaries ........................... 28 2.2 Lower Bounds for the α =2Case ................ 31 2.3 Graphs with Low Connectivity . 34 2.4 ExcludingCertainSubgraphs . 36 2.5 GraphswithHighEdgeDensity . 43 3 GRAPH COMPLEMENTS ..................... 53 3.1 Preliminaries ........................... 53 3.2 Clique Minors in Graph Complements . 59 3.3 Complements of C4-freeGraphs ................. 61 3.4 Excluding Clique Minors in the Complement . 62 4 GRAPHS WITH EDGES OF INTEGER LENGTH .... 65 4.1 Preliminaries ........................... 66 4.2 TheMainResult ......................... 71 5 CONCLUSION AND FURTHER RESEARCH ....... 77 BIBLIOGRAPHY ............................. 80 vii LIST OF FIGURES 1.1 ConstructingaUniversalSubgraph. 22 2.1 The C4-freeCase.......................... 41 3.1 The values of f and F for n 5. ................ 57 ≤ 4.1 Embedding Kn into3-Space.. 75 viii CHAPTER 1 INTRODUCTION 1.1 Basic Concepts We begin this chapter by introducing the main concepts and by stating some of the classical Graph Theory results which will be used later. We denote by N the set of natural numbers, including zero, and by N∗ the set of all positive integers. For a real number x, the greatest integer less than or equal to x is denoted by x , and the least integer greater than or ⌊ ⌋ equal to x by x . ⌈ ⌉ For any set S and positive integer k, a family = S ,S , ,Sk of S { 1 2 ··· } k disjoint subsets of S is called a partition of S if S = i=1 Si. The sets S ,S , ,Sk are called the classes of the partition. WeS denote by k(S) 1 2 ··· P the set of all the subsets of S of cardinality k. 1 Definition 1.1.1 A graph is a triple G = (V,E,I), where V and E are disjoint sets and I is a mapping I : E (E) (E). →P1 ∪P2 The elements of V are called the vertices of the graph, the elements of E are called the edges of the graph. An edge e E is said to be a loop if ∈ I(e) (E); two distinct edges e,e′ E are called parallel if I(e)= I(e′). ∈P1 ∈ A graph is called finite if V is a finite set, it is called null if V and E are empty, and it is called simple if I is an injective mapping and its image is a subset of (V ). Unless otherwise stated, all the graphs considered in P2 this paper will be assumed to be non-null, finite and simple. For a simple graph G, we can view its edge set as a subset of (V ). In this case, we write P2 G =(V,E). A vertex v is said to be incident with an edge e if v I(e). For simple ∈ graphs we write e = uv if I(e) = u, v . The two vertices incident with { } an edge are called its endpoints. Two vertices u and v are adjacent or neighbors if uv E; two distinct edges are adjacent if they have a common ∈ endpoint. Let G =(V,E) and G′ =(V ′,E′) be two graphs. We say that G and G′ are isomorphic, and we write G G′, if there exists a bijection ϕ : V V ′ ≃ → such that xy E if and only if ϕ(x)ϕ(y) E′. Such a mapping ϕ is called ∈ ∈ an isomorphism. We set G G” := (V V ′,E E′) and G G” := (V V ′,E E′). If ∪ ∪ ∪ ∩ ∩ ∩ G G′ is the null graph, we say that G and G′ are disjoint. If two graphs ∩ H and K are disjoint, the graph G = H K is called the disjoint union of ∪ H and K. 2 If V ′ V and E′ E, we say that G′ is a subgraph of G and we write ⊆ ⊆ G′ G. If G′ contains all the edges uv E with u, v V ′, we say that G′ ⊆ ∈ ∈ is an induced subgraph of G. Definition 1.1.2 An independent (or stable) set is a set of pairwise non- adjacent vertices of the graph G. The size of the largest such set is called the independence (or stability) number of the graph and is denoted by α(G). Definition 1.1.3 A clique in a graph G is a set of pairwise adjacent ver- tices. If V (G) is a clique, the graph G is called complete. The size of the largest clique contained in a graph is called its clique number and is denoted by ω(G). For a vertex v V (G), its neighborhood in G, denoted by NG(v), is ∈ the set of all the vertices adjacent to v. If the reference is clear, we may drop the index referring to the underlying graph. More generally, for a set of vertices S V (G), the set of neighbors in V (G) S of vertices in S is called ⊆ \ the neighborhood of S and is denoted by NG(S). The degree dG(v) of a vertex v V (G) is the number of edges incident ∈ with v; for simple graphs, it is also the cardinality of NG(v). The minimum degree of G, denoted by δ(G), is defined to be δ(G) := min dG(v) : v V (G) . { ∈ } Similarly, the number ∆(G) := max dG(v) : v V (G) is called the maxi- { ∈ } mum degree of the graph G. 3 Definition 1.1.4 The average degree of a graph G is given by: 1 d(G) := d (v). V (G) G ∈ | | v XV (G) Remark 1.1.5 Clearly δ(G) d(G) ∆(G). ≤ ≤ Definition 1.1.6 A path is a graph P =(V,E) of the form: V = v ,v , ,vk and E = v v ,v v , ,vk− vk , { 0 1 ··· } { 0 1 1 2 ··· 1 } where the vi’s are all distinct. The path P defined above is denoted by P = v v vk. The vertices v 0 1 ··· 0 and vk are called the ends of the path P . The number of edges in a path is its length and a path of length k is denoted by Pk. If P = v v vk− is a path with k 3, then the graph C = P vk− v 0 1 ··· 1 ≥ ∪ 1 0 is called a cycle and we also write C = v v vk− . The length of the 0 1 ··· 1 cycle is the number of its edges; a cycle of length k is denoted by Ck. An edge not contained in a cycle, but joining two vertices of the cycle is called a chord. A cycle with no chords is called induced. Definition 1.1.7 A non-empty graph G is called connected if any two of its vertices can be joined by a path.
Load more

Recommended publications
  • On Treewidth and Graph Minors
    On Treewidth and Graph Minors Daniel John Harvey Submitted in total fulfilment of the requirements of the degree of Doctor of Philosophy February 2014 Department of Mathematics and Statistics The University of Melbourne Produced on archival quality paper ii Abstract Both treewidth and the Hadwiger number are key graph parameters in structural and al- gorithmic graph theory, especially in the theory of graph minors. For example, treewidth demarcates the two major cases of the Robertson and Seymour proof of Wagner's Con- jecture. Also, the Hadwiger number is the key measure of the structural complexity of a graph. In this thesis, we shall investigate these parameters on some interesting classes of graphs. The treewidth of a graph defines, in some sense, how \tree-like" the graph is. Treewidth is a key parameter in the algorithmic field of fixed-parameter tractability. In particular, on classes of bounded treewidth, certain NP-Hard problems can be solved in polynomial time. In structural graph theory, treewidth is of key interest due to its part in the stronger form of Robertson and Seymour's Graph Minor Structure Theorem. A key fact is that the treewidth of a graph is tied to the size of its largest grid minor. In fact, treewidth is tied to a large number of other graph structural parameters, which this thesis thoroughly investigates. In doing so, some of the tying functions between these results are improved. This thesis also determines exactly the treewidth of the line graph of a complete graph. This is a critical example in a recent paper of Marx, and improves on a recent result by Grohe and Marx.
    [Show full text]
  • Additive Non-Approximability of Chromatic Number in Proper Minor
    Additive non-approximability of chromatic number in proper minor-closed classes Zdenˇek Dvoˇr´ak∗ Ken-ichi Kawarabayashi† Abstract Robin Thomas asked whether for every proper minor-closed class , there exists a polynomial-time algorithm approximating the chro- G matic number of graphs from up to a constant additive error inde- G pendent on the class . We show this is not the case: unless P = NP, G for every integer k 1, there is no polynomial-time algorithm to color ≥ a K -minor-free graph G using at most χ(G)+ k 1 colors. More 4k+1 − generally, for every k 1 and 1 β 4/3, there is no polynomial- ≥ ≤ ≤ time algorithm to color a K4k+1-minor-free graph G using less than βχ(G)+(4 3β)k colors. As far as we know, this is the first non-trivial − non-approximability result regarding the chromatic number in proper minor-closed classes. We also give somewhat weaker non-approximability bound for K4k+1- minor-free graphs with no cliques of size 4. On the positive side, we present additive approximation algorithm whose error depends on the apex number of the forbidden minor, and an algorithm with addi- tive error 6 under the additional assumption that the graph has no 4-cycles. arXiv:1707.03888v1 [cs.DM] 12 Jul 2017 The problem of determining the chromatic number, or even of just de- ciding whether a graph is colorable using a fixed number c 3 of colors, is NP-complete [7], and thus it cannot be solved in polynomial≥ time un- less P = NP.
    [Show full text]
  • An Update on the Four-Color Theorem Robin Thomas
    thomas.qxp 6/11/98 4:10 PM Page 848 An Update on the Four-Color Theorem Robin Thomas very planar map of connected countries the five-color theorem (Theorem 2 below) and can be colored using four colors in such discovered what became known as Kempe chains, a way that countries with a common and Tait found an equivalent formulation of the boundary segment (not just a point) re- Four-Color Theorem in terms of edge 3-coloring, ceive different colors. It is amazing that stated here as Theorem 3. Esuch a simply stated result resisted proof for one The next major contribution came in 1913 from and a quarter centuries, and even today it is not G. D. Birkhoff, whose work allowed Franklin to yet fully understood. In this article I concentrate prove in 1922 that the four-color conjecture is on recent developments: equivalent formulations, true for maps with at most twenty-five regions. The a new proof, and progress on some generalizations. same method was used by other mathematicians to make progress on the four-color problem. Im- Brief History portant here is the work by Heesch, who developed The Four-Color Problem dates back to 1852 when the two main ingredients needed for the ultimate Francis Guthrie, while trying to color the map of proof—“reducibility” and “discharging”. While the the counties of England, noticed that four colors concept of reducibility was studied by other re- sufficed. He asked his brother Frederick if it was searchers as well, the idea of discharging, crucial true that any map can be colored using four col- for the unavoidability part of the proof, is due to ors in such a way that adjacent regions (i.e., those Heesch, and he also conjectured that a suitable de- sharing a common boundary segment, not just a velopment of this method would solve the Four- point) receive different colors.
    [Show full text]
  • Average Degree Conditions Forcing a Minor∗
    Average degree conditions forcing a minor∗ Daniel J. Harvey David R. Wood School of Mathematical Sciences Monash University Melbourne, Australia [email protected], [email protected] Submitted: Jun 11, 2015; Accepted: Feb 22, 2016; Published: Mar 4, 2016 Mathematics Subject Classifications: 05C83 Abstract Mader first proved that high average degree forces a given graph as a minor. Often motivated by Hadwiger's Conjecture, much research has focused on the av- erage degree required to force a complete graph as a minor. Subsequently, various authors have considered the average degree required to force an arbitrary graph H as a minor. Here, we strengthen (under certain conditions) a recent result by Reed and Wood, giving better bounds on the average degree required to force an H-minor when H is a sparse graph with many high degree vertices. This solves an open problem of Reed and Wood, and also generalises (to within a constant factor) known results when H is an unbalanced complete bipartite graph. 1 Introduction Mader [13, 14] first proved that high average degree forces a given graph as a minor1. In particular, Mader [13, 14] proved that the following function is well-defined, where d(G) denotes the average degree of a graph G: f(H) := inffD 2 R : every graph G with d(G) > D contains an H-minorg: Often motivated by Hadwiger's Conjecture (see [18]), much research has focused on f(Kt) where Kt is the complete graph on t vertices. For 3 6 t 6 9, exact bounds on the number of edges due to Mader [14], Jørgensen [6], and Song and Thomas [19] implyp that f(Kt) = 2t−4.
    [Show full text]
  • Mathematical Concepts Within the Artwork of Lewitt and Escher
    A Thesis Presented to The Faculty of Alfred University More than Visual: Mathematical Concepts Within the Artwork of LeWitt and Escher by Kelsey Bennett In Partial Fulfillment of the requirements for the Alfred University Honors Program May 9, 2019 Under the Supervision of: Chair: Dr. Amanda Taylor Committee Members: Barbara Lattanzi John Hosford 1 Abstract The goal of this thesis is to demonstrate the relationship between mathematics and art. To do so, I have explored the work of two artists, M.C. Escher and Sol LeWitt. Though these artists approached the role of mathematics in their art in different ways, I have observed that each has employed mathematical concepts in order to create their rule-based artworks. The mathematical ideas which serve as the backbone of this thesis are illustrated by the artists' works and strengthen the bond be- tween the two subjects of art and math. My intention is to make these concepts accessible to all readers, regardless of their mathematical or artis- tic background, so that they may in turn gain a deeper understanding of the relationship between mathematics and art. To do so, we begin with a philosophical discussion of art and mathematics. Next, we will dissect and analyze various pieces of work by Sol LeWitt and M.C. Escher. As part of that process, we will also redesign or re-imagine some artistic pieces to further highlight mathematical concepts at play within the work of these artists. 1 Introduction What is art? The Merriam-Webster dictionary provides one definition of art as being \the conscious use of skill and creative imagination especially in the production of aesthetic object" ([1]).
    [Show full text]
  • The Hadwiger Number, Chordal Graphs and Ab-Perfection Arxiv
    The Hadwiger number, chordal graphs and ab-perfection∗ Christian Rubio-Montiel [email protected] Instituto de Matem´aticas, Universidad Nacional Aut´onomade M´exico, 04510, Mexico City, Mexico Department of Algebra, Comenius University, 84248, Bratislava, Slovakia October 2, 2018 Abstract A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs such that for each induced subgraph H, (1) the Hadwiger number of H is equal to the maximum clique order of H, (2) the Hadwiger number of H is equal to the achromatic number of H, (3) the b-chromatic number is equal to the pseudoachromatic number, (4) the pseudo-b-chromatic number is equal to the pseudoachromatic number, (5) the arXiv:1701.08417v1 [math.CO] 29 Jan 2017 Hadwiger number of H is equal to the Grundy number of H, and (6) the b-chromatic number is equal to the pseudo-Grundy number. Keywords: Complete colorings, perfect graphs, forbidden graphs characterization. 2010 Mathematics Subject Classification: 05C17; 05C15; 05C83. ∗Research partially supported by CONACyT-Mexico, Grants 178395, 166306; PAPIIT-Mexico, Grant IN104915; a Postdoctoral fellowship of CONACyT-Mexico; and the National scholarship programme of the Slovak republic. 1 1 Introduction Let G be a finite graph. A k-coloring of G is a surjective function & that assigns a number from the set [k] := 1; : : : ; k to each vertex of G.A k-coloring & of G is called proper if any two adjacent verticesf haveg different colors, and & is called complete if for each pair of different colors i; j [k] there exists an edge xy E(G) such that x &−1(i) and y &−1(j).
    [Show full text]
  • The 150 Year Journey of the Four Color Theorem
    The 150 Year Journey of the Four Color Theorem A Senior Thesis in Mathematics by Ruth Davidson Advised by Sara Billey University of Washington, Seattle Figure 1: Coloring a Planar Graph; A Dual Superimposed I. Introduction The Four Color Theorem (4CT) was stated as a conjecture by Francis Guthrie in 1852, who was then a student of Augustus De Morgan [3]. Originally the question was posed in terms of coloring the regions of a map: the conjecture stated that if a map was divided into regions, then four colors were sufficient to color all the regions of the map such that no two regions that shared a boundary were given the same color. For example, in Figure 1, the adjacent regions of the shape are colored in different shades of gray. The search for a proof of the 4CT was a primary driving force in the development of a branch of mathematics we now know as graph theory. Not until 1977 was a correct proof of the Four Color Theorem (4CT) published by Kenneth Appel and Wolfgang Haken [1]. Moreover, this proof was made possible by the incremental efforts of many mathematicians that built on the work of those who came before. This paper presents an overview of the history of the search for this proof, and examines in detail another beautiful proof of the 4CT published in 1997 by Neil Robertson, Daniel 1 Figure 2: The Planar Graph K4 Sanders, Paul Seymour, and Robin Thomas [18] that refined the techniques used in the original proof. In order to understand the form in which the 4CT was finally proved, it is necessary to under- stand proper vertex colorings of a graph and the idea of a planar graph.
    [Show full text]
  • Some Remarks on Even-Hole-Free Graphs
    Some remarks on even-hole-free graphs Zi-Xia Song∗ Department of Mathematics, University of Central Florida, Orlando, FL 32816, USA Abstract A vertex of a graph is bisimplicial if the set of its neighbors is the union of two cliques; a graph is quasi-line if every vertex is bisimplicial. A recent result of Chudnovsky and Seymour asserts that every non-empty even-hole-free graph has a bisimplicial vertex. Both Hadwiger’s conjecture and the Erd˝os-Lov´asz Tihany conjecture have been shown to be true for quasi-line graphs, but are open for even-hole-free graphs. In this note, we prove that for all k ≥ 7, every even-hole-free graph with no Kk minor is (2k − 5)-colorable; every even-hole-free graph G with ω(G) < χ(G) = s + t − 1 satisfies the Erd˝os-Lov´asz Tihany conjecture provided that t ≥ s>χ(G)/3. Furthermore, we prove that every 9-chromatic graph G with ω(G) ≤ 8 has a K4 ∪ K6 minor. Our proofs rely heavily on the structural result of Chudnovsky and Seymour on even-hole-free graphs. 1 Introduction All graphs in this paper are finite and simple. For a graph G, we use V (G) to denote the vertex set, E(G) the edge set, |G| the number of vertices, e(G) the number of edges, δ(G) the minimum degree, ∆(G) the maximum degree, α(G) the independence number, ω(G) the clique number and χ(G) the chromatic number. A graph H is a minor of a graph G if H can be obtained from a subgraph of G by contracting edges.
    [Show full text]
  • The Four Color Theorem
    Western Washington University Western CEDAR WWU Honors Program Senior Projects WWU Graduate and Undergraduate Scholarship Spring 2012 The Four Color Theorem Patrick Turner Western Washington University Follow this and additional works at: https://cedar.wwu.edu/wwu_honors Part of the Computer Sciences Commons, and the Mathematics Commons Recommended Citation Turner, Patrick, "The Four Color Theorem" (2012). WWU Honors Program Senior Projects. 299. https://cedar.wwu.edu/wwu_honors/299 This Project is brought to you for free and open access by the WWU Graduate and Undergraduate Scholarship at Western CEDAR. It has been accepted for inclusion in WWU Honors Program Senior Projects by an authorized administrator of Western CEDAR. For more information, please contact [email protected]. Western WASHINGTON UNIVERSITY ^ Honors Program HONORS THESIS In presenting this Honors paper in partial requirements for a bachelor’s degree at Western Washington University, I agree that the Library shall make its copies freely available for inspection. I further agree that extensive copying of this thesis is allowable only for scholarly purposes. It is understood that anv publication of this thesis for commercial purposes or for financial gain shall not be allowed without mv written permission. Signature Active Minds Changing Lives Senior Project Patrick Turner The Four Color Theorem The history of mathematics is pervaded by problems which can be stated simply, but are difficult and in some cases impossible to prove. The pursuit of solutions to these problems has been an important catalyst in mathematics, aiding the development of many disparate fields. While Fermat’s Last theorem, which states x ” + y ” = has no integer solutions for n > 2 and x, y, 2 ^ is perhaps the most famous of these problems, the Four Color Theorem proved a challenge to some of the greatest mathematical minds from its conception 1852 until its eventual proof in 1976.
    [Show full text]
  • Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
    Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs Erik D. Demaine∗ MohammadTaghi Hajiaghayiy Ken-ichi Kawarabayashiz Abstract between the pieces. For example, many optimization prob- We prove two structural decomposition theorems about graphs ex- lems can be solved exactly on graphs of bounded treewidth; cluding a fixed odd minor H, and show how these theorems can what graphs can be partitioned into a small number k of be used to obtain approximation algorithms for several algorithmic bounded-treewidth pieces? In many cases, each piece gives problems in such graphs. Our decomposition results provide new a lower/upper bound on the optimal solution for the entire structural insights into odd-H-minor-free graphs, on the one hand graph, so solving the problem exactly in each piece gives a generalizing the central structural result from Graph Minor The- k-approximation to the problem. Such a decomposition into ory, and on the other hand providing an algorithmic decomposition bounded-treewidth graphs would also be practical, as many into two bounded-treewidth graphs, generalizing a similar result for NP-hard optimization problems are now solved in practice minors. As one example of how these structural results conquer dif- using dynamic programming on low-treewidth graphs; see, ficult problems, we obtain a polynomial-time 2-approximation for e.g., [Bod05, Ami01, Tho98]. Recently, this decomposi- vertex coloring in odd-H-minor-free graphs, improving on the pre- tion approach has been successfully used for graph coloring, 1−" vious O(jV (H)j)-approximation for such graphs and generalizing which is inapproximable within n for any " > 0 unless the previous 2-approximation for H-minor-free graphs.
    [Show full text]
  • Quantum Interpretations of the Four Color Theorem ∗
    Quantum interpretations of the four color theorem ¤ Paul C. Kainen Dept. of Mathematics Georgetown University Washington, D.C. 20057 Abstract Some connections between quantum computing and quantum algebra are described, and the Four Color Theorem (4CT) is interpreted within both contexts. keywords: Temperley-Lieb algebra, Jones-Wenzl idempotents, Bose-Einstein condensate, analog computation, R-matrix 1 Introduction Since their discovery, the implications of quantum phenomena have been considered by computer scientists, physicists, biologists and mathematicians. We are here proposing a synthesis of several of these threads, in the context of the well-known mathematical problem of four-coloring planar maps. \Quantum computing" now refers to all those proposed theories, algorithms and tech- niques for exploiting the unique nature of quantum events to obtain computational ad- vantages. While it is not yet practically feasible and may, to quote Y. Manin, be only \mathematical wishful thinking" [30], quantum computing is taken seriously by a number of academic and corporate research groups. Whether or not quantum techniques will turn out to be implementable for computing and communications, their study throws new light on the nature of computation and information. Meanwhile, within mathematics and physics, work continues in the area known as "quan- tum algebra" (or sometimes \quantum geometry") in which a variety of esoteric mathemat- ical structures are interwoven with physical models like quantum ¯eld theories, algebras of operators on Hilbert space and so on. This variety of algebraic and topological structure is a consequences of the fact that any su±ciently precise logical model, which is physically veridical, will necessarily be non-commutative.
    [Show full text]
  • COLORING GRAPHS USING TOPOLOGY 11 Realized by Tutte Who Called an Example of a Disc G for Which the Boundary Has Chromatic Number 4 a Chromatic Obstacle
    COLORING GRAPHS USING TOPOLOGY OLIVER KNILL Abstract. Higher dimensional graphs can be used to color 2- dimensional geometric graphs G. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colorable with 4 colors. The later goal is achieved if all inte- rior edge degrees are even. Using a refinement process which cuts the interior along surfaces S we can adapt the degrees along the boundary S. More efficient is a self-cobordism of G with itself with a host graph discretizing the product of G with an interval. It fol- lows from the fact that Euler curvature is zero everywhere for three dimensional geometric graphs, that the odd degree edge set O is a cycle and so a boundary if H is simply connected. A reduction to minimal coloring would imply the four color theorem. The method is expected to give a reason \why 4 colors suffice” and suggests that every two dimensional geometric graph of arbitrary degree and ori- entation can be colored by 5 colors: since the projective plane can not be a boundary of a 3-dimensional graph and because for higher genus surfaces, the interior H is not simply connected, we need in general to embed a surface into a 4-dimensional simply connected graph in order to color it. This explains the appearance of the chromatic number 5 for higher degree or non-orientable situations, a number we believe to be the upper limit. For every surface type, we construct examples with chromatic number 3; 4 or 5, where the construction of surfaces with chromatic number 5 is based on a method of Fisk.
    [Show full text]