Ubiquity in graphs II: Ubiquity of graphs with nowhere-linear end structure

arXiv1809.00602MaRDI QIDQ6306166FDOQ6306166

Christian Elbracht, Max F. Pitz, Karl Heuer, Maximilian Teegen, Nathan Bowler, J. Pascal Gollin, Joshua Erde

Publication date: 3 September 2018

Abstract: A graph $G$ is said to be $preceq$-ubiquitous, where $preceq$ is the minor relation between graphs, if whenever $Gamma$ is a graph with $nGpreceqGamma$ for all $ninmathbbN$, then one also has $alep{h}_{0}GpreceqGamma$, where $alphaG$ is the disjoint union of $alpha$ many copies of $G$. A well-known conjecture of Andreae is that every locally finite connected graph is $preceq$-ubiquitous. In this paper we give a sufficient condition on the structure of the ends of a graph~$G$ which implies that $G$ is $preceq$-ubiquitous. In particular this implies that the full grid is $preceq$-ubiquitous.

Mathematics Subject Classification ID

Infinite graphs (05C63) Graph minors (05C83)

This page was built for publication: Ubiquity in graphs II: Ubiquity of graphs with nowhere-linear end structure

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