Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
A connected (and infinite) graph $U$ will be called $n$-universal if any connected graph with degree $\leqslant n$ admits an embedding in $U$.
Is there a 3-universal graph with bounded degree?
A graph $U$ will be called $n$-universal if any connected graph with degree $\leqslant n$ admits an embedding in $U$.
