Ubiquity of oriented rays
Abstract
Call a digraph H ubiquitous if every digraph D that contains k vertex-disjoint copies of H for every k ∈ N also contains infinitely many vertex-disjoint copies of H. We characterise which digraphs whose underlying undirected graph is a ray are ubiquitous.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.