|
| |
|
|
A348638
|
|
Minimal order of a graph containing as induced subgraphs isomorphic copies of all trees on n unlabeled nodes.
|
|
1
|
| |
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
a(n) is the minimal order of an induced universal graph for the family of trees on n vertices.
a(9) <= 15 and a(10) <= 18 (Trimble, 2021).
|
|
|
LINKS
|
Table of n, a(n) for n=1..8.
James Trimble, Induced universal graphs for families of small graphs, arXiv:2109.00075 [math.CO], 2021.
James Trimble, Partitioning algorithms for induced subgraph problems, Ph.D. Thesis, Univ. of Glasgow (Scotland, 2023), 134.
|
|
|
CROSSREFS
|
Cf. A004401, A097911.
Sequence in context: A186290 A061979 A050748 * A079051 A226047 A066935
Adjacent sequences: A348635 A348636 A348637 * A348639 A348640 A348641
|
|
|
KEYWORD
|
nonn,more
|
|
|
AUTHOR
|
James Trimble, Nov 09 2021
|
|
|
STATUS
|
approved
|
| |
|
|
