相关论文: Brouwer degree for Kazdan-Warner equations on a co…

We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…

We show the direct applicability of the Brouwer fixed point theorem for the existence of equilibrium points and periodic solutions for differential systems on general domains satisfying geometric conditions at the boundary. We develop a…

In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.

The degree-diameter problem asks for the maximum number of vertices in a graph with maximum degree $\Delta$ and diameter $k$. For fixed $k$, the answer is $\Theta(\Delta^k)$. We consider the degree-diameter problem for particular classes of…

In this paper, we study the mean curvature flow of graphs with Neumann boundary condition. The main aim is to use the maximum principle to get the boundary gradient estimate for solutions. In particular, we obtain the corresponding…

We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs…

In this paper we study the relationship of the Brouwer degree of a vector field with the dynamics of the induced flow. Analogous relations are studied for the index of a vector field. We obtain new forms of the Poincar% \'{e}-Hopf theorem…

We determine the decomposition numbers for the Brauer and walled Brauer algebra in characteristic zero in terms of certain polynomials associated to cap and curl diagrams (recovering a result of Martin in the Brauer case). We consider a…

Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $\chi$-boundedness but for minimum…

As an application of Brouwer's fixed-point theorem we prove that a continuously differentiable convex function with gradient of constant norm is an affine mapping. It is a first-order characterization of affine mappings among continuously…

The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity…

There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are…

Motivated by the scaling limits of the connected components of the configuration model, we study uniform connected multigraphs with fixed degree sequence $\mathcal{D}$ and with surplus $k$. We call those random graphs…

This note gives necessary and sufficient conditions for a sequence of non-negative integers to be the degree sequence of a connected simple graph. This result is implicit in a paper of Hakimi. A new alternative characterisation of these…

We prove a full measurable version of Vizing's theorem for bounded degree Borel graphs, that is, we show that every Borel graph $\mathcal{G}$ of degree uniformly bounded by $\Delta\in \mathbb{N}$ defined on a standard probability space…

The Turan bound is a famous result in graph theory, which relates the independence number of an undirected graph to its edge density. Also the Caro-Wei inequality, which gives a more refined bound in terms of the vertex degree sequence of a…

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…

Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…

Cross-ratio degrees count configurations of points $z_1,\ldots, z_n \in \mathbb{P}^1$ satisfying $n - 3$ cross-ratio constraints, up to isomorphism. These numbers arise in multiple contexts in algebraic and tropical geometry, and may be…