Related papers: On ubiquity problems in infinite digraphs

A variety V is said to be coherent if any finitely generated subalgebra of a finitely presented member of V is finitely presented. It is shown here that V is coherent if and only if it satisfies a restricted form of uniform deductive…

We prove that an equivalent condition for a uniform space to be coverable is that the images of the natural projections in the fundamental inverse system are uniformly open in a certain sense. As corollaries we (1) obtain a concrete way to…

We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses decidability of HD0L periodicity problem, which was recently proved in papers of F.Durand and I.Mitrofanov.

A graph $G$ is said to be $\preceq$-ubiquitous, where $\preceq$ is the minor relation between graphs, if whenever $\Gamma$ is a graph with $nG \preceq \Gamma$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \preceq \Gamma$, where…

We prove an extension to the classical continuity theorem in rough paths. We show that two $p$-rough paths are close in all levels of iterated integrals provided the first $\lfl p \rfl$ terms are close in a uniform sense. Applications…

An embedded manifold is dual defective if its dual variety is not a hypersurface. Using the geometry of the variety of lines through a general point, we characterize scrolls among dual defective manifolds. This leads to an optimal bound for…

There are many interesting dynamical systems in which degenerate invariant tori appear. We give conditions under which these degenerate tori have stable and unstable invariant manifolds, with stable and unstable directions having arbitrary…

We show that Caratheodory's conjecture, on umbilical points of closed convex surfaces, may be reformulated in terms of the existence of at least one umbilic in the graphs of functions f: R^2-->R whose gradient decays uniformly faster than…

Let $\zeta$ be Euclidean norm of the degree sequence of a graph normalized by the graph size. We prove that when the vertices of a graph are randomly colored with $s$ colors such that the fraction of vertices in each color class is bounded…

For a graph $G$, let $f(G)$ be the largest integer $k$ for which there exist two vertex-disjoint induced subgraphs of $G$ each on $k$ vertices, both inducing the same number of edges. We prove that $f(G) \ge n/2 - o(n)$ for every graph $G$…

We resolve two problems of [Cameron, Praeger, and Wormald -- Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica 1993]. First, we construct a locally finite highly arc-transitive digraph with universal…

The continuity problem, i.e., the question whether effective maps between effectively given topological spaces are effectively continuous, is reconsidered. In earlier work it was shown that this is always the case, if the effective map also…

We prove that if $X$ is a topological space that admits Debreu's classical utility theorem (eg.\ $X$ is separable and connected, second countable, etc.), then order relations on $X$ satisfying milder completeness conditions can be…

Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…

We showed earlier that the level set function of a monotonic advancing front is twice differentiable everywhere with bounded second derivative. We show here that the second derivative is continuous if and only if the flow has a single…

Let S be an orientable surface of finite type. Using Pho-On's infinite unicorn paths, we prove the hyperfiniteness of orbit equivalence relations induced by the actions of the mapping class group of S on the Gromov boundaries of the arc…

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…

A set S of n points is 2-color universal for a graph G on n vertices if for every proper 2-coloring of G and for every 2-coloring of S with the same sizes of color classes as G has, G is straight-line embeddable on S. We show that the…

We prove a new generalisation of Ramsey's theorem by showing that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. From this, we also derive…

We consider several classes of intersection graphs of line segments in the plane and prove new equality and separation results between those classes. In particular, we show that: (1) intersection graphs of grounded segments and intersection…