login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A348638 Minimal order of a graph containing as induced subgraphs isomorphic copies of all trees on n unlabeled nodes. 1
1, 2, 3, 5, 7, 9, 11, 13 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 20 22:04 EDT 2023. Contains 361391 sequences. (Running on oeis4.)