Related papers: Kazdan-Warner equation on graph

For any fixed simple graph $H=(V,E)$ and any fixed $u>0$, we establish the leading order of the exponential rate function for the probability that the number of copies of $H$ in the Erd\H{o}s--R\'enyi graph $G(n,p)$ exceeds its expectation…

A solution to a problem of Erd\H{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d > a/b$, then $G$ is not necessarily $(c:d)$-choosable. The simplest case of another problem, stated by the same…

We consider in this paper an area functional defined on submanifolds of fixed degree immersed into a graded manifold equipped with a Riemannian metric. Since the expression of this area depends on the degree, not all variations are…

This survey describes some recent rigidity results obtained by the authors for the prescribed mean curvature problem on graphs $u : M \rightarrow \mathbb{R}$. Emphasis is put on minimal, CMC and capillary graphs, as well as on graphical…

Hamilton flows on K\"ahler manifold for which all trajectories are $H$-planar curves (complex analog of geodesics) are considered. These flows are called $H$-planar. The equation which has to obey the Hamiltonian of $H$-planar Hamilton flow…

Let $G$ be a graph with vertex set $V(G)$. Let $n$ and $k$ be non-negative integers such that $n + 2k \leq |V(G)| - 2$ and $|V(G)| - n$ is even. If when deleting any $n$ vertices of $G$ the remaining subgraph contains a matching of $k$…

We consider discrete one dimensional nonlinear equations and present the procedure of lifting them to Z-graded graphs. We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. In particular, we prove…

We study sharp $p$-variational inequalities for the Hardy-Littlewood maximal operator on complete graphs, answering in the affirmative a question by Feng Liu and Qingying Xue. We also use computational assistance to find sharp constants in…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

We investigate the multiplicity of solutions for a generalized poly-Laplacian system on weighted finite graphs and a generalized poly-Laplacian system with Dirichlet boundary value on weighted locally finite graphs, respectively, via the…

This work studies the dynamics of solutions to the sine-Gordon equation posed on a tadpole graph $G$ and endowed with boundary conditions at the vertex of $\delta$-type. The latter generalize conditions of Neumann-Kirchhoff type. The…

In this paper, we prove Liouville type theorems for stable solutions to the weighted fractional Lane-Emden system \begin{align*} (-\Delta)^s u = h(x)v^p,\quad (-\Delta)^s v= h(x)u^q, \quad u,v>0\quad \mbox{in }\;\mathbb{R}^N, \end{align*}…

This work is concerned with the study of a scalar delay differential equation \begin{equation*} z^{\prime\prime}(t)=h^2\,V(z(t-1)-z(t))+h\,z^\prime(t) \end{equation*} motivated by a simple car-following model on an unbounded straight line.…

An $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that $a\leq d_{H}(v)\leq b$ for each $v\in V(G)$. In this paper, we provide spectral conditions for the existence of an odd $[1,b]$-factor in a connected graph with minimum…

We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…

A solution to a problem of Erd\H{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d > a/b$, then $G$ is not necessarily $(c:d)$-choosable. Applying probabilistic methods, an upper bound for the…

For a graph $G$, the $\gamma$-graph of $G$, $G(\gamma)$, is the graph whose vertices correspond to the minimum dominating sets of $G$, and where two vertices of $G(\gamma)$ are adjacent if and only if their corresponding dominating sets in…

We develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1-Laplacian ?$\Delta_1$. The eigenvalue problem is to solve a nonlinear system involving a set valued function. In the study, we investigate the…

Albertson has defined the irregularity of a simple undirected graph $G=(V,E)$ as $ \irr(G) = \sum_{uv\in E}|d_G(u)-d_G(v)|,$ where $d_G(u)$ denotes the degree of a vertex $u \in V$. Recently, this graph invariant gained interest in the…

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…