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

We present a generalized notion of degree for rotating solutions of planar systems. We prove a formula for the relation of such degree with the classical use of Brouwer's degree and obtain a twist theorem for the existence of periodic…

The degree sequence of a graph is the sequence of the degrees of its vertices. If $\pi$ is a degree sequence of a graph $G$, then $G$ is a realization of $\pi$ and $G$ realizes $\pi$. Determining when a sequence of positive integers is…

Let $\Omega \subset \mathbb{R}^N$, $N \geq 2$, be a smooth bounded domain. We consider the boundary value problem \begin{equation} \label{Plambda-Abstract-ch3} \tag{$P_{\lambda}$} -\Delta u = c_{\lambda}(x) u + \mu |\nabla u|^2 + h(x)\,,…

Let claw be the graph $K_{1,3}$. A graph $G$ on $n\geq 3$ vertices is called \emph{o}-heavy if each induced claw of $G$ has a pair of end-vertices with degree sum at least $n$, and 1-heavy if at least one end-vertex of each induced claw of…

Let $r\geq 3$ be an integer and $G$ be a graph. Let $\delta(G), \Delta(G)$, $\alpha(G)$ and $\mu(G)$ denotes minimum degree, maximum degree, independence number and matching number of $G$, respectively. Recently, Caro, Davila and Pepper…

We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…

The "slope-number" of a graph $G$ is the minimum number of distinct edge slopes in a straight-line drawing of $G$ in the plane. We prove that for $\Delta\geq5$ and all large $n$, there is a $\Delta$-regular $n$-vertex graph with…

The wave equation on network is defined by $\partial_{tt}u=\Delta_{G}u+g(u)$, where $u\in\mathbb{R}^{n}$ and the graph Laplacian $\Delta_{G}$ is an operator on functions on $n$ vertices. We suppose that $g:\mathbb{R}^{n}\rightarrow…

For oriented connected closed manifolds of the same dimension, there is a transitive relation: $M$ dominates $N$, or $M \ge N$, if there exists a continuous map of non-zero degree from $M$ onto $N$. Section 1 is a reminder on the notion of…

The degree-based entropy of a graph is defined as the Shannon entropy based on the information functional that associates the vertices of the graph with the corresponding degrees. In this paper, we study extremal problems of finding the…

We prove the finiteness of the number of blow-analytic equivalence classes of embedded plane curve germs for any fixed number of branches and for any fixed value of $\mu'$ ---a combinatorial invariant coming from the dual graphs of good…

Let $G=(V,E)$ be a bipartite graph embedded in a plane (or $n$-holed torus). Two subgraphs of $G$ differ by a {\it $Z$-transformation} if their symmetric difference consists of the boundary edges of a single face---and if each subgraph…

In this work, we study the existence and multiplicity of solutions for the following problem \begin{equation}\label{probaa1} \left\{ \begin{aligned} -(\Delta)_{p}^{s} u + V(x)|u|^{p-2}u &= \lambda f(u),&x\in\Omega; u&=0,&x\in…

The Colour Refinement algorithm is a classical procedure to detect symmetries in graphs, whose most prominent application is in graph-isomorphism tests. The algorithm and its generalisation, the Weisfeiler-Leman algorithm, evaluate local…

We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any $n$-vertex, $d$-regular graph $G$ and any graph $H$ (possibly with loops), \[\hom(G,H) \leq \max\left\lbrace\hom(K_{d,d}, H)^{\frac{n}{2d}},…

This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…

This paper establishes an existence theory for discrete second-order boundary value problems on non-uniform time grids using the upper and lower solution method. We consider difference equations of the form $u^{\Delta\Delta}(t_{i-1}) +…

In 1984, Erd\H{o}s and Simonovits conjectured the following: given a bipartite graph $H$, there exist constants $\beta, C > 0$ such that any graph $G$ on $n$ vertices and $pn^2\geq C \mathrm{ex}(n, H)$ edges contains at least $\beta…

Let $\mathscr G:= (V,E)$ be a weighted locally finite graph whose finite measure $\mu$ has a positive lower bound. Motivated by wide interest in the current literature, in this paper we study the existence of classical solutions for a class…

A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same queue are nested. The \emph{queue number} of a graph is the…