Related papers: Topological inductive constructions for tight surf…
The girth of a graph is the length of its shortest cycle. Due to its relevance in graph theory, network analysis and practical fields such as distributed computing, girth-related problems have been object of attention in both past and…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
The torus T of projective space also acts on the Hilbert scheme of subschemes of projective space. The T-graph of the Hilbert scheme has vertices the fixed points of this action, and edges connecting pairs of fixed points in the closure of…
In this paper, we discuss optimal $1$-toroidal graphs (abbreviated as O1TG), which are drawn on the torus so that every edge crosses another edge at most once, and has $n$ vertices and exactly $4n$ edges. We first consider connectivity of…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…
We develop the theory of the diagrammatics of surface cross sections to prove that there are an infinite number of homology 3-spheres smoothly embeddable in a homology 4-sphere but not in a homotopy 4-sphere. Our primary obstruction comes…
We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a directed graph provides a useful bridge between network science and topology. Indeed, it has…
In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generalization of early results of Hopf and Pannwitz, Sutherland,…
The class of special generic maps contains Morse functions with exactly two singular points, characterizing spheres topologically which are not $4$-dimensional and the $4$-dimensional unit sphere. This class is for higher dimensional…
A rectangular dual of a plane graph $G$ is a contact representation of $G$ by interior-disjoint rectangles such that (i) no four rectangles share a point, and (ii) the union of all rectangles is a rectangle. In this paper, we study…
A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We…
Comessatti proved that the set of real points of a rational real algebraic surface is either a nonorientable surface, or the two-sphere, or the torus. Conversely, it is easy to see that all of these surfaces admit a rational real algebraic…
We have performed an ab initio investigation of the electronic properties of the graphene sheet adsorbed by Ru adatoms (Ru/graphene). For a particular set of triangular arrays of Ru adatoms, we find the formation of four (spin-polarized)…
The main objects of this paper are torus orbifolds that have exactly two fixed points. We study the equivariant topological type of these orbifolds and consider when we can use the results of the paper [DKS] (arXiv:1809.03678) to compute…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We study attracting graphs of step skew products from the topological and ergodic points of view where the usual contracting-like assumptions of the fiber dynamics are replaced by weaker merely topological conditions. In this context, we…
To investigate the topological structure of Morse flows with a sink on the 2-sphere we use the planar tree as complete topological invariant of the flow. We give a list of all planar tree with at least 7 edges. We use a list of rooted…
The degree of a map between orientable manifolds is a fundamental concept in topology, offering deep insights into the structure of the manifolds and the nature of the corresponding maps. This concept has been extensively studied,…
In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…
We investigate graph hypersurfaces and study conditions under which graph hypersurfaces admit algebraic torus operations. This leads in principle to a computation of graph motives using the theorem of Bialynicki-Birula, provided one knows…