Related papers: CMC Graphs With Planar Boundary in $\mathbb{H}^{2}…
Almost $4$-connectivity is a weakening of $4$-connectivity which allows for vertices of degree three. In this paper we prove the following theorem. Let $G$ be an almost $4$-connected triangle-free planar graph, and let $H$ be an almost…
In this note we construct smooth bounded domains $\Omega \subset \mathbb R^2$, other than disks, for which the overdetermined problem $$ \left\{ \begin{alignedat}{2} \Delta u + \lambda u &= 0 &\qquad& \text{ in } \Omega, \newline u &= b…
In a recent paper by a superset of the authors it was proved that for every primitive 3-constrained space $\Gamma$ of finite diameter $\delta$ from Cherlin's catalogue of metrically homogeneous graphs, there exists a finite family $\mathcal…
A planar orthogonal drawing $\Gamma$ of a planar graph $G$ is a geometric representation of $G$ such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and no two…
A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…
Liebmann's Theorem asserts that a compact, connected, convex surface with constant mean curvature (CMC) in the Euclidean space must be a totally umbilical sphere. In this article we extend Liebmann's result to hypersurfaces with boundary.…
Let $G$ be a planar graph with no two 3-cycles sharing an edge. We show that if $\Delta(G)\geq 9$, then $\chi'_l(G) = \Delta(G)$ and $\chi''_l(G)=\Delta(G)+1.$ We also show that if $\Delta(G)\geq 6$, then $\chi'_l(G)\leq\Delta(G)+1$ and if…
In this paper we consider a set $E\subset\Omega$ with prescribed mean curvature $f\in C(\Omega)$ and Euclidean Lipschitz boundary $\partial E=\Sigma$ inside a three-dimensional contact sub-Riemannian manifold $M$. We prove that if $\Sigma$…
The classical Dirac theorem asserts that every graph $G$ on $n$ vertices with minimum degree $\delta(G) \ge \lceil n/2 \rceil$ is Hamiltonian. The lower bound of $\lceil n/2 \rceil$ on the minimum degree of a graph is tight. In this paper,…
Let $\Omega \subset \mathbb{R}^n$ be a convex domain and let $f:\Omega \rightarrow \mathbb{R}$ be a positive, subharmonic function (i.e. $\Delta f \geq 0$). Then $$ \frac{1}{|\Omega|} \int_{\Omega}{f dx} \leq \frac{c_n}{ |\partial \Omega| }…
We investigate the structure of isometric subgraphs of hypercubes (i.e., partial cubes) which do not contain finite convex subgraphs contractible to the 3-cube minus one vertex $Q^-_3$ (here contraction means contracting the edges…
Let G be a plane graph of girth at least five. We show that if there exists a 3-coloring phi of a cycle C of G that does not extend to a 3-coloring of G, then G has a subgraph H on O(|C|) vertices that also has no 3-coloring extending phi.…
For an oriented graph $G$, the oriented discrepancy problem concerns the existence of a spanning subgraph of $G$ with a large imbalance between its forward and backward edge orientations. Freschi and Lo proved the Dirac-type Hamilton cycle…
In this paper we describe all rotation $H$-hypersurfaces in $H^n \times R$ and use them as barriers to prove existence and characterization of certain vertical $H$-graphs and to give symmetry and uniqueness results for compact…
We prove that for every $n \ge 2$, there exists a pseudoconvex domain $\Omega \subset \mathbb{C}^n$ such that $\mathfrak{c}^0(\Omega) \subsetneq \mathfrak{c}^1(\Omega)$, where $\mathfrak{c}^k(\Omega)$ denotes the core of $\Omega$ with…
Let $\Omega$ be a planar Jordan domain and $\alpha>0$. We consider double-dome-like surfaces $\Sigma(\Omega,t^{\alpha})$ over $\overline{\Omega}$ where the height of the surface over any point $x\in\overline{\Omega}$ equals…
Let $G$ be a graph of order $n$. A classical upper bound for the domination number of a graph $G$ having no isolated vertices is $\lfloor\frac{n}{2}\rfloor$. However, for several families of graphs, we have $\gamma(G) \le…
Given $r \geq 3$, we prove that there exists $\lambda >0$ depending only on $r$ so that if $G$ is a metric graph of rank $r$ with metric entropy $1$, then there exists a proper subgraph $H$ of $G$ with metric entropy at least $\lambda$.…
We show that for any $d\ge 2$ and $\Delta>0$ there exists $\eta>0$ such that the following holds: Let $G$ be an $n$-vertex graph with at least $\Omega(n^2)$ edges and let $H$ be an $n$-vertex $d$-degenerate graph with maximum degree at most…
Given a mean-convex domain $\Omega\subset \R^n$ with boundary of class $C^{2,1}$, we provide a representation formula for a boundary integral of the type \[ \int_{\partial \Omega} f(k(x)) \, d\mathcal{H}^{n-1} \] where $k\geq 0$ is the mean…