English

Ends of digraphs I: basic theory

Combinatorics 2020-09-08 v1

Abstract

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 edges; these are crucial for obtaining the end space of a digraph as a natural (inverse) limit of its finite contraction minors. As our main result in this first paper of our series we show that the notion of directions of an undirected graph, a tangle-like description of its ends, extends to digraphs: there is a one-to-one correspondence between the `directions' of a digraph and its ends and limit edges. In the course of this we extend to digraphs a number of fundamental tools and techniques for the study of ends of graphs, such as the star-comb lemma and Schmidt's ranking of rayless graphs.

Keywords

Cite

@article{arxiv.2009.03295,
  title  = {Ends of digraphs I: basic theory},
  author = {Carl Bürger and Ruben Melcher},
  journal= {arXiv preprint arXiv:2009.03295},
  year   = {2020}
}

Comments

20 pages, 4 figures

R2 v1 2026-06-23T18:22:15.160Z