All Questions
1 question
23
votes
1
answer
1k
views
Universal graph
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?
- 45k