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

We prove that counting the analytic Brouwer degree of rational coefficient polynomial maps in $\operatorname{Map}(\mathbb C^d, \mathbb C^d)$ -- presented in degree-coefficient form -- is hard for the complexity class $\operatorname{\sharp…

Given a simple connected graph on $N$ vertices with size $|E|$ and degree sequence $d_{1}\leq d_{2}\leq ...\leq d_{N}$, the aim of this paper is to exhibit new upper and lower bounds for the additive degree-Kirchhoff index in closed forms,…

We prove that for every integer $d \ge 3$, the median eigenvalues of any graph of maximum degree $d$ are bounded above by $\sqrt{d-1}$. We also prove that, in three separate cases, the median eigenvalues of a graph of maximum degree $d$ are…

In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth. Furthermore, we also prove that graphs from this class are spanning subgraphs of graphs with minimum degree just slightly…

Let $k$ be a field, $Q$ a finite directed graph, and $kQ$ its path algebra. Make $kQ$ an $\NN$-graded algebra by assigning each arrow a positive degree. Let $I$ be a homogeneous ideal in $kQ$ and write $A=kQ/I$. Let $\QGr A$ denote the…

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 aim of this thesis is to derive new gradient estimates for parabolic equations. The gradient estimates found are independent of the regularity of the initial data. This allows us to prove the existence of solutions to problems that have…

A new generalization of the Browder's degree for the mappings of the type $(S)_+$ is presented. The main idea is rooted in the observation that the Browder's degree remains unchanged for the mappings of the form $A: Y\to X^*$, where $Y$ is…

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…

Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…

We consider the linearized Korteweg-de-Vries equa- tions, sometimes called Airy equation, on general metric graphs with edge lengths bounded away from zero. We show that pro- perties of the induced dynamics can be obtained by studying…

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…

Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…

We study the curvature-dimension inequality in regular graphs. We develop techniques for calculating the curvature of such graphs, and we give characterizations of classes of graphs with positive, zero, and negative curvature. Our main…

This paper investigates the class of k-universal finite graphs, a local analog of the class of universal graphs, which arises naturally in the study of finite variable logics. The main results of the paper, which are due to Shelah,…

We prove an asymptotic formula for the number of $k$-uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asymptotically equal to the number of $d$-regular $k$-uniform…

We study classes of graphs with bounded clique-width that are well-quasi-ordered by the induced subgraph relation, in the presence of labels on the vertices. We prove that, given a finite presentation of a class of graphs, one can decide…

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

The paper deals with the cohomological invariants of smooth and connected linear algebraic groups over an arbitrary field. More precisely, we study degree $2$ invariants with coefficients $\mathbb{Q}/\mathbb{Z}(1)$, that is invariants…

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…