“…For graphs that are not topological‐minor‐ubiquitous, see [2]. Very recently, Carmesin provided an example of a locally finite graph that is not minor‐ubiquitous in [8]. We remark that this does not contradict Andreae's conjecture as the graph is not connected.…”
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.
“…For graphs that are not topological‐minor‐ubiquitous, see [2]. Very recently, Carmesin provided an example of a locally finite graph that is not minor‐ubiquitous in [8]. We remark that this does not contradict Andreae's conjecture as the graph is not connected.…”
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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.