相关论文: Brouwer degree for Chern-Simons Higgs models on fi…

In this paper we study the existence of multiple solutions for the non-Abelian Chern--Simons--Higgs $(N\times N)$-system: \[ \Delta u_i=\lambda\left(\sum_{j=1}^N\sum_{k=1}^N K_{kj}K_{ji}\re^{u_j}\re^{u_k}-\sum_{j=1}^N…

In this paper, we consider the topological solutions to the skew-symmetric Chern-Simons system on lattice graphs: $$\left\{\begin{aligned} \Delta u &=\lambda\mathrm{e}^{\upsilon}(\mathrm{e}^{u}-1)+4\pi\sum\limits_{j=1}^{k_1}m_j\delta_{p_j},…

Let $G=(V,E)$ be a connected finite graph. We study the relativistic non-Abelian Chern-Simons-Higgs vortex equations on the graph $G$. We establish an existence result to the relativistic non-Abelian Chern-Simons-Higgs vortex equations.

Given a finite group $G$ and two unitary $G$-representations $V$ and $W$, possible restrictions on Brouwer degrees of equivariant maps between representation spheres $S(V)$ and $S(W)$ are usually expressed in a form of congruences modulo…

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…

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…

We consider the boundary value problem \begin{equation} - \Delta u = \lambda c(x)u+ \mu(x) |\nabla u|^2 + h(x), \qquad u \in H^1_0(\Omega) \cap L^{\infty}(\Omega), \leqno{(P_{\lambda})} \end{equation} where $\Omega \subset \R^N, N \geq 3$…

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…

The Erd\H{o}s-Simonovits stability theorem is one of the most widely used theorems in extremal graph theory. We obtain an Erd\H{o}s-Simonovits type stability theorem in multi-partite graphs. Different from the Erd\H{o}s-Simonovits stability…

Thanks to a connection between two completely different topics, the classical eigenvalue problem in a finite dimensional real vector space and the Brouwer degree for maps between oriented differentiable real manifolds, we were able to…

Suppose that $G=(V, E)$ is a connected locally finite graph with the vertex set $V$ and the edge set $E$. Let $\Omega\subset V$ be a bounded domain. Consider the following quasilinear elliptic equation on graph $G$ $$ \left \{…

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…

We consider graph classes $\mathcal G$ in which every graph has components in a class $\mathcal{C}$ of connected graphs. We provide a framework for the asymptotic study of $\lvert\mathcal{G}_{n,N}\rvert$, the number of graphs in…

In this paper, we consider a system of equations arising from the $\text{U}(1)\times \text{U}(1)$ Abelian Chern-Simons model \begin{eqnarray*}\left\{\begin{aligned} \Delta u…

Let $G=(V,E)$ be a finite graph and $\Delta$ be the usual graph Laplacian. Using the calculus of variations and a method of upper and lower solutions, we give various conditions such that the Kazdan-Warner equation $\Delta u=c-he^u$ has a…

We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…

A bipartite graph $G=(A,B,E)$ is ${\cal H}$-convex, for some family of graphs ${\cal H}$, if there exists a graph $H\in {\cal H}$ with $V(H)=A$ such that the set of neighbours in $A$ of each $b\in B$ induces a connected subgraph of $H$.…

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…

We consider the Schr\"odinger evolution on graph, i.e. solution to the equation $\partial_tu(t,\alpha)=i\sum_{\beta\in\mathcal{A}}L(\alpha,\beta)u(t,\beta)$, here $\mathcal{A}$ is the set of vertices of the graph and the matrix…

A graph is called \emph{claw-free} if it contains no induced subgraph isomorphic to $K_{1,3}$. Matthews and Sumner proved that a 2-connected claw-free graph $G$ is hamiltonian if every vertex of it has degree at least $(|V(G)|-2)/3$. At the…