Ubiquity of oriented rays

MaRDI QIDQ6508086arXivFDO

Authors Thilo Krill, Florian Reich

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63)

Abstract: Call a digraph $H$ emph{ubiquitous} if every digraph $D$ that contains $k$ disjoint copies of $H$ for every $kinmathbbN$ also contains infinitely many disjoint copies of $H$. We characterise which digraphs whose underlying undirected graph is a ray are ubiquitous.

This page was built for publication: Ubiquity of oriented rays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6508086)