Related papers: Stable minimal graphs in Heisenberg group $\mathbb…

We study existence and structure of $P-$area minimizing surfaces in the Heisenberg group under Dirichlet and Neumann boundary conditions. We show that there exists an underlying vector field $N$ that characterized existence and structure of…

Asymptotic Schur orthogonality relations are for irreducible unitary representations of locally compact groups that need not be discrete series, where $L^2$ pairing of matrix coefficients with respect to Haar measure is replaced by a limit…

The cycle space of a graph $G$, denoted $C(G)$, is a vector space over ${\mathbb F}_2$, spanned by all incidence vectors of edge-sets of cycles of $G$. If $G$ has $n$ vertices, then $C_n(G)$ is the subspace of $C(G)$, spanned by the…

Motivated by Hadwiger's conjecture, we prove that every $n$-vertex graph $G$ with no independent set of size three contains an $\lceil n/2\rceil$-vertex simple minor $H$ with $$0.98688 \cdot \binom{|V(H)|}{2} - o(n^2)$$ edges.

The toughness $t(G)$ of a graph $G=(V,E)$ is defined as $t(G)=\min\{\frac{|S|}{c(G-S)}\}$, in which the minimum is taken over all $S\subset V$ such that $G-S$ is disconnected, where $c(G-S)$ denotes the number of components of $G-S$. We…

In the study of deterministic distributed algorithms it is commonly assumed that each node has a unique $O(\log n)$-bit identifier. We prove that for a general class of graph problems, local algorithms (constant-time distributed algorithms)…

We study the sub-Finsler prescribed mean curvature equation, associated to a strictly convex body $K_0 \subseteq \mathbb{R}^{2n}$, for $t$-graphs on a bounded domain $\Omega$ in the Heisenberg group $\mathbb{H}^n$. When the prescribed datum…

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing stability, of a graph $G$ is denoted by…

A graph $G$ is minimally $t$-tough if the toughness of $G$ is $t$ and the deletion of any edge from $G$ decreases the toughness. Kriesell conjectured that for every minimally $1$-tough graph the minimum degree $\delta(G)=2$. We show that in…

This paper is devoted to $C^2$ a priori estimates for strictly locally convex radial graphs with prescribed Weingarten curvature and boundary in space forms. By constructing two-step continuity process and applying degree theory arguments,…

In this paper, we classify all the finite groups $G$ such that the commuting graph $\Gamma_C(G)$, order-sum graph $\Gamma_{OS}(G)$ and non-inverse graph $\Gamma_{NI}(G)$ are minimally edge connected graphs. We also classify all the finite…

We consider a functional related with phase transition models in the Heisenberg group framework. We prove that level sets of local minimizers satisfy some density estimates, that is, they behave as "codimension one" sets. We thus deduce a…

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

We construct a one-parameter family of properly embedded minimal annuli in the Heisenberg group Nil_3 endowed with a left-invariant Riemannian metric. These annuli are not rotationally invariant. This family gives a vertical half-space…

Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…

The C-Planarity problem asks for a drawing of a $\textit{clustered graph}$, i.e., a graph whose vertices belong to properly nested clusters, in which each cluster is represented by a simple closed region with no edge-edge crossings, no…

We study the asymptotic Dirichlet problem for $f$-minimal graphs in Cartan-Hadamard manifolds $M$. $f$-minimal hypersurfaces are natural generalizations of self-shrinkers which play a crucial role in the study of mean curvature flow. In the…

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…

A graph H is common if the number of monochromatic copies of H in a 2-edge-coloring of the complete graph is asymptotically minimized by the random coloring. The classification of common graphs is one of the most intriguing problems in…

In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…