Related papers: Kazdan-Warner equation on graph in the negative ca…

Let $K_n^h=(V,\binom{V}{h})$ be the complete $h$-uniform hypergraph on vertex set $V$ with $|V|=n$. Baranyai showed that $K_n^h$ can be expressed as the union of edge-disjoint $r$-regular factors if and only if $h$ divides $rn$ and $r$…

We consider the regularity of the extremal solution of the nonlinear eigenvalue problem (S)_\lambda \qquad {rcr} -\Delta u + c(x) \cdot \nabla u &=& \frac{\lambda}{(1-u)^2} \qquad {in $ \Omega$}, u &=& 0 \qquad {on $ \pOm$}, where $ \Omega…

For a graph $F$, a graph $G$ is \emph{$F$-free} if it does not contain an induced subgraph isomorphic to $F$. For two graphs $G$ and $H$, an \emph{$H$-coloring} of $G$ is a mapping $f:V(G)\rightarrow V(H)$ such that for every edge $uv\in…

In this note, we prove an existence result for generalized Kazdan-Warner equations on compact Riemannian manifolds by using the flow approach or the upper and lower solution method. In addition, we give a prior estimate for this type…

The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. Recently Gagarin and Zverovich showed that, for a graph $G$ with maximum degree $\Delta(G)$…

A novel geometric method is applied to the problem of describing traveling wave solutions of the generalized Korteweg--de Vries (gKdV) equation in the form $$ u_t + u_{xxx} + a(u)u_x = 0, $$ where $a(u)$ is a smooth function characterizing…

Let $\Omega \Subset \mathbb R^n$ and a continuous function $\mathrm H$ be given, where $n,k,N \in \mathbb N$. For $p\in [1,\infty]$, we consider the functional \[ \mathrm E_p(u) := \big\| \mathrm H \big(\cdot,u,\mathrm D u, \ldots, \mathrm…

Let $H$ and $G$ be two finite graphs. Define $h_H(G)$ to be the number of homomorphisms from $H$ to $G$. The function $h_H(\cdot)$ extends in a natural way to a function from the set of symmetric matrices to $\mathbb{R}$ such that for…

We show that a smooth radially symmetric solution $u$ to the graphic Willmore surface equation is either a constant or the defining function of a half sphere in ${\mathbb R}^3$. In particular, radially symmetric entire Willmore graphs in…

The Erd\"os-Hajnal conjecture states that for every graph $H$, there exists a constant $\delta(H) > 0$ such that every graph $G$ with no induced subgraph isomorphic to $H$ has either a clique or a stable set of size at least…

We initiate the study of the finiteness condition $\int_{\Omega}u(x)^{-\beta}\,dx\leq C(\Omega,\beta)<+\infty$ where $\Omega\subseteq{\mathbb{R}}^n$ is an open set and $u$ is the solution of the Saint Venant problem $\Delta u=-1$ in…

The Erdos-Hajnal conjecture says that for every graph $H$ there exists $c>0$ such that $\max(\alpha(G),\omega(G))\ge n^c$ for every $H$-free graph $G$ with $n$ vertices, and this is still open when $H=C_5$. Until now the best bound known on…

A proper vertex colouring of a graph $G$ is referred to as conflict-free if in the neighbourhood of every vertex some colour appears exactly once, while it is called $h$-conflict-free if there are at least $h$ such colours for each vertex…

Let $G = (V,E)$ be a graph, and for each $e \in E(G)$, let $L_e$ be a list of real numbers. Let $w:E(G) \to \cup_{e \in E(G)}L_e$ be an edge weighting function such that $w(e) \in L_e$ for each $e \in E(G)$, and let $c_w$ be the vertex…

The chromatic vertex (resp.\ edge) stability number ${\rm vs}_{\chi}(G)$ (resp.\ ${\rm es}_{\chi}(G)$) of a graph $G$ is the minimum number of vertices (resp.\ edges) whose deletion results in a graph $H$ with $\chi(H)=\chi(G)-1$. In the…

We consider a continuous coercive Hamiltonian $H$ on the cotangent bundle of the compact connected manifold $M$ which is convex in the momentum. If $u_\lambda:M\to\mathbb R$ is the viscosity solution of the discounted equation $$ \lambda…

We consider the damped-driven KdV equation $$ \dot u-\nu{u_{xx}}+u_{xxx}-6uu_x=\sqrt\nu \eta(t,x), x\in S^1, \int u dx\equiv \int\eta dx\equiv0, $$ where $0<\nu\le1$ and the random process $\eta$ is smooth in $x$ and white in $t$. For any…

For two graphs $F$ and $H$, the relative Tur\'{a}n number $\mathrm{ex}(H,F)$ is the maximum number of edges in an $F$-free subgraph of $H$. Foucaud, Krivelevich, and Perarnau \cite{FKP} and Perarnau and Reed \cite{PR} studied these…

The well-known Cluster Vertex Deletion problem (CVD) asks for a given graph $G$ and an integer $k$ whether it is possible to delete a set $S$ of at most $k$ vertices of $G$ such that the resulting graph $G-S$ is a cluster graph (a disjoint…

We prove new results on the existence of positive radial solutions of the elliptic equation $-\Delta u= \lambda h(|x|,u)$ in an annular domain in $\mathbb{R}^{N}, N\geq 2$. Existence of positive radial solutions are determined under the…