Related papers: Existence results for Kazdan-Warner type equations…

This paper investigates a boundary-value problem for the Korteweg-de Vries (KdV) equation on a star-graph structure. We develop a unified framework introducing the notion of $s$-compatibility, which generalizes classical compatibility…

In this paper, we study the nonlinear Schr\"{o}dinger equation $$ -\Delta u+(V(x)- \frac{\rho}{(|x|^2+1)})u=f(x,u) $$ on the lattice graph $\mathbb{Z}^N$ with $N\geq 3$, where $V$ is a bounded periodic potential and $0$ lies in a spectral…

We consider the following logarithmic Schr\"{o}dinger equation $$ -\Delta u+h(x)u=u\log u^{2} $$ on a locally finite graph $G=(V,E)$, where $\Delta$ is a discrete Laplacian operator on the graph, $h$ is the potential function. Different…

We show that every cubic graph on $n$ vertices contains a spanning subgraph in which the number of vertices of each degree deviates from $\frac{n}{4}$ by at most $\frac{1}{2}$, up to three exceptions. This resolves the conjecture of Alon…

A $K_r$-factor of a graph $G$ is a collection of vertex-disjoint $r$-cliques covering $V(G)$. We prove the following algorithmic version of the classical Hajnal--Szemer\'edi Theorem in graph theory, when $r$ is considered as a constant.…

We consider an evolution problem associated to the Kazdan-Warner equation on a closed Riemann surface $(\Sigma,g)$ \begin{align*} -\Delta_{g}u=8\pi\left(\frac{he^{u}}{\int_{\Sigma}he^{u}{\rm d}\mu_{g}}-\frac{1}{\int_{\Sigma}{\rm…

The degree of a based graph is the number of essential nonbasepoint vertices after generic perturbation. Hatcher--Vogtmann's degree theorem states that the subcomplex of Auter space of graphs of degree at most d is (d-1)-connected. We…

We study the Kazdan-Warner equation on canonically compactifiable graphs. These graphs are distinguished as analytic properties of Laplacians on these graphs carry a strong resemblance to Laplacians on open pre-compact manifolds.

The Chen-Lih-Wu Conjecture states that each connected graph with maximum degree $\Delta\geq 3$ that is not the complete graph $K_{\Delta+1}$ or the complete bipartite graph $K_{\Delta,\Delta}$ admits an equitable coloring with $\Delta$…

Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…

We study some semi-linear equations for the $(m,p)$-Laplacian operator on locally finite weighted graphs. We prove existence of weak solutions for all $m\in\mathbb{N}$ and $p\in(1,+\infty)$ via a variational method already known in the…

A graph $G$ is called \emph{claw-o-heavy} if every induced claw ($K_{1,3}$) of $G$ has two end-vertices with degree sum at least $|V(G)|$ in $G$. For a given graph $R$, $G$ is called \emph{$R$-f-heavy} if for every induced subgraph $H$ of…

An $H_n$-factor of a graph $G$ is defined to be a spanning subgraph $F$ of $G$ such that each vertex has degree belonging to the set $\{1,3,5,...,2n-1,2n\}$ in $F$. In this paper, we investigate $H_n$-factors of graphs by using Lov\'asz's…

We present a systematic study of entire symmetric solutions $u:R^n\rightarrow R^m$ of the vector Allen-Cahn equation $\Delta u-W_u(u)=0, x \in R^n$, where $W:R^m\rightarrow R$ is smooth, symmetric, nonnegative with a finite number of zeros…

We study discontinuous solutions of the monomial equation $\frac{1}{n!}\Delta_h^nf(x)=f(h)$. In particular, we characterize the closure of their graph, $\bar{G(f)}^{\mathbb{R}^2}$, and we use the properties of these functions to present a…

We study the Dirichlet problem of the following discrete infinity Laplace equation on unbounded subgraphs \begin{equation*} \Delta_{\infty}u(x):=\inf_{y\sim x}u(y)+\sup_{y\sim x}u(y)-2u(x)=f(x). \end{equation*} For the homogeneous case…

We consider the stationary semilinear Schr\"odinger equation $-\Delta u + a(x) u = f(x,u)$, $u\in H^1(\R^N)$, where $a$ and $f$ are continuous functions converging to some limits $a_\infty>0$ and $f_\infty=f_\infty(u)$ as $|x|\to\infty$. In…

Ore's Theorem states that if $G$ is an $n$-vertex graph and every pair of non-adjacent vertices has degree sum at least $n$, then $G$ is Hamiltonian. A $[3]$-graph is a hypergraph in which every edge contains at most $3$ vertices. In this…

The study of the existence of hamiltonian cycles in a graph is a classic problem in graph theory. By incorporating toughness and spectral conditions, we can consider Chv\'{a}tal's conjecture from another perspective: what is the spectral…

We consider a the minimum k-way cut problem for unweighted graphs with a size bound s on the number of cut edges allowed. Thus we seek to remove as few edges as possible so as to split a graph into k components, or report that this requires…