## Abstract 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 induced
Universality of A-mote Graphs
✍ Scribed by Roland Häggkvist; Pavol Hell
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 160 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An n-universal graph is a graph that contains as an induced subgraph a copy of every graph on n vertices It is shown that for each positive integer n > 1 there exists an n-universal graph G on 4" -1 vertices such that G IS a (v, k, A)-graph, and both G and its complement G are l-transitive in the se
We prove that there are solutions u ( ~, z ) of the heat equation ut = uxx such that every continuous function f : [a, b] + R can be uniformly approximated by a subsequence of u ( n , . ), n E IN.
planar graph that contains every planar graph as a minor.