Related papers: On degrees of birational mappings

We introduce a model for a growing random graph based on simultaneous reproduction of the vertices. The model can be thought of as a generalisation of the reproducing graphs of Southwell and Cannings and Bonato et al to allow for a random…

We study the complexity of the itineraries of injective piecewise contracting maps on the interval. We prove that for any such map the complexity function of any itinerary is eventually affine. We also prove that the growth rate of the…

It follows from a classical result of Jordan that every tree with maximum degree at most $r$ containing a vertex set labeled by $[n]$, has a single-edge cut which separates two subsets $A,B \subset [n]$ for which $\min\{|A|,|B|\} \ge…

We prove that a minor-closed class of graphs has bounded layered pathwidth if and only if some apex-forest is not in the class. This generalises a theorem of Robertson and Seymour, which says that a minor-closed class of graphs has bounded…

A good edge-labelling of a simple graph is a labelling of its edges with real numbers such that, for any ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. Say a graph is good if it admits a good…

In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…

An old result of M\"uller and R\"odl states that a countable graph $G$ has a subgraph whose vertices all have infinite degree if and only if for any vertex labeling of $G$ by positive integers, an infinite increasing path can be found. They…

Let us call a simple graph on $n\geq 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n$, and in fact for every $n\geq 2$ if we assume the Riemann…

We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbour receive different…

We give a further development of the Aichinger-Moosbauer calculus of functional degrees of maps between commutative groups. For any fixed given commutative groups $A$ and $B$, we compute the largest possible finite functional degree that a…

Every graph of size $q$ (the number of edges) and minimum degree $\delta$ is hamiltonian if $q\le\delta^2+\delta-1$. The result is sharp.

We prove asymptotically optimal bounds on the number of edges a graph $G$ must have in order that any $r$-colouring of $E(G)$ has a colour class which contains every $D$-degenerate graph on $n$ vertices with bounded maximum degree. We also…

We prove that in dimensions not equal to 4, 5, or 7, the homology and homotopy groups of the classifying space of the topological group of diffeomorphisms of a disk fixing the boundary are finitely generated in each degree. The proof uses…

We give simple necessary and sufficient conditions on projective schemes over a field k for asymptotic limits of the growth of all graded linear series of a fixed Kodaira-Iitaka dimension to exist. We also give necessary and sufficient…

We prove almost sure convergence of the maximum degree in an evolving graph model combining a growing number of local choices with sublinear preferential attachment. At each step in the growth of the graph, a new vertex is introduced. Then…

We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Kir\'aly and Arman and Tsaturian and to improve upper bounds on the maximum number of…

Let F : P^N --> P^N be a dominant rational map. The dynamical degree of F is the quantity d_F = lim (deg F^n)^(1/n). When F is defined over a number field, we define the arithmetic degree of an algebraic point P to be a_F(P) = limsup…

Since the end of the XIXth century, we know that each birational map of the complex projective plane is the product of a finite number of quadratic birational maps of the projective plane; this motivates our work which essentially deals…

The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…

For the partition graph $G_n$, whose vertices are the partitions of $n$ and whose edges correspond to elementary unit transfers between parts, we develop a degree theory with three levels: exact value theory, exact profile theory, and…