Related papers: Compact minimal vertical graphs with non-connected…
We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…
We investigate existence and regularity properties of one-phase free boundary graphs, in connection with the question of whether there exists a complete non-planar free boundary graph in high dimensions.
We prove a phenomenon of concentration of total curvature for stable minimal surfaces in the product space H^2xR; where H^2 is the hyperbolic plane. Under some geometric conditions on the asymptotic boundary of an oriented stable minimal…
In an earlier paper the authors provided general conditions on a real codimension 2 submanifold $S\subset C^{n}$, $n\ge 3$, such that there exists a possibly singular Levi-flat hypersurface $M$ bounded by $S$. In this paper we consider the…
Haviv ({\em European Journal of Combinatorics}, 2019) has recently proved that some topological lower bounds on the chromatic number of graphs are also lower bounds on their orthogonality dimension over $\mathbb{R}$. We show that this holds…
We study two extremal problems about subgraphs excluding a family $\F$ of graphs. i) Among all graphs with $m$ edges, what is the smallest size $f(m,\F)$ of a largest $\F$--free subgraph? ii) Among all graphs with minimum degree $\delta$…
We study the problem of partitioning the edge set of the complete graph into bipartite subgraphs under certain constraints defined by forbidden subgraphs. These constraints lead to both classical problems, such as partitioning into…
Given a complete Riemannian metric of nonnegative scalar curvature on $\Sigma \times (-\infty, 0 ] $, where $\Sigma$ denotes a $2$-sphere, we exhibit conditions that imply the existence of a closed minimal surface homologous to the…
Graphs of solutions to the minimal surface equation over simply connected domains with boundary values 0 can have at most exponential growth.
We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.
A graph whose edges only appear at certain points in time is called a temporal graph (among other names). Such a graph is temporally connected if each ordered pair of vertices is connected by a path which traverses edges in chronological…
We show that in Cartan-Hadamard manifolds $M^n$, $n\geq 3$, closed infinitesimally convex hypersurfaces $\Gamma$ bound convex flat regions, if curvature of $M^n$ vanishes on tangent planes of $\Gamma$. This encompasses…
The "slope-number" of a graph $G$ is the minimum number of distinct edge slopes in a straight-line drawing of $G$ in the plane. We prove that for $\Delta\geq5$ and all large $n$, there is a $\Delta$-regular $n$-vertex graph with…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
A folklore result attributed to P\'olya states that there are $(1 + o(1))2^{\binom{n}{2}}/n!$ non-isomorphic graphs on $n$ vertices. Given two graphs $G$ and $H$, we say that $G$ is a unique subgraph of $H$ if $H$ contains exactly one…
In this paper we study some geometric properties of surfaces in the Heisenberg group, $\mathcal{H}_{3}.$ We obtain, using the Gauss map for Lie groups, a partial classification of minimal graphs in $\mathcal{H}_{3}.$ We also proof the non…
In this note, we derive a uniqueness theorem for minimal graphs of general codimension under certain restrictions closed related to the convexity (not strict convexity) of the area functional with respect to singular values, improving the…
Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…
The difference between the two largest eigenvalues of the adjacency matrix of a graph $G$ is called the spectral gap of $G.$ If $G$ is a regular graph, then its spectral gap is equal to algebraic connectivity. Abdi, Ghorbani and Imrich, in…
In this paper, we prove two Liouville-type theorems for capillary minimal graph over $\mathbb{R}^n_+$. First, if $u$ has linear growth, then for $n=2,3$ and for any $\theta\in(0,\pi)$, or $n\geq4$ and $\theta\in(\frac{\pi}6,\frac{5\pi}6)$,…