Linfan Mao Smarandache Multi-Space Theory

Total Page:16

File Type:pdf, Size:1020Kb

Linfan Mao Smarandache Multi-Space Theory LINFAN MAO SMARANDACHE MULTI-SPACE THEORY (Partially post-doctoral research for the Chinese Academy of Sciences) HEXIS Phoenix, AZ 2006 Linfan MAO Academy of Mathematics and Systems Chinese Academy of Sciences Beijing 100080, P.R.China [email protected] SMARANDACHE MULTI-SPACE THEORY HEXIS Phoenix, AZ 2006 This book can be ordered in a paper bound reprint from: Books on Demand ProQuest Information & Learning (University of Microfilm International) 300 N.Zeeb Road P.O.Box 1346, Ann Arbor MI 48106-1346, USA Tel:1-800-521-0600(Customer Service) http://wwwlib.umi.com/bod Peer Reviewers: Y.P.Liu, Department of Applied Mathematics, Beijing Jiaotong University, Beijing 100044, P.R.China. F.Tian, Academy of Mathematics and Systems, Chinese Academy of Sciences, Bei- jing 100080, P.R.China. J.Y.Yan, Graduate Student College, Chinese Academy of Sciences, Beijing 100083, P.R.China. E.L.Wei, Information school, China Renmin University, Beijing 100872, P.R.China. Copyright 2006 by Hexis and Linfan Mao Phoenix United States Many books can be downloaded from the following Digital Library of Science: http://www.gallup.unm.edu/˜ smarandache/eBooks-otherformats.htm ISBN: 1-931233-14-4 Standard Address Number: 297-5092 Printed in the United States of America Preface A Smarandache multi-space is a union of n different spaces equipped with some different structures for an integer n 2, which can be used both for discrete or ≥ connected spaces, particularly for geometries and spacetimes in theoretical physics. We are used to the idea that our space has three dimensions: length, breadth and height; with time providing the fourth dimension of spacetime by Einstein. In the string or superstring theories, we encounter 10 dimensions. However, we do not even know what the right degree of freedom is, as Witten said. In 21th century, the- oretical physicists believe the 11-dimensional M-theory is the best candidate for the Theory of Everything, i.e., a fundamental united theory of all physical phenomena, but the bottleneck is that 21st century mathematics has not yet been discovered. Today, we think the Smarandache multi-space theory is the best candidate for 21st century mathematics and a new revolution for mathematics has come. Although it is important, only a few books can be found in the libraries research about these spaces and their relations with classical mathematics and theoretical physics. The purpose of this book is to survey this theory, also to establish its relation with physics and cosmology. Many results and materials included in this book are now inspired by the Smarandache’s notion. Now we outline the content of this book. Three parts are included in this book altogether. Part one consists of Chapters 1 and 2 except the Section 1.4, may be called Algebraic multi-spaces. In Chapter 1, we introduce various algebraic Smarandache multi-spaces including those such as multi-groups, multi-rings, multi-vector spaces, multi-metric spaces, multi-operation systems and multi-manifolds and get some el- ementary results on these multi-spaces. ii Linfan Mao: Smarandache Multi-Spaces Theory Chapter 2 concentrates on multi-spaces on graphs. In an algebraic view, each multi-space is a directed graph and each graph is also a multi-space. Many new conceptions are introduced in this chapter, such as multi-voltage graphs, graphs in an n-manifold, multi-embeddings in an n-manifold, Cayley graphs of a multi-group and many results in graph theory, combinatorial map theory are generalized. These new conceptions and results enlarge the research fields of combinatorics. A graph phase is introduced and discussed in Section 2.5, which is a generalization of a particle and can be used to construct a model of p-branes in Chapter 6. The second part of this book consists of Chapters 3-5 including the Section 1.4 concentrates on these multi-metric spaces, particularly, these Smarandache ge- ometries. In fact, nearly all geometries, such as Finsler geometry, Riemann geom- etry, Euclid geometry and Lobachevshy-Bolyai-Gauss geometry are particular case of Smarandache geometries. In Chapter 3, we introduce a new kind geometry, i.e., map geometries, which is a generalization of Iseri’s s-manifolds. By applying map geometries with or without boundary, paradoxist geometries, non-geometries, counter-projective geometries and anti-geometries are constructed. The enumeration of map geometries with or without boundary underlying a graph are also gotten in this chapter. Chapter 4 is on planar map geometries. Those fundamental elements such as points, lines, polygons, circles and line bundles are discussed. Since we can investi- gate planar map geometries by means of Euclid plane geometry, some conceptions for general map geometries are extend, which enables us to get some interesting results. Those measures such as angles, curvatures, areas are also discussed. Chapter 5 is a generalization of these planar map geometries. We introduce the conception of pseudo-planes, which can be seen as the limitation case of planar map geometries when the diameter of each face tends to zero but more general than planar map geometries. On a pseudo-plane geometry, a straight line does not always exist again. These pseudo-plane geometries also relate with differential equations and plane integral curves. Conditions for existing singular points of differential equations are gotten. In Section 5.4, we define a kind of even more general spaces called metric pseudo-spaces or bounded metric pseudo-spaces. Applying these bounded or unbounded metric pseudo-spaces, bounded pseudo-plane geometries, pseudo-surface geometries, pseudo-space geometries and pseudo-manifold geometries are defined. Preface iii By choice different smooth function ω, such as ω = a Finsler or a Riemann norm, we immediately get the Finsler geometry or Riemann geometry. For the further research of interested readers, each of the final sections of Chap- ters 1 5 contains a number of open problems and conjectures which can be seen − as additional materials. Part three only consists of Chapter 6 which is concentrated on applications of multi-spaces to theoretical physics. The view that every observation of human beings for cosmos is only a pseudo-face of our space is discussed in the first section by a mathematical manner. A brief introduction to Einstein’s relative theory and M-theory is in Section 6.2 and 6.3.1. By a view of multi-spaces, models for p-branes and cosmos are constructed in Section 6.3. It is very interesting that the multi- space model of cosmos contains the shelf structure as a special case. The later is a fundamental structure in the modern algebraic geometry in recent years. This book is began to write in the July, 2005 when I finished my post-doctor report: On automorphisms of maps, surfaces and Smarandache geometries for the Chinese Academy of Sciences. Many colleagues and friends of mine have given me enthusiastic support and endless helps in preparing this book. Without their help, this book will never appears today. Here I must mention some of them. On the first, I would like to give my sincerely thanks to Dr.Perze for his encourage and endless help. Without his encourage and suggestion, I would do some else works, can not investigate multi-spaces and finish this book. Second, I would like to thank Prof. Feng Tian, Yanpei Liu and Jiyi Yan for them interested in my post-doctor report: On automorphisms of maps, surfaces and Smarandache geometries. Their encourage and warmhearted support advance this book. Thanks are also given to Professor Mingyao Xu, Xiaodong Hu, Yanxun Chang, Han Ren, Rongxia Hao, Weili He and Erling Wei for their kindly helps and often discussing problems in mathematics altogether. Of course, I am responsible for the correctness all of these materials presented here. Any suggestions for improving this book and solutions for open problems in this book are welcome. L.F.Mao AMSS, Beijing February, 2006 Contents Preface ................................................... ......................i Chapter 1 Smarandache Multi-Spaces ....................................1 1.1 sets.............................................. ..........................1 § 1.1.1 sets .............................................. .........................1 1.1.2 Partially ordered sets .............................. .......................4 1.1.3 Neutrosophic sets .................................. .......................6 1.2 Algebraic Structures ............................... .......................8 § 1.2.1 Groups ............................................ ........................8 1.2.2 Rings ............................................. .......................10 1.2.3 Vector spaces ...................................... ......................12 1.3 Algebraic Multi-Spaces ............................. ......................14 § 1.3.1 Algebraic multi-spaces............................. .......................14 1.3.2 Multi-Groups ...................................... ......................22 1.3.3 Multi-Rings ....................................... .......................29 1.3.4 Multi-Vector spaces ................................ ......................35 1.4 Multi-Metric Spaces................................ ......................39 § 1.4.1 Metric spaces...................................... .......................39 1.4.2 Multi-Metric spaces................................ .......................41 1.5 Remarks and Open Problems............................ .................48 § Chapter 2 Multi-Spaces on Graphs ......................................55
Recommended publications
  • The Maximum Number of Cliques in a Graph Embedded in a Surface
    ON THE MAXIMUM NUMBER OF CLIQUES IN A GRAPH EMBEDDED IN A SURFACE VIDA DUJMOVIC,´ GASPERˇ FIJAVZ,ˇ GWENAEL¨ JORET, THOM SULANKE, AND DAVID R. WOOD Abstract. This paper studies the following question: Given a surface Σ and an integer n, what is the maximum number of cliques in an n-vertex graph embeddable in Σ? We characterise the extremal ! 5 ! ! graphs for this question, and prove that the answer is between 8(n − !) + 2 and 8n + 2 2 + o(2 ), where ! is the maximum integer such that the complete graph K! embeds in Σ. For the surfaces S0, S1, S2, N1, N2, N3 and N4 we establish an exact answer. MSC Classification: 05C10 (topological graph theory), 05C35 (extremal problems) 1. Introduction A clique in a graph1 is a set of pairwise adjacent vertices. Let c(G) be the number of cliques in a n graph G. For example, every set of vertices in the complete graph Kn is a clique, and c(Kn) = 2 . This paper studies the following question at the intersection of topological and extremal graph theory: Given a surface Σ and an integer n, what is the maximum number of cliques in an n-vertex graph embeddable in Σ? For previous bounds on the maximum number of cliques in certain graph families see [5,6, 13, 14, 22, 23] for example. For background on graphs embedded in surfaces see [11, 21]. Every surface is homeomorphic to Sg, the orientable surface with g handles, or to Nh, the non-orientable surface with h crosscaps. The Euler characteristic of Sg is 2 − 2g.
    [Show full text]
  • Partial Duality and Closed 2-Cell Embeddings
    Partial duality and closed 2-cell embeddings To Adrian Bondy on his 70th birthday M. N. Ellingham1;3 Department of Mathematics, 1326 Stevenson Center Vanderbilt University, Nashville, Tennessee 37240, U.S.A. [email protected] Xiaoya Zha2;3 Department of Mathematical Sciences, Box 34 Middle Tennessee State University Murfreesboro, Tennessee 37132, U.S.A. [email protected] April 28, 2016; to appear in Journal of Combinatorics Abstract In 2009 Chmutov introduced the idea of partial duality for embeddings of graphs in surfaces. We discuss some alternative descriptions of partial duality, which demonstrate the symmetry between vertices and faces. One is in terms of band decompositions, and the other is in terms of the gem (graph-encoded map) representation of an embedding. We then use these to investigate when a partial dual is a closed 2-cell embedding, in which every face is bounded by a cycle in the graph. We obtain a necessary and sufficient condition for a partial dual to be closed 2-cell, and also a sufficient condition for no partial dual to be closed 2-cell. 1 Introduction In this paper a surface Σ means a connected compact 2-manifold without boundary. By an open or closed disk in Σ we mean a subset of the surface homeomorphic to such a subset of R2. By a simple closed curve or circle in Σ we mean an image of a circle in R2 under a continuous injective map; a simple arc is a similar image of [0; 1]. The closure of a set S is denoted S, and the boundary is denoted @S.
    [Show full text]
  • Coloring Discrete Manifolds
    COLORING DISCRETE MANIFOLDS OLIVER KNILL Abstract. Discrete d-manifolds are classes of finite simple graphs which can triangulate classical manifolds but which are defined entirely within graph theory. We show that the chromatic number X(G) of a discrete d-manifold G satisfies d + 1 ≤ X(G) ≤ 2(d + 1). From the general identity X(A + B) = X(A) + X(B) for the join A+B of two finite simple graphs, it follows that there are (2k)-spheres with chromatic number X = 3k+1 and (2k − 1)-spheres with chromatic number X = 3k. Examples of 2-manifolds with X(G) = 5 have been known since the pioneering work of Fisk. Current data support the that an upper bound X(G) ≤ d3(d+1)=2e could hold for all d-manifolds G, generalizing a conjecture of Albertson-Stromquist [1], stating X(G) ≤ 5 for all 2-manifolds. For a d-manifold, Fisk has introduced the (d − 2)-variety O(G). This graph O(G) has maximal simplices of dimension (d − 2) and correspond to complete complete subgraphs Kd−1 of G for which the dual circle has odd cardinality. In general, O(G) is a union of (d − 2)-manifolds. We note that if O(S(x)) is either empty or a (d − 3)-sphere for all x then O(G) is a (d − 2)-manifold or empty. The knot O(G) is already interesting for 3-manifolds G because Fisk has demonstrated that every possible knot can appear as O(G) for some 3-manifold. For 4-manifolds G especially, the Fisk variety O(G) is a 2-manifold in G as long as all O(S(x)) are either empty or a knot in every unit 3-sphere S(x).
    [Show full text]
  • Topological Graph Theory Lecture 16-17 : Width of Embeddings
    Topological Graph Theory∗ Lecture 16-17 : Width of embeddings Notes taken by Drago Bokal Burnaby, 2006 Summary: These notes cover the ninth week of classes. The newly studied concepts are homotopy, edge-width and face-width. We show that embeddings with large edge- or face-width have similar properties as planar embeddings. 1 Homotopy It is beyond the purpose of these lectures to deeply study homotopy, but as we will need this concept, we mention it briefly. Two closed simple curves in a given surface are homotopic, if one can be continuously deformed into the other. For instance, on the sphere any two such curves are (freely) homotopic, whereas on the torus S1 × S1 we have two homotopy classes: S1 × {x} and {y}× S1. Formally: Definition 1.1. Let γ0, γ1 : I → Σ be two closed simple curves. A homotopy from γ0 to γ1 is a continuous mapping H : I × I → Σ, such that H(0,t)= γ0(t) and H(1,t)= γ1(t). The following proposition may be of interest: Proposition 1.2. Let C be the family of disjoint non-contractible cycles of a graph G embedded in a surface Σ of Euler genus g, such that no two cycles of C are homotopic. Then |C| ≤ 3g − 3, for g ≥ 2, and |C |≤ g, for g ≤ 1. 2 Edge-width Definition 2.1. Let Π be an embedding of a graph G in a surface Σ of Euler genus g. If g ≥ 1 we define the edge-width of Π, ew(G, Π) = ew(Π), to be the length of the shortest Π-non-contractible cycle in G.
    [Show full text]
  • Topological Graph Theory
    Topological Graph Theory Bojan Mohar Simon Fraser University Intensive Research Program in Discrete, Combinatorial and Computational Geometry Advanced Course II: New Results in Combinatorial & Discrete Geometry Barcelona, May 7{11, 2018 Abstract The course will outline fundamental results about graphs embed- ded in surfaces. It will briefly touch on obstructions (minimal non- embeddable graphs), separators and geometric representations (circle packing). Time permitting, some applications will be outlined concern- ing homotopy or homology classification of cycles, crossing numbers and Laplacian eigenvalues. 1 The course will follow the combinatorial approach to graphs embedded in surfaces after the monograph written by Carsten Thomassen and the lec- turer [MT01]. 1 Planar graphs Connectivity, drawings, Euler's Formula • Tutte's definition of connectivity. • Blocks, ear-decomposition, contractible edges in 3-connected graphs. Proposition 1. If G is a 2-connected graph, then it can be obtained from a cycle of length at least three by successively adding a path having only its ends in common with the current graph. The decomposition of a 2-connected graph in a cycle and a sequence of paths is called an ear decomposition of the graph. Proposition 1 has an analogue for 3-connected graphs. Theorem 2 (Tutte [Tu61, Tu66]). Every 3-connected graph can be obtained from a wheel by a sequence of vertex splittings and edge- additions so that all intermediate graphs are 3-connected. Thomassen [Th80] showed that the following \generalized contraction" operation is sufficient to reduce every 3-connected graph to K4. If G is a graph and e 2 E(G), let G==e be the graph obtained from the edge-contracted graph G=e by replacing all multiple edges by single edges joining the same pairs of vertices.
    [Show full text]
  • Embeddings of Graphs
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Mathematics 124 (1994) 217-228 217 North-Holland Embeddings of graphs Carsten Thomassen Mathematisk Institut, Danmarks Tekniske Hojskoie. Bygning 303, DK-Lyngby. Denmark Received 2 June 1990 Abstract We survey some recent results on graphs embedded in higher surfaces or general topological spaces. 1. Introduction A graph G is embedded in the topological space X if G is represented in X such that the vertices of G are distinct elements in X and an edge in G is a simple arc connecting its two ends such that no two edges intersect except possibly at a common end. Graph embeddings in a broad sense have existed since ancient time. Pretty tilings of the plane have been produced for aestetic or religious reasons (see e.g. [7]). The characterization of the Platonic solids may be regarded as a result on tilings of the sphere. The study of graph embeddings in a more restricted sense began with the 1890 conjecture of Heawood [S] that the complete graph K, can be embedded in the orientable surface S, provided Euler’s formula is not violated. That is, g >&(n - 3)(n -4). Much work on graph embeddings has been inspired by this conjecture the proof of which was not completed until 1968. A complete proof can be found in Ringel’s book [12]. Graph embedding problems also arise in the real world, for example in connection with the design of printed circuits. Also, algorithms involving graphs may be very sensitive to the way in which the graphs are represented.
    [Show full text]
  • Topological Graph Theory Lecture 15-16 : Cycles of Embedded Graphs
    Topological Graph Theory∗ Lecture 15-16 : Cycles of Embedded Graphs Notes taken by Brendan Rooney Burnaby, 2006 Summary: These notes cover the eighth week of classes. We present a theorem on the additivity of graph genera. Then we move on to cycles of embedded graphs, the three-path property, and an algorithm for finding a shortest cycle in a family of cycles of a graph. 1 Additivity of Genus Theorem 1.1 (Additivity of Genus). Let G be a connected graph, and let B1,B2,...,Br be the blocks of G. Then the genus of G is, r g(G)= g(Bi) i=1 and the Euler genus of G is, r eg(G)= eg(Bi). i=1 Observation 1.2. In order to prove the theorem it suffices to prove that if G = G1 ∪ G2,where G1 ∩ G2 = {v},theng(G)=g(G1)+g(G2) and eg(G)=eg(G1)+eg(G2). Proof. We set g(G)=min{g(Π) | Π is an orientable embedding of G} g(G1)=min{g(Π1) | Π1 is an orientable embedding of G1} g(G2)=min{g(Π2) | Π2 is an orientable embedding of G2} Let v1,v2 be vertices in G1,G2 respectively, distinct from v. Note that the local rotations of v1,v2 are independent, but the local rotation of v is not. So if we take Π an embedding of G and split it along v we obtain Π1, Π2 embeddings of G1,G2 respectively. Facial walks in G that do not pass from G1 to G2 remain unchanged in Π1, Π2, however if a facial walk does pass from G1 to G2 then when we split we form an extra face.
    [Show full text]
  • The Choice Number Versus the Chromatic Number for Graphs Embeddable on Orientable Surfaces
    THE CHOICE NUMBER VERSUS THE CHROMATIC NUMBER FOR GRAPHS EMBEDDABLE ON ORIENTABLE SURFACES NIRANJAN BALACHANDRAN AND BRAHADEESH SANKARNARAYANAN Abstract. We show that for loopless 6-regular triangulations on the torus the gap between the choice number and chromatic number is at most 2. We also show that the largest gap for graphs p embeddable in an orientable surface of genus g is of the order Θ( g), and moreover for graphs p p with chromatic number of the order o( g= log(g)) the largest gap is of the order o( g). 1. Introduction We shall denote by N the set of natural numbers f0; 1; 2;:::g. For a graph G = (V; E), the notation v ! w shall indicate that the edge v ∼ w 2 E is oriented from the vertex v to the vertex w.A graph G is directed if every edge of G is oriented. All logarithms in this paper are to the base 2. We freely make use of the Bachmann{Landau{Knuth notations, but state them briefly for completeness below. Let f and g be positive functions of real variables. (1) f = o(g) if limx!1 f(x)=g(x) = 0; (2) f ≤ O(g) if there is a constant M > 0 such that lim supx!1 f(x)=g(x) ≤ M; (3) f ≥ Ω(g) if g ≤ O(f); and (4) f = Θ(g) if Ω(g) ≤ f ≤ O(g). A (vertex) coloring of a graph G = (V; E) is an assignment of a \color" to each vertex, that is, an assignment v 7! color(v) 2 N for every v 2 V (G).
    [Show full text]
  • Planarity — §8.1 50 Planarity up Until Now, Graphs Have Been Completely Abstract
    Planarity — §8.1 50 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. ! Do the edges cross? ! Are there knots in the graph structure? Definition: A drawing of a graph G is a pictorial representation of G in the plane as points and curves, satisfying the following: ! The curves must be simple, which means no self-intersections. ! No two edges can intersect twice. (Mult. edges: Except at endpts) ! No three edges can intersect at the same point. Definition: A plane drawing of a graph G is a drawing of the graph in the plane with no crossings. Definition: A graph G is planar if there exists a plane drawing of G. Otherwise, we say G is nonplanar. Example. K4 is planar because is a plane drawing of K4. Planarity — §8.1 51 Vertices, Edges, and Faces Definition: In a plane drawing, edges divide the plane into regions, or faces. There will always be one face with infinite area. This is called the outside face. Notation. Let p =# of vertices, q =# of edges, r =# of regions. Compute the following data: Graph p q r Tetrahedron Cube Octahedron Dodecahedron Icosahedron In 1750, Euler noticed that in each of these examples. Planarity — §8.1 52 Euler’s Formula Theorem 8.1.1 (Euler’s Formula) If G is a connected planar graph, then in a plane drawing of G, p q + r = 2. − Proof (by induction on the number of cycles) Base Case: If G is a connected graph with no cycles, then G Therefore r = , and we have p q + r = p (p 1) + 1 = 2.
    [Show full text]
  • A Review of Geometric, Topological and Graph Theory Apparatuses for the Modeling and Analysis of Biomolecular Data
    A review of geometric, topological and graph theory apparatuses for the modeling and analysis of biomolecular data Kelin Xia1 ∗and Guo-Wei Wei2;3 y 1Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637371 2Department of Mathematics Michigan State University, MI 48824, USA 3Department of Biochemistry & Molecular Biology Michigan State University, MI 48824, USA January 31, 2017 Abstract Geometric, topological and graph theory modeling and analysis of biomolecules are of essential im- portance in the conceptualization of molecular structure, function, dynamics, and transport. On the one hand, geometric modeling provides molecular surface and structural representation, and offers the basis for molecular visualization, which is crucial for the understanding of molecular structure and interactions. On the other hand, it bridges the gap between molecular structural data and theoretical/mathematical mod- els. Topological analysis and modeling give rise to atomic critic points and connectivity, and shed light on the intrinsic topological invariants such as independent components (atoms), rings (pockets) and cavities. Graph theory analyzes biomolecular interactions and reveals biomolecular structure-function relationship. In this paper, we review certain geometric, topological and graph theory apparatuses for biomolecular data modeling and analysis. These apparatuses are categorized into discrete and continuous ones. For discrete approaches, graph theory, Gaussian network model, anisotropic network model, normal mode analysis, quasi-harmonic analysis, flexibility and rigidity index, molecular nonlinear dynamics, spectral graph the- ory, and persistent homology are discussed. For continuous mathematical tools, we present discrete to continuum mapping, high dimensional persistent homology, biomolecular geometric modeling, differential geometry theory of surfaces, curvature evaluation, variational derivation of minimal molecular surfaces, atoms in molecule theory and quantum chemical topology.
    [Show full text]
  • Structural Graph Theory Doccourse 2014: Lecture Notes
    Structural Graph Theory DocCourse 2014: Lecture Notes Andrew Goodall, Llu´ısVena (eds.) 1 Structural Graph Theory DocCourse 2014 Editors: Andrew Goodall, Llu´ısVena Published by IUUK-CE-ITI series in 2017 2 Preface The DocCourse \Structural Graph Theory" took place in the autumn semester of 2014 under the auspices of the Computer Science Institute (IUUK)´ and the Department of Applied Mathematics (KAM) of the Faculty of Mathematics and Physics (MFF) at Charles University, supported by CORES ERC-CZ LL- 1201 and by DIMATIA Prague. The schedule was organized by Prof. Jaroslav Neˇsetˇriland Dr Andrew Goodall, with the assistance of Dr Llu´ısVena. A web page was maintained by Andrew Goodall, which provided links to lectures slides and further references.1 The Structural Graph Theory DocCourse followed the tradition established by those of 2004, 2005 and 2006 in Combinatorics, Geometry, and Computation, organized by Jaroslav Neˇsetˇriland the late JiˇriMatouˇsek,and has itself been followed by a DocCourse in Ramsey Theory in autumn of last year, organized by Jaroslav Neˇsetˇriland Jan Hubiˇcka. For the Structural Graph Theory DocCourse in 2014, five distinguished vis- iting speakers each gave a short series of lectures at the faculty building at Malostransk´en´amest´ı25 in Mal´aStrana: Prof. Matt DeVos of Simon Fraser University, Vancouver; Prof. Johann Makowsky of Technion - Israel Institute of Technology, Haifa; Dr. G´abor Kun of ELTE, Budapest; Prof. Michael Pinsker of Technische Universit¨atWien/ Universit´eDiderot - Paris 7; and Dr Lenka Zdeborov´aof CEA & CNRS, Saclay. The audience included graduate students and postdocs in Mathematics or in Computer Science in Prague and a handful of students from other universities in the Czech Republic and abroad.
    [Show full text]
  • §B. Graphs on Surfaces
    Spring Semester 2015{2016 MATH41072/MATH61072 Algebraic Topology Supplementary read- ing xB. Graphs on Surfaces B.1 Definition. A graph G is a 1-dimensional simplicial complex (see Definition 4.3) which can be thought of as a finite set V = V (G) of vertices and a set E = E(G) of pairs of vertices called edges (see Definition 4.12). The degree of a vertex is the number of edges containing that vertex. A graph G is connected if for each pair of vertices v, v0 2 V (G) we can find a sequence of edges fv0; v1g, fv1; v2g,... fvn−1; vng 2 E(G) such that v0 = v 0 and vn = v (cf. Definition 2.3(b)). B.2 Examples. (a) The complete graph on n vertices Kn has all possible n 2 edges. (b) The complete bipartate graph Km;n has a vertex set V = V1 t V2 where V1 consists of m vertices and V2 consists of n vertices and the edge set is E = fv1; v2g j v1 2 V1; v2 2 V2 . B.3 Definition. A graph G can be embedded in a surface S if the geo- metric realization of G (thought of as a 1-dimensional simplicial complex) is homeomorphic to a subspace of S. A graph which embeds in S2 is called a planar graph (since embeddability 2 2 in S is clearly equivalent to embeddability in R . B.4 Remark. It is a consequence of the Triangulation Theorem (Theo- rem 2.7) that G may be embedded in S if and only if there is a triangulation of S, i.e.
    [Show full text]