Pith. sign in

REVIEW 1 cited by

Ends of digraphs I: basic theory

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2009.03295 v1 pith:P6VQXOH4 submitted 2020-09-07 math.CO

classification math.CO
keywords endsgraphsdigraphdigraphslimitundirecteddirectionsedges
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Halin's grid theorem for digraphs

    math.CO 2024-12 conditional novelty 7.0 of 10

    Every infinite family of disjoint equivalent directed rays in a digraph contains a directed quarter-grid with those rays as vertical rays, with an analogous result for necklace-based ends.

Pith tools