相关论文: On ubiquity problems in infinite digraphs
In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…
The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…
We study graph-directed conjugate functional equations on the unit interval indexed by the complete digraph with self-loops on two vertices. We focus on the singularity and regularity of the solutions for compatible systems of weak…
Two $a{-}b$ paths in a graph $G$ are order-compatible if their common vertices occur in the same order when travelling from $a$ to $b$. Suppose a graph contains an infinite number $\delta$ of edge-disjoint $a{-}b$ paths. G.A. Dirac asked…
We show that any graph that contains k edge-disjoint double rays for any k>0 contains also infinitely many edge-disjoint double rays. This was conjectured by Andreae in 1981.
In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…
The finite satisfiability problem of two-variable logic extended by a linear order successor and a preorder successor is shown to be undecidable.
Halin [1965] proved that if a graph has $n$ many pairwise disjoint rays for each $n$ then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic…
We study the Dirichlet problem of the following discrete infinity Laplace equation on unbounded subgraphs \begin{equation*} \Delta_{\infty}u(x):=\inf_{y\sim x}u(y)+\sup_{y\sim x}u(y)-2u(x)=f(x). \end{equation*} For the homogeneous case…
The (A,D) duality pairs play crucial role in the theory of general relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems…
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…
We prove that a surjective isometry between the unit spheres of two uniform algebras is extended to a surjective real-linear isometry between the uniform algebras. It provides the first positive solution for Tingley's problem on a Banach…
We show that all geodesic rays in the uniform infinite half-planar quadrangulation (UIHPQ) intersect the boundary infinitely many times, answering thereby a recent question of Curien. However, the possible intersection points are sparsely…
We prove several unique continuation results for biharmonic maps between Riemannian manifolds.
The topic of this paper is related to the well-known notion of unit distance graphs. Take a graph with its edges coloured red and blue such that for some $d$ it can be mapped into the plane with all vertices going to distinct points, the…
This is the sequel to our first paper concerning the balanced embedding of a non-compact complex manifold into an infinite-dimensional projective space. We prove the uniqueness of such an embedding. The proof relies on fine estimates of the…
A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…
We study the notions of continuous orbit equivalence and eventual one-sided conjugacy of finitely-aligned higher-rank graphs and two-sided conjugacy of row-finite higher-rank graphs with finitely many vertices and no sinks or sources. We…
We consider the following problem for oriented graphs and digraphs: Given an oriented graph (digraph) $G$, does it contain an induced subdivision of a prescribed digraph $D$? The complexity of this problem depends on $D$ and on whether $G$…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.