English
Related papers

Related papers: Obstructions for generalized graphmanifolds to be …

200 papers

We study the curvature-dimension inequality in regular graphs. We develop techniques for calculating the curvature of such graphs, and we give characterizations of classes of graphs with positive, zero, and negative curvature. Our main…

Combinatorics · Mathematics 2017-01-31 Peter Ralli

Let $G/H$ be a closed, simply connected homogeneous manifold. Suppose every stable class of real vector bundles over $G/H$ contains a homogeneous bundle. Then, for any closed, simply connected smooth manifold $M$ homotopy equivalent to…

Differential Geometry · Mathematics 2025-08-22 Wen Shen

A mixed graph $G$ can contain both (undirected) edges and arcs (directed edges). Here we derive an improved Moore-like bound for the maximum number of vertices of a mixed graph with diameter at least three. Moreover, a complete enumeration…

Combinatorics · Mathematics 2018-04-26 C. Dalfó , M. A. Fiol , N. López

On a compact manifold with boundary, the map consisting of the scalar curvature in the interior and the mean curvature on the boundary is a local surjection at generic metrics. Moreover, this result may be localized to compact subdomains in…

Differential Geometry · Mathematics 2026-03-20 Hongyi Sheng

Recent work has shown that two-dimensional non-linear $\sigma$-models on group manifolds with Poisson-Lie symmetry can be understood within generalised geometry as exemplars of generalised parallelisable spaces. Here we extend this idea to…

High Energy Physics - Theory · Physics 2019-12-24 Saskia Demulder , Falk Hassler , Giacomo Piccinini , Daniel C. Thompson

A longstanding avenue of research in orientable surface topology is to create and enumerate collections of curves in surfaces with certain intersection properties. We look for similar collections of curves in non-orientable surfaces. A…

Geometric Topology · Mathematics 2023-04-19 Sarah Ruth Nicholls , Nancy Scherich , Julia Shneidman

A graph is $H$-free if it has no induced subgraph isomorphic to $H$. We characterize all graphs $H$ for which there are only finitely many minimal non-three-colorable $H$-free graphs. Such a characterization was previously known only in the…

Combinatorics · Mathematics 2018-02-08 Maria Chudnovsky , Jan Goedgebeur , Oliver Schaudt , Mingxian Zhong

A metric probability space $M$ admits thresholds if the random geometric graph on $M$ has a threshold for every monotone graph property. We connect the existence of thresholds to the uniform expansion of $M$ and prove that all standard…

Combinatorics · Mathematics 2026-05-21 Bhargav Narayanan

Given finitely many connected polygonal obstacles $O_1,\dots,O_k$ in the plane and a set $P$ of points in general position and not in any obstacle, the {\em visibility graph} of $P$ with obstacles $O_1,\dots,O_k$ is the (geometric) graph…

Combinatorics · Mathematics 2017-09-08 John Gimbel , Patrice Ossona de Mendez , Pavel Valtr

A general model for geometric structures on differentiable manifolds is obtained by deforming infinitesimal symmetries. Specifically, this model consists of a Lie algebroid, equipped with an affine connection compatible with the Lie…

Differential Geometry · Mathematics 2012-03-07 Anthony D. Blaom

We follow up on previous work which found that commonly used graph evolution moves lead to conserved quantities that can be expressed in terms of the braiding of the graph in its embedding space. We study non-embedded graphs under three…

General Relativity and Quantum Cosmology · Physics 2008-11-26 Fotini Markopoulou , Isabeau Prémont-Schwarz

Special generic maps are higher dimensional versions of Morse functions with exactly two singular points, characterizing spheres topologically except $4$-dimensional cases: in these cases standard spheres are characterized. Canonical…

Algebraic Topology · Mathematics 2022-04-12 Naoki Kitazawa

In this paper, we consider a fully nonlinear problem on manifolds with boundaries of negative admissible curvatures. As a consequence, we conclude the existence of certain types of metrics on the general differential manifolds with…

Analysis of PDEs · Mathematics 2011-02-22 Aobing Li , Huan Zhu

An obstacle representation of a graph $G$ consists of a set of pairwise disjoint simply-connected closed regions and a one-to-one mapping of the vertices of $G$ to points such that two vertices are adjacent in $G$ if and only if the line…

Computational Geometry · Computer Science 2025-02-25 Martin Balko , Steven Chaplick , Robert Ganian , Siddharth Gupta , Michael Hoffmann , Pavel Valtr , Alexander Wolff

A 2-dimensional direction-length framework is a collection of points in the plane which are linked by pairwise constraints that fix the direction or length of the line segments joining certain pairs of points. We represent it as a pair…

Combinatorics · Mathematics 2016-07-05 Katie Clinch , Bill Jackson , Peter Keevash

We show that a graph manifold which is a Z-homology 3-sphere not homeomorphic to either the 3-sphere or the Poincar\'e homology 3-sphere admits a horizontal foliation. This combines with known results to show that the conditions of not…

Geometric Topology · Mathematics 2015-06-12 Michel Boileau , Steven Boyer

An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-line segment connecting the points corresponding to two…

We obtain some restrictions on the topology of infinite volume hyperbolic manifolds. In particular, for any n and any closed negatively curved manifold M of dimension greater than 2, only finitely many hyperbolic n-manifolds are total…

Geometric Topology · Mathematics 2014-11-11 Igor Belegradek

Manifolds admitting positive sectional curvature are conjectured to have rigid homotopical structure and, in particular, comparatively small Euler charateristics. In this article, we obtain upper bounds for the Euler characteristic of a…

Differential Geometry · Mathematics 2014-07-22 Manuel Amann , Lee Kennard

It is known that the problem of computing the edge dimension of a graph is NP-hard, and that the edge dimension of any generalized Petersen graph $P(n,k)$ is at least 3. We prove that the graph $P(n,3)$ has edge dimension 4 for $n\ge 11$,…

Combinatorics · Mathematics 2020-06-12 David G. L. Wang , Monica M. Y. Wang , Shiqiang Zhang