Related papers: The Maximal Graph Dirichlet Problem in Semi-Euclid…
A circular arc graph is the intersection graph of a collection of connected arcs on the circle. We solve a Tur'an-type problem for circular arc graphs: for n arcs, if m and M are the minimum and maximum number of arcs that contain a common…
A maximal planar graph is a graph which can be embedded in the plane such that every face of the graph is a triangle. The center of a graph is the subgraph induced by the vertices of minimum eccentricity. We introduce the notion of…
The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…
We derive the asymptotic expansion at infinity for embedded ends of uniformly elliptic Weingarten surfaces with finite total curvature in $\mathbb{R}^3$, and we establish a maximum principle at infinity. Furthermore, we solve the Dirichlet…
A graph is maximal knotless if it is edge maximal for the property of knotless embedding in $R^3$. We show that such a graph has at least $\frac74 |V|$ edges, and construct an infinite family of maximal knotless graphs with $|E| <…
We consider spacelike graphs $\Gamma_f$ of simple products $(M\times N, g\times -h)$ where $(M,g)$ and $(N,h)$ are Riemannian manifolds and $f:M\to N$ is a smooth map. Under the condition of the Cheeger constant of $M$ to be zero and some…
Given a smooth compact hypersurface $M$ with boundary $\Sigma=\partial M$, we prove the existence of a sequence $M_j$ of hypersurfaces with the same boundary as $M$, such that each Steklov eigenvalue $\sigma_k(M_j)$ tends to zero as $j$…
In the paper, we prove the existence and uniqueness results of the $C^{1,1}$ regular graphic hypersurface for Dirichlet problem of a class of degenerate Hessian quotient type curvature equations under the condition $\psi^{\frac{1}{k-l}}\in…
We consider rectangle graphs whose edges are defined by pairs of points in diagonally opposite corners of empty axis-aligned rectangles. The maximum number of edges of such a graph on $n$ points is shown to be 1/4 n^2 +n -2. This number…
We study a half-space problem related to graphs in $\mathbb{H}^2\times\mathbb{R}$, where $\mathbb{H}^2$ is the hyperbolic plane, having constant mean curvature $H$ defined over unbounded domains in $\mathbb{H}^2$.
Let $\Omega\subset\r^n$ be a bounded mean convex domain. If $\alpha<0$, we prove the existence and uniqueness of classical solutions of the Dirichlet problem in $\Omega$ for the $\alpha$-singular minimal surface equation with arbitrary…
We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower bounds on the maximum number of vertices of such a graph with diameter 2 and degree $d$. We completely determine the asymptotic behaviour…
In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…
We consider a helicoidal group $G$ in $\mathbb{R}^{n+1}$ and unbounded $G$-invariant $C^{2,\alpha}$-domains $\Omega\subset\mathbb{R}^{n+1}$ whose helicoidal projections are exterior domains in $\mathbb{R}^{n}$, $n\geq2$. We show that for…
Let $M^n\subset\mathbb R^{n+1}$ be the graph of a $C^2$-real valued function defined in a closed ball of $\mathbb R^n$. In this work, we obtain upper bounds for $\inf_M|H|$ and $\inf_M|R|$, where $H$ and $R$ are, respectively, the mean…
In this paper, we investigate the rigidity problems of complete hypersurfaces with constant mean curvature and constant scalar curvature in Euclidean spaces. Firstly, under some conditions of Gaussian-Kronecker curvature, we provide…
For a given graph $H$, its subdivisions carry the same topological structure. The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of…
We investigate the computationally hard problem whether a random graph of finite average vertex degree has an extensively large $q$-regular subgraph, i.e., a subgraph with all vertices having degree equal to $q$. We reformulate this problem…
We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…
The bloom of complex network study, in particular, with respect to scale-free ones, is considerably triggering the research of scale-free graph itself. Therefore, a great number of interesting results have been reported in the past,…