相关论文: On ubiquity problems in infinite digraphs

We prove that every 3-connected 2-indivisible infinite planar graph has a 1-way infinite 2-walk. (A graph is 2-indivisible if deleting finitely many vertices leaves at most one infinite component, and a 2-walk is a spanning walk using every…

A digraph D is the pattern of a matrix M when D has an arc ij if and only if the ij-th entry of M is nonzero. Study the relationship between unitary matrices and their patterns is motivated by works in quantum chaology and quantum…

In this paper, we provide constructions to enumerate large numbers of CI-liaison classes. To this end, we introduce a liaison invariant and prove several results concerning it, notably that it commutes with hypersurface sections. This…

We prove that if a unimodular random graph is almost surely planar and has finite expected degree, then it has a combinatorial embedding into the plane which is also unimodular. This implies the claim in the title immediately by a theorem…

An oriented cycle is an orientation of a undirected cycle. We first show that for any oriented cycle $C$, there are digraphs containing no subdivision of $C$ (as a subdigraph) and arbitrarily large chromatic number. In contrast, we show…

If $f:[a,b]\to \mathbb{R}$, with $a<b$, is continuous and such that $a$ and $b$ are mapped in opposite directions by $f$, then $f$ has a fixed point in $I$. Suppose that $f:\mathbb{C}\to\mathbb{C}$ is map and $X$ is a continuum. We extend…

We characterise the slices of the category of graphs that are algebraically universal in terms of the structure of the slicing graph. In particular, we show that algebraic universality is obtained if, and only if, the slicing graph contains…

An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…

Halin showed that every thick end of every graph contains an infinite grid. We extend Halin's theorem to digraphs. More precisely, we show that for every infinite family $\mathcal{R}$ of disjoint equivalent out-rays there is a grid whose…

Consider an undirected graph whose edges are labeled invertibly in a group. When does every Eulerian trail from one fixed vertex to another have the same label? We give a precise structural answer to this question. Essentially, we show that…

We consider a class of doubly intermittent maps with critical points, unbounded derivative and regularly varying tails. Under some mild assumptions we prove the existence of a unique mixing absolutely continuous invariant measure and give…

We prove the convergence of a wide class of continued fractions, including generalized continued fractions over quaternions and octonions. Fractional points in these systems are not bounded away from the unit sphere, so that the iteration…

In a recent paper, it was shown that the problem of existence of a continuous map $X \to Y$ extending a given map $A \to Y$ defined on a subspace $A \subseteq X$ is undecidable, even for $Y$ an even-dimensional sphere. In the present paper,…

A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more…

We prove that every 2k-edge-connected graph with countably many edge-ends admits a k-arc-connected orientation, extending the previous result by Assem, Koloschin and Pitz that also assumed the hypothesis of the graph being locally finite.…

We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…

Sequential dichotomies of general delay equations are not uniform, which was proved two decades ago. This however reminds whether the countably infinite many dichotomies of a neutral equation have the sequential uniformity. In this paper,…

To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs…

Let $G$ be a locally compact totally disconnected topological group. Under a necessary mild assumption, we show that the irreducible unitary representations of $G$ are uniformly admissible if and only if the irreducible smooth…

We call a 2-partite digraph D homogeneous if every isomorphism between finite induced subdigraphs that respects the 2-partition of D extends to an automorphism of D that does the same. In this note, we classify the homogeneous 2-partite…