.png){kind=icon}
.png){kind=icon}
Return
Halin's Grid Theorem for Digraphs
.png){kind=icon}
PRE
AI
DOI：10.1002/jgt.70052.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Halin showed that every thick end of every graph contains an infinite grid. We extend Halin's theorem to digraphs. More precisely, we show that for every infinite family of disjoint equivalent out-rays there is a grid whose vertical rays are contained in . Furthermore, we obtain similar results for in-rays and necklaces.
Keywords:
end
Halin's grid theorem
infinite digraph
infinite grid