Related papers: Height estimates for Killing graphs
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
In this paper we obtain height estimates for compact, constant mean curvature vertical graphs in the homogeneous spaces $\mathrm{Nil}_3$ and $\widetilde{PSL}_2(\mathbb{R})$. As a straightforward consequence, we announce a structure-type…
In this note we extend the concept height on projective spaces to that of weighted height on weighted projective spaces and show how such a height can be computed. We prove some of the basic properties of the weighted height and show how it…
Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum weight of a general matching. Motivated by the computer…
While there have been many results on lower bounds for Max Cut in unweighted graphs, there are only few results for lower bounds for Max Cut in weighted graphs. In this paper, we launch an extensive study of lower bounds for Max Cut in…
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter provides a…
We extend the interior gradient estimate due to N. Korevaar and L. Simon for solutions of the mean curvature equation from the case of Euclidean graphs to the general case of Killing graphs. Our main application is the proof of existence of…
We study the asymptotic Dirichlet problem for Killing graphs with prescribed mean curvature $H$ in warped product manifolds $M\times_\varrho \mathbb{R}$. In the first part of the paper, we prove the existence of Killing graphs with…
It is proved the existence and uniqueness of Killing graphs with prescribed mean curvature in a large class of Riemannian manifolds.
The study of symmetries in the realm of manifolds can be approached in two different ways. On one hand, Killing vector fields on a (pseudo-)Riemannian manifold correspond to the directions of local isometries within it. On the other hand,…
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…
We study the problem of sketching an input graph, so that given the sketch, one can estimate the weight of any cut in the graph within factor $1+\epsilon$. We present lower and upper bounds on the size of a randomized sketch, focusing on…
We will discuss some sharp estimates for CMC graphs in a Riemannian 3-manifold MxR whose boundary is contained in a slice. We will start by giving sharp lower bounds for the geodesic curvature of the boundary and improve these bounds when…
In this paper, we provided conditions for an entire constant mean curvature Killing graph lying inside a possible unbounded region to be necessarily a slice.
In this paper, we give a height estimate for constant mean curvature graphs. Using this result we prove two results of uniqueness for the Dirichlet problem associated to the constant mean curvature equation on unbounded domains.
We prove the existence and uniqueness of graphs with prescribed mean curvature function in a large class of Riemannian manifolds which comprises spaces endowed with a conformal Killing vector field.
We prove that there exist solutions for a non-parametric capillary problem in a wide class of Riemannian manifolds endowed with a Killing vector field. In other terms, we prove the existence of Killing graphs with prescribed mean curvature…
We exploit the structure of geometric graphs on Riemannian manifolds to analyze strategic dynamic graphs at the limit, when the number of nodes tends to infinity. This framework allows to preserve intrinsic geometrical information about the…
We give a detailed explicit computation of weights of Kontsevich graphs which arise from connection and curvature terms within the globalization picture for the special case of symplectic manifolds. We will show how the weights for the…