Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex (Q2300160): Difference between revisions

The main result of this paper is a generalization of Lovász theorem to countable digraphs. Let \(D = (V,A)\) be a finite digraph. It follows from a theorem of Lovász that if \(r\in V\), then there is a spanning subdigraph \(E\) of \(D\) such that for every vertex \(v\) different from \(r\), the following quantities are equal: the local connectivity from \(r\) to \(v\in D\), the local connectivity from \(r\) to \(v\in E\) and the indegree of \(v\in E\).\par This paper is structured in four sections. In Section 1, the Lovász theorem, the author's theorem (a generalization of the Lovász theorem to countable digraphs) without proof, the proof methods that work for finite digraphs and the author's proof strategy for countable digraphs are presented. At the end of the first section, the author introduces some further notation. The author states key lemmas without proofs and derive the main result in Section 2. Section 3 is devoted to the proofs of the key lemmas and in Section 4, the author discusses some open problems.