Add to ORKGA well-known conjecture of Erdős states that, given an infinite graph G and sets A,B ⊆ V (G), there exists a family of disjoint A–B paths P together with an A–B separator X consisting of a choice of one vertex from each path in P. There is a natural extension of this conjecture in which A, B and X may contain ends as well as vertices. We prove this extension for sets A and B that can be separated by countably many vertices or ends, and for sets A and B which have disjoint closures in the end topology of G
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
AbstractA short proof of the classical theorem of Menger concerning the number of disjoint AB-paths ...
In this paper a sort of end concept for directed graphs is introduced and examined. Two one-way infi...
AbstractErdős conjectured that, given an infinite graph G and vertex sets A,B⊆V(G), there exist a se...
AbstractErdős conjectured that, given an infinite graph G and vertex sets A,B⊆V(G), there exist a se...
A well-known conjecture of Erd}os states that, given an innite graph G and sets A;B V (G), there ex...
AbstractErdős conjectured that, given an infinite graph G and vertex sets A,B⊆V(G), there exist a se...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
AbstractThe countable case of a conjecture of Erdös is settled: let G = (V, E) be a directed or undi...
AbstractFor a set A of pairwise disjoint sets of ends of an infinite graph, we define the concepts o...
AbstractFor a set A of pairwise disjoint sets of ends of an infinite graph, we define the concepts o...
AbstractLet A and B be two sets of ends of an infinite graph, having the property that every element...
AbstractLet A be a family of sets of ends of an infinite graph, having the property that every eleme...
Partial answers are given to a problem of Erdös about the extension of a version of Menger's theorem...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
AbstractA short proof of the classical theorem of Menger concerning the number of disjoint AB-paths ...
In this paper a sort of end concept for directed graphs is introduced and examined. Two one-way infi...
AbstractErdős conjectured that, given an infinite graph G and vertex sets A,B⊆V(G), there exist a se...
AbstractErdős conjectured that, given an infinite graph G and vertex sets A,B⊆V(G), there exist a se...
A well-known conjecture of Erd}os states that, given an innite graph G and sets A;B V (G), there ex...
AbstractErdős conjectured that, given an infinite graph G and vertex sets A,B⊆V(G), there exist a se...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
AbstractThe countable case of a conjecture of Erdös is settled: let G = (V, E) be a directed or undi...
AbstractFor a set A of pairwise disjoint sets of ends of an infinite graph, we define the concepts o...
AbstractFor a set A of pairwise disjoint sets of ends of an infinite graph, we define the concepts o...
AbstractLet A and B be two sets of ends of an infinite graph, having the property that every element...
AbstractLet A be a family of sets of ends of an infinite graph, having the property that every eleme...
Partial answers are given to a problem of Erdös about the extension of a version of Menger's theorem...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a fin...
AbstractA short proof of the classical theorem of Menger concerning the number of disjoint AB-paths ...
In this paper a sort of end concept for directed graphs is introduced and examined. Two one-way infi...