Related papers: Brouwer degree for Chern-Simons Higgs models on fi…

We study existence and various behaviors of topological multivortices solutions of the relativistic self-dual Maxwell-Chern-Simons-Higgs system. We first prove existence of general topological solutions by applying variational methods to…

Let $\Omega$ be a flat torus and $G$ be the green's function of $-\Delta$ on $\Omega$. One intriguing mystery of $G$ is how the number of its critical points is related to blowup solutions of certain PDEs. In this article we prove that for…

Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in…

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the…

We consider an asymptotically linear Schr\"odinger equation $-\Delta u + V(x)u = \lambda u + f(x,u), \ x\in R^N$, and show that if $\lambda_0$ is an isolated eigenvalue for the linearization at infinity, then under some additional…

The \emph{graph realization problem} is to find for given nonnegative integers $a_1,\dots,a_n$ a simple graph (no loops or multiple edges) such that each vertex $v_i$ has degree $a_i.$ Given pairs of nonnegative integers…

In this paper, we consider the decomposition of multigraphs under minimum degree constraints and give a unified generalization of several results by various researchers. Let $G$ be a multigraph in which no quadrilaterals share edges with…

The independent set on a graph $G=(V,E)$ is a subset of $V$ such that no two vertices in the subset have an edge between them. The MIS problem on $G$ seeks to identify an independent set with maximum cardinality, i.e. maximum independent…

For a graph $H$, the {\em extremal number} $ex(n,H)$ is the maximum number of edges in a graph of order $n$ not containing a subgraph isomorphic to $H$. Let $\delta(H)>0$ and $\Delta(H)$ denote the minimum degree and maximum degree of $H$,…

Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$,…

Let $n \equiv 0\, (\, \text{mod } 3\,)$ and $H_{n, n/3}^2$ be the 3-graph of order $n$, whose vertex set is partitioned into two sets $S$ and $T$ of size $\frac{1}{3}n+1$ and $\frac{2}{3}n -1$, respectively, and whose edge set consists of…

Recently Chase determined the maximum possible number of cliques of size $t$ in a graph on $n$ vertices with given maximum degree. Soon afterward, Chakraborti and Chen answered the version of this question in which we ask that the graph…

We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…

This article concerns with the existence of multiple positive solutions for the following logarithmic Schr\"{o}dinger equation $$ \left\{ \begin{array}{lc} -{\epsilon}^2\Delta u+ V(x)u=u \log u^2, & \mbox{in} \quad \mathbb{R}^{N}, \\…

The Multicut problem asks for a minimum cut separating certain pairs of vertices: formally, given a graph $G$ and demand graph $H$ on a set $T\subseteq V(G)$ of terminals, the task is to find a minimum-weight set $C$ of edges of $G$ such…

Given a finite simple undirected graph $G$, let $T_1(G)$ denote the subset of vertices of $G$ such that every vertex of $T_1(G)$ belongs to at least one subgraph isomorphic to a graph obtained by connecting a single vertex to two vertices…

An \emph{s-graph} is a graph with two kinds of edges: \emph{subdivisible} edges and \emph{real} edges. A \emph{realisation} of an s-graph $B$ is any graph obtained by subdividing subdivisible edges of $B$ into paths of arbitrary length (at…

We consider, on a connected metric graph $\mathcal{G}$, a family of nonlinear Schr\"odinger equations $$ -u'' + W_n(x) u + \lambda_n u = \rho_n(x)|u|^{p-2}u, \quad n \in \mathbb{N}. \qquad (*) $$ We assume that $p > 2$, $(W_n)$, $(\rho_n)…

Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex…

We extend to the infinite dimensional context the link between two completely different topics recently highlighted by the authors: the classical eigenvalue problem for real square matrices and the Brouwer degree for maps between oriented…