For countably infinite graphs you can take the Rado Graph, which contains all countable graphs (even as induced subgraphs). For higher cardinals, see this paper of Shelah.
Tony Huynh
- 32.1k
- 11
- 112
- 187