Related papers: Translating graphs by mean curvature flow
A bridgeless graph $G$ is called $3$-flow-critical if it does not admit a nowhere-zero $3$-flow, but $G/e$ has for any $e\in E(G)$. Tutte's $3$-flow conjecture can be equivalently stated as that every $3$-flow-critical graph contains a…
A graph is \emph{fan-crossing free} if it has a drawing in the plane so that each edge is crossed by independent edges, that is the crossing edges have distinct vertices. On the other hand, it is \emph{fan-crossing} if the crossing edges…
We study some basic problems of translating solitons: the volume growth, generalized maximum principle, Gauss maps and certain functions related to the Gauss maps, finally we carry out point-wise estimates and integral estimates for the…
In this work we prove the existence and uniqueness of Killing graphs with prescribed mean curvature considering functions which are not necessarily constant along the flow lines of the Killing vector field.
A graph $G$ on $n$ vertices with $k$ edges is $t$-edge-balanced if every graph on $n$ vertices with $t$ edges is contained in exactly the same number of subgraphs of $K_n$ isomorphic to $G$. Despite the existence of infinite families of…
We show that any strictly mean convex translator of dimension $n\geq 3$ which admits a cylindrical estimate and a corresponding gradient estimate is rotationally symmetric. As a consequence, we deduce that any translating solution of the…
We establish the well-posedness of the nonlocal mean curvature flow of order ${\alpha\in(0,1)}$ for periodic graphs on $\mathbb{R}^n$ in all subcritical little H\"older spaces ${\rm h}^{1+\beta}(\mathbb{T}^n)$ with $\beta\in(0,1)$.…
In this paper we explore some results concerning the spread of the line and the total graph of a given graph. In particular, it is proved that for an $(n,m)$ connected graph $G$ with $m > n \geq 4$ the spread of $G$ is less than or equal to…
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…
In this paper, we study the $k$-Hessian curvature flow of noncompact spacelike hypersurfaces in Minkowski space. We first prove the existence of translating solutions with given asymptotic behavior. Then, we prove that for strictly convex…
Given a quasi-median graph $X$, the crossing graph $\Delta X$ and the contact graph $\Gamma X$ are natural hyperbolic models of $X$. In this article, we show that the asymptotic translation length in $\Delta X$ or $\Gamma X$ of an isometry…
The biplanar crossing number of a graph $G$ is the minimum number of crossings over all possible drawings of the edges of $G$ in two disjoint planes. We present new bounds on the biplanar crossing number of complete graphs and complete…
In this paper, we study the skew mean curvature flow. The results are threefold. First, we prove the global regularity of solutions with initial data which are small perturbations of planes in Sobolev spaces. Second, we prove the modified…
We study translators of the mean curvature flow in the product space $\h^2\times\r$. In $\h^2\times\r$ there are three types of translations: vertical translations due to the factor $\r$ and parabolic and hyperbolic translations from…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
A drawing of a graph is $k$-plane if every edge contains at most $k$ crossings. A $k$-plane drawing is saturated if we cannot add any edge so that the drawing remains $k$-plane. It is well-known that saturated $0$-plane drawings, that is,…
An open question in the theory of word-representable graphs for the past decade has been whether the line graph of a non-word-representable graph is always non-word-representable. By formulating an appropriate optimization problem for the…
A $\lambda$-translator is a surface in Euclidean space $\mathbb{R}^3$ whose Gauss curvature $K$ satisfies $K=\langle N, \vec{v} \rangle +\lambda$, where $N$ is the Gauss map, $\vec{v}$ is a fixed direction, and $\lambda \in \mathbb{R}$. In…
The complete transposition graph is defined to be the graph whose vertices are the elements of the symmetric group $S_n$, and two vertices $\alpha$ and $\beta$ are adjacent in this graph iff there is some transposition $(i,j)$ such that…
We study a Neumann problem related to the evolution of graphs under mean curvature flow in Riemannian manifolds endowed with a Killing vector field. We prove that in a particular case these graphs converge to a bounded minimal graph which…