Abstract
AbstractA 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
