Related papers: The Maximal Graph Dirichlet Problem in Semi-Euclid…
In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo-Euclidean space ($R^d$ with a metric of indefinite signature). We show that a…
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…
The purpose of this paper is twofold: firstly, to establish sufficient conditions under which the mean curvature flow supported on a hypersphere with exterior Dirichlet boundary exists globally in time and converges to a minimal surface,…
The so called Jenkins-Serrin problem is a kind of Dirichlet problem for graphs with prescribed mean curvature that combines, at the same time, continuous boundary data with regions of the boundary where the boundary values explodes either…
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.
Let $E$ be an arbitrary directed graph and let $L$ be the Leavitt path algebra of the graph $E$ over a field $K$. The necessary and sufficient con- ditions are given to assure the existence of a maximal ideal in $L$ and also the necessary…
In this paper, we characterize all graphs with eigenvectors of the signless Laplacian and adjacency matrices with components equal to $\{- 1, 0, 1\}.$ We extend the graph parameter max $k$-cut to square matrices and prove a general sharp…
A \textit{diameter graph in $\mathbb R^d$} is a graph, whose set of vertices is a finite subset of $\mathbb R^d$ and whose set of edges is formed by pairs of vertices that are at diameter apart. This paper is devoted to the study of…
Let $(V,\mu)$ be an infinite, connected, locally finite weighted graph. We study the problem of existence or non-existence of positive solutions to a semi-linear elliptic inequality \begin{equation*} \Delta u+u^{\sigma}\leq0\quad…
We wish to bring attention to a natural but slightly hidden problem, posed by Erd\H{o}s and Ne\v{s}et\v{r}il in the late 1980s, an edge version of the degree--diameter problem. Our main result is that, for any graph of maximum degree…
The Dirichlet problem and Dirichlet to Neumann map are analyzed for elliptic equations on a large collection of infinite quantum graphs. For a dense set of continuous functions on the graph boundary, the Dirichlet to Neumann map has values…
We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twin-orthogonal graphs. The problem is…
This paper considers the degree-diameter problem for extremal and largest known undirected circulant graphs of degree 2 to 9 of arbitrary diameter. As these graphs are vertex transitive it is possible to define their distance partition. The…
In this paper, we study the Dirichlet problem associated to the maximal surface equation. We prove the uniqueness of bounded solutions to this problem in unbounded domain in R^2.
In this short note, we consider the problem of prescribing the Gauss curvature and image of the Gauss map for the graph of a function over a domain in Euclidean space. The prescription of the image of the Gauss map turns this into a second…
We investigate the validity of the Phragm\`en-Lindel\"of principle for a class of elliptic equations with a potential, posed on infinite graphs. Consequently, we get uniqueness, in the class of solutions satisfying a suitable growth…
We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero…
The Zarankiewicz problem, a cornerstone problem in extremal graph theory, asks for the maximum number of edges in an $n$-vertex graph that does not contain the complete bipartite graph $K_{s,s}$. While the problem remains widely open in the…
We prove the existence of classical solutions to the Dirichlet problem for a class of fully nonlinear elliptic equations of curvature type on Riemannian manifolds. We also derive new second derivative boundary estimates which allows us to…
Given an undirected, unweighted graph with $n$ vertices and $m$ edges, the maximum cut problem is to find a partition of the $n$ vertices into disjoint subsets $V_1$ and $V_2$ such that the number of edges between them is as large as…