A digraph is called ubiquitous if every digraph that contains vertex‐disjoint copies of for every also contains infinitely many vertex‐disjoint copies of . We characterise which digraphs with rays as underlying undirected graphs are ubiquitous.
No takes yet. Share an insight, caveat, or question.
Gut et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: