Related papers: A Jenkins-Serrin problem on the strip
We prove that all $1$-vertex spatial graphs with adequate diagrams have minimal crossing number, and that spatial graph diagrams obtained by replacing vertices and edges of a planar embedded graph by minimal crossing link or spatial graph…
The k-planar graphs, which are (usually with small values of k such as 1, 2, 3) subject to recent intense research, admit a drawing in which edges are allowed to cross, but each one edge is allowed to carry at most k crossings. In recently…
We say that a $2$-dimensional CW complex is a multibranched surface if we remove all points whose open neighborhoods are homeomorphic to the $2$-dimensional Euclidean space, then we obtain a $1$-dimensional complex which is homeomorphic to…
Let k_r(n,m) denote the minimum number of r-cliques in graphs with n vertices and m edges. For r=3,4 we give a lower bound on k_r(n,m) that approximates k_r(n,m) with an error smaller than n^r/(n^2-2m). The solution is based on a constraint…
We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…
Circular layouts are a popular graph drawing style, where vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is \NP-hard. One way to allow for fewer crossings in practice are…
Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…
Is it possible to obtain unbounded minimal surfaces in certain asymptotically flat 3-manifolds as a limit of solutions to a natural mountain pass problem with diverging boundaries? In this work, we give evidence that this might be true by…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
We give the lower bound for the growth of the maximum value for a solution to the minimal surface equation with 0 boundary values over an unbounded simply connected domain.
We survey Bernstein-type theorems for graphical surfaces in the Euclidean space and the Lorentz-Minkowski space. More specifically, we explain several proofs of the Bernstein theorem for minimal graphs in the Euclidean 3-space. Furthermore,…
In this article we consider surfaces in the product space $\h^2\times \r$ of the hyperbolic plane $\h^2$ with the real line. The main results are: a description of some geometric properties of minimal graphs; new examples of complete…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…
We prove by variational means the existence of a complete, properly embedded, genus-one minimal surface in R^3 that is asymptotic to a helicoid at infinity. We also prove existence of surfaces that are asymptotic to a helicoid away from the…
Minimal surfaces in the sub-Riemannian Heisenberg group can be constructed by means of a Riemannian approximation scheme, as limit of Riemannian minimal surfaces. We study the regularity of Lipschitz, non-characteristic minimal surfaces…
The minimal vertex-cover (or maximal independent-set) problem is studied on random graphs of finite connectivity. Analytical results are obtained by a mapping to a lattice gas of hard spheres of (chemical) radius one, and they are found to…
We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include…
There are some existence problems of Jenkins-Strebel differentials on a Riemann surface. The one of them is to find a Jenkins-Strebel differential whose characteristic ring domains have given positive numbers as their circumferences, for…