Related papers: The first gap for total curvatures of planar graph…
In this paper, we consider the anisotropic $\alpha$-Gauss curvature flow for complete noncompact convex hypersurfaces in the Euclidean space with the anisotropy determined by a smooth closed uniformly convex Wulff shape. We show that for…
In recent years, discrete spaces such as graphs attract much attention as models for physical spacetime or as models for testing the spirit of non-commutative geometry. In this work, we construct the differential algebras for graphs by…
A matching of a graph is a set of edges without common end vertex. A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Recently, Biedl and Wittnebel proved that every 1-planar graph…
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 obtain an optimal estimate for the extrinsic curvature of an entire minimal graph in $\H^2\times\R$, $\H^2$ the hyperbolic plane.
We prove an inequality for the curvature of level sets of minimal graphs having vanishing boundary values and show that if the boundary is concave, then all the level sets are concave.
In this note we show that every (real or complex) vector bundle over a compact rank one symmetric space carries, after taking the Whitney sum with a trivial bundle of sufficiently large rank, a metric with nonnegative sectional curvature.…
A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We first show that for every triangle-free planar graph G and a vertex…
In this paper, we give a generalization of Fenchel's theorem for closed curves as frontals in Euclidean space $\mathbb{R}^n$. We prove that, for a non-co-orientable closed frontal in $\mathbb{R}^n$, its total absolute curvature is greater…
A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. It is proved that…
We give a condition under which the findings of the paper cited above work well and determine the surfaces that were not considered before. In this paper, we show that a parallel mean curvature surface of a general type in a complex…
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…
We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.
Planar curves with periodically varying curvature arise in the natural sciences as the result of a wide variety of periodic processes. The total curvature of a periodic arc in such curves constrains their symmetry. It is shown how the total…
A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges. We show that optimal 1-planar graphs can be recognized in linear time. Our…
A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small…
A vertex colouring of a graph is \emph{nonrepetitive} if there is no path for which the first half of the path is assigned the same sequence of colours as the second half. The \emph{nonrepetitive chromatic number} of a graph $G$ is the…
In this paper, extending a result of Brooks et.al. [arXiv:2403.04110], we show that if an outerplanar graph $G$ with minimum degree at least $2$ has positive Lin-Lu-Yau curvature on every vertex pair, then $G$ has at most $10$ vertices, and…
We discuss upper and lower bounds for the size of gaps in the length spectrum of negatively curved manifolds. For manifolds with algebraic generators for the fundamental group, we establish the existence of exponential lower bounds for the…
In this paper, we study the interplay of geometry and positive scalar curvature on a complete, non-compact manifold with non-negative Ricci curvature. In three-dimensional manifold, we prove a minimal volume growth, an estimate of integral…