Related papers: The Rado Path Decomposition Theorem

We give new decomposition theorems for classes of graphs that can be transduced in first-order logic from classes of sparse graphs -- more precisely, from classes of bounded expansion and from nowhere dense classes. In both cases, the…

We characterise the digraphs for which the multipaths, that is disjoint unions of directed paths, yield a matroid. For such graphs, called MP-digraphs, we prove that the Tutte polynomial of the multipath matroid is related to counting…

We give a combinatorial characterization of nodal curves admitting a natural d-th Abel map to their Picard scheme, for any positive integer d. "Natural" here means compatible with and independent of specialization.

Cylindrical algebraic decomposition (CAD) is a key tool for solving problems in real algebraic geometry and beyond. In recent years a new approach has been developed, where regular chains technology is used to first build a decomposition in…

Confirming a conjecture of Gy\'arf\'as, we prove that, for all natural numbers $k$ and $r$, the vertices of every $r$-edge-coloured complete $k$-uniform hypergraph can be partitioned into a bounded number (independent of the size of the…

A path cover of a graph is a set of disjoint paths so that every vertex in the graph is contained in one of the paths. The path cover number $p(G)$ of graph $G$ is the cardinality of a path cover with the minimum number of paths. Reed in…

We prove that any finite set of real numbers can be split into two parts, one part being highly non-additive and the other highly non-multiplicative.

We fully characterise the solvability of Rado equations inside linear combinations $a_{1}\U\oplus\dots\oplus a_{n}\U$ of idempotent ultrafilters $\U\in\beta\Z$ by exploiting known relations between such combinations and strings of integers.…

A well-known result of Burr, Erd\H{o}s and Spencer [Transactions of the American Mathematical Society, 1975] determines the $2$-colour Ramsey number for any sufficiently large collection of vertex-disjoint copies of a fixed graph $H$…

We observe that the characteristic cycle of a D-module gives bounds for decomposition numbers of intersection cohomology complexes.

By using nonstandard analysis, and in particular iterated hyper-extensions, we give foundations to a peculiar way of manipulating ultrafilters on the natural numbers and their pseudo-sums. The resulting formalism is suitable for…

Let $K_{\mathbb{N}}$ be the complete symmetric digraph on the positive integers. Answering a question of DeBiasio and McKenney, we construct a $2$-colouring of the edges of $K_{\mathbb{N}}$ in which every monochromatic path has density~$0$.…

We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. This comes as a corollary of a similar decomposition theorem…

A decomposition theorem for self-adjoint operators proved by Riesz and Lorch is extended to normal operators. This extension gives a new proof of the spectral theorem for unbounded normal operators.

The relation between Radon transform and orthogonal expansions of a function on the unit ball in $\RR^d$ is exploited. A compact formula for the partial sums of the expansion is given in terms of the Radon transform, which leads to…

We prove that every finite colouring of the plane contains a monochromatic pair of points at an odd distance from each other.

We generalize the classical de Rham decomposition theorem for Riemannian manifolds to the setting of geodesic metric spaces of finite dimension.

We give a motivated introduction to the theory of perverse sheaves, culminating in the Decomposition Theorem of Beilinson, Bernstein, Deligne and Gabber. A goal of this survey is to show how the theory develops naturally from classical…

Let $R=C[[t]]$ be the ring of power series over an algebraically closed field $C$ of characteristic zero. We show that each connection on a finite flat $R((x))$-module is the sum of a regular singular connection and a diagonalizable…

In this note we consider a Ramsey property of random $d$-regular graphs, $\mathcal{G}(n,d)$. Let $r\ge 2$ be fixed. Then w.h.p. the edges of $\mathcal{G}(n, 2r)$ can be colored such that every monochromatic component has size $o(n)$. On the…