English
Related papers

Related papers: Local structures in polyhedral maps on surfaces, a…

200 papers

We consider the Gaussian curvature conjecture of a minimal graph $S$ over the unit disk. First of all we reduce the general conjecture to the estimating the Gaussian curvature of some Scherk's type minimal surfaces over a quadrilateral…

Differential Geometry · Mathematics 2021-11-23 David Kalaj

We study the existence of periodic colorings and orientations in locally finite graphs. A coloring or orientation of a graph $G$ is periodic if the resulting colored or oriented graph is quasi-transitive, meaning that $V(G)$ has finitely…

Spectral graph theory studies how the eigenvalues of a graph relate to the structural properties of a graph. In this paper, we solve three open problems in spectral extremal graph theory which generalize the classical Tur\'{a}n-type…

Combinatorics · Mathematics 2026-04-10 Yongtao Li , Hong Liu , Shengtong Zhang

Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…

Machine Learning · Statistics 2022-02-03 Francesco Di Giovanni , Giulia Luise , Michael Bronstein

A graph is $2$-planar if it has local crossing number two, that is, it can be drawn in the plane such that every edge has at most two crossings. A graph is maximal $2$-planar if no edge can be added such that the resulting graph remains…

Combinatorics · Mathematics 2023-03-16 Michael Hoffmann , Meghana M. Reddy

We prove that closed manifolds admitting a generic metric whose sectional curvature is locally quasi-constant are graphs of space forms. In the more general setting of QC spaces where sets of isotropic points are arbitrary, under suitable…

Differential Geometry · Mathematics 2020-04-08 Louis Funar

We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…

Combinatorics · Mathematics 2007-05-23 Bernhard Krön

The $k$-semi equivelar maps, for $k \geq 2$, are generalizations of maps on the surfaces of Johnson solids to closed surfaces other than the 2-sphere. In the present study, we determine 2-semi equivelar maps of curvature 0 exhaustively on…

Combinatorics · Mathematics 2022-06-14 Anand Kumar Tiwari , Yogendra Singh , Amit Tripathi

As a continuation of \cite{NSY:local}, we mainly discuss the global structure of two-dimensional locally compact geodesically complete metric spaces with curvature bounded above. We first obtain the result on the Lipschitz homotopy…

Metric Geometry · Mathematics 2023-09-01 Koichi Nagano , Takashi Shioya , Takao Yamaguchi

A locally finite face-to-face tiling of euclidean d-space by convex polytopes is called combinatorially multihedral if its combinatorial automorphism group has only finitely many orbits on the tiles. The paper describes a local…

Metric Geometry · Mathematics 2008-09-16 Nikolai Dolbilin , Egon Schulte

A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that strongly regular graphs with at least six vertices are $2$-reconstructible.

Combinatorics · Mathematics 2022-10-24 Douglas B. West , Xuding Zhu

Laurent Hauswirth and Harold Rosenberg developed the theory of minimal surfaces with finite total curvature in $\H^2\times\R$. They showed that the total curvature of one such a surface must be a non-negative integer multiple of $-2\pi$.…

Differential Geometry · Mathematics 2012-10-04 Juncheol Pyo , Magdalena Rodriguez

Let $H$ be a graph on $h$ vertices. The number of induced copies of $H$ in a graph $G$ is denoted by $i_H(G)$. Let $i_H(n)$ denote the maximum of $i_H(G)$ taken over all graphs $G$ with $n$ vertices. Let $f(n,h) = \Pi_{i}^h a_i$ where…

Combinatorics · Mathematics 2018-01-16 Raphael Yuster

Traditionally, network analysis is based on local properties of vertices, like their degree or clustering, and their statistical behavior across the network in question. This paper develops an approach which is different in two respects. We…

Combinatorics · Mathematics 2016-10-12 Melanie Weber , Emil Saucan , Jürgen Jost

We prove the Erd\H{o}s-Hajnal conjecture for the five-vertex path $P_5$; that is, there exists $c>0$ such that every $n$-vertex graph with no induced $P_5$ has a clique or stable set of size at least $n^c$. This completes the verification…

Combinatorics · Mathematics 2026-02-25 Tung Nguyen , Alex Scott , Paul Seymour

We introduce the notion of a good map between topological spaces: a continuous map $f:X \to Y$ is *good* if for every non-empty irreducible locally closed subset $U \subseteq X$, there exists a non-empty open subset $W \subseteq Y$ such…

Algebraic Geometry · Mathematics 2025-12-23 Jiawei Sheng

A self-dual map $G$ is said to be \emph{antipodally self-dual} if the dual map $G^*$ is antipodal embedded in $\mathbb{S}^2$ with respect to $G$. In this paper, we investigate necessary and/or sufficient conditions for a map to be…

Combinatorics · Mathematics 2024-01-01 Luis Montejano , Jorge L. Ramírez Alfonsín , Ivan Rasskin

The maximal graph Dirichlet problem asks whether there exists a spacelike graph, in a semi-Euclidean space, with a given boundary and with mean curvature everywhere zero. We prove the existence of solutions to this problem under certain…

Analysis of PDEs · Mathematics 2011-12-20 Benjamin Stuart Thorpe

Anatomical structures such as the hippocampus, liver, and bones can be analyzed as orientable, closed surfaces. This permits the computation of volume, surface area, mean curvature, Gaussian curvature, and the Euler-Poincar\'e…

Computer Vision and Pattern Recognition · Computer Science 2021-08-11 Bryce A Besler , Tannis D. Kemp , Andrew S. Michalski , Nils D. Forkert , Steven K. Boyd

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

Computational Physics · Physics 2026-04-10 Sara Najem , Amer E. Mouawad