Universal graphs and induced-universal graphs

@article{Graham1990UniversalGA,
  title={Universal graphs and induced-universal graphs},
  author={Fan Chung Graham},
  journal={Journal of Graph Theory},
  year={1990},
  volume={14},
  pages={443-454}
}
We construct graphs that contain all bounded-degree trees on n vertices as induced subgraphs and have only cn edges for some constant c depending only on the maximum degree. In general, we consider the problem of determining the graphs, so-called universal graphs (or induceduniversal graphs), with as few vertices and edges as possible having the property… CONTINUE READING