English
Related papers

Related papers: The first gap for total curvatures of planar graph…

200 papers

If the Lorentzian norm on a maximal surface in the 3-dimensional Lorentz-Minkowski space $R_1^3$ is positive and proper, then the surface is relative parabolic. As a consequence, entire maximal graphs with a closed set of isolated…

Differential Geometry · Mathematics 2007-05-23 Isabel Fernandez , Francisco J. Lopez

We prove that for combinatorial graphs with non-negative Ollivier curvature, one has \[ \|P_t \mu - P_t \nu\|_1 \leq \frac{W_1(\mu,\nu)}{\sqrt{t}} \] for all probability measures $\mu,\nu$ where $P_t$ is the heat semigroup and $W_1$ is the…

Differential Geometry · Mathematics 2019-08-01 Florentin Münch

A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover…

Combinatorics · Mathematics 2015-04-21 Farhad Shahrokhi

For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…

Combinatorics · Mathematics 2018-03-29 M. R. Emamy-K. , Bahman Kalantari , Tatiana Correa

In this paper, we study curvature estimates for nodal sets of harmonic functions in the plane. We prove that at any point $p$, the curvature of each nodal curve of any harmonic function $u$ is upper bounded by…

Analysis of PDEs · Mathematics 2024-09-06 Jin Sun

It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…

Differential Geometry · Mathematics 2007-05-23 Mu-Tao Wang

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of…

Combinatorics · Mathematics 2019-12-17 Bei Niu , Xin Zhang

In this paper, we classify graphs with nonnegative Lin-Lu-Yau-Ollivier Ricci curvature, maximum degree at most 3 and diameter at least 6.

Differential Geometry · Mathematics 2021-10-14 Fengwen Han , Tao Wang

Tropical curves in $\mathbb{R}^2$ correspond to metric planar graphs but not all planar graphs arise in this way. We describe several new classes of graphs which cannot occur. For instance, this yields a full combinatorial characterization…

Combinatorics · Mathematics 2021-08-03 Michael Joswig , Ayush Kumar Tewari

Two sets of conditions are presented for the compactness of a real plane algebraic curve, one sufficient and one necessary, in terms of the Newton polygon of the defining polynomial.

Algebraic Geometry · Mathematics 2007-05-23 John Stalker

A graph $G$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$.…

Combinatorics · Mathematics 2019-07-24 Hooman R. Dehkordi , Graham Farr

We study contracting curvature flows of compact hypersurfaces with positive sectional curvature in hyperbolic space $\mathbb{H}^{n+1}$. The speed is assumed to be homogeneous of degree one in the principal curvatures and to satisfy certain…

Differential Geometry · Mathematics 2026-04-29 Tianci Luo , Yong Wei , Rong Zhou

We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…

Algebraic Topology · Mathematics 2021-08-03 Ben Knudsen

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…

Computational Geometry · Computer Science 2012-03-28 Sergio Cabello , Bojan Mohar

We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…

Combinatorics · Mathematics 2007-05-24 David Orden , Francisco Santos , Brigitte Servatius , Herman Servatius

In this article we study compact K\ahler manifolds satisfying a certain nonnegativity condition on the bisectional curvature. Under this condition, we show that the scalar curvature is nonnegative and that the first Chern class is positive…

Differential Geometry · Mathematics 2011-09-01 Albert Chau , Luen-Fai Tam

We show that under certain curvature conditions of the ambient space an entire Killing graph of constant mean curvature lying inside a slab must be a totally geodesic slice.

Differential Geometry · Mathematics 2013-05-16 M. Dajczer , J. H. de Lira

The planar embedding conjecture asserts that any planar metric admits an embedding into L_1 with constant distortion. This is a well-known open problem with important algorithmic implications, and has received a lot of attention over the…

Computational Geometry · Computer Science 2013-04-30 Anastasios Sidiropoulos

We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…

Discrete Mathematics · Computer Science 2020-10-06 N. R. Aravind , Udit Maniyar

We prove that a proper geodesic metric space has non-positive curvature in the sense of Alexandrov if and only if it satisfies the Euclidean isoperimetric inequality for curves. Our result extends to non-geodesic spaces and non-zero…

Differential Geometry · Mathematics 2016-11-17 Alexander Lytchak , Stefan Wenger
‹ Prev 1 3 4 5 6 7 10 Next ›