login

Revision History for A097911

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Minimal order of a graph containing as induced subgraphs isomorphic copies of all graphs on n unlabeled nodes.
(history; published version)
#19 by Michael De Vlieger at Fri Jan 20 18:05:07 EST 2023
STATUS

proposed

approved

#18 by Michel Marcus at Fri Jan 20 17:54:59 EST 2023
STATUS

editing

proposed

Discussion
Fri Jan 20
18:04
Michael De Vlieger: Much better, thanks!
#17 by Michel Marcus at Fri Jan 20 17:54:52 EST 2023
LINKS

James Trimble, <a href="httpshttp://thesesdx.doi.org/10.5525/gla.acthesis.uk/83350/2/2023TrimblePhD.pdf">Partitioning algorithms for induced subgraph problems</a>, Ph.D. Thesis, Univ. of Glasgow (Scotland, 2023), 134.

STATUS

proposed

editing

Discussion
Fri Jan 20
17:54
Michel Marcus: doi, ok ?
#16 by Michael De Vlieger at Fri Jan 20 17:54:03 EST 2023
STATUS

editing

proposed

#15 by Michael De Vlieger at Fri Jan 20 17:54:01 EST 2023
LINKS

N. Noga Alon, <a href="https://doi.org/10.1007/s00039-017-0396-9">Asymptotically optimal induced universal graphs</a>, Geometric and Functional Analysis, 27(1):1-32, 2017.

J. James Trimble, <a href="https://arxiv.org/abs/2109.00075">Induced universal graphs for families of small graphs</a>, arXiv:2109.00075 [math.CO], 2021.

James Trimble, <a href="https://theses.gla.ac.uk/83350/2/2023TrimblePhD.pdf">Partitioning algorithms for induced subgraph problems</a>, Ph.D. Thesis, Univ. of Glasgow (Scotland, 2023), 134.

STATUS

approved

editing

#14 by Alois P. Heinz at Tue Nov 09 07:31:14 EST 2021
STATUS

proposed

approved

#13 by Michel Marcus at Tue Nov 09 07:07:58 EST 2021
STATUS

editing

proposed

Discussion
Tue Nov 09
07:30
Alois P. Heinz: thanks ... A348638 recycled ...
#12 by Michel Marcus at Tue Nov 09 07:07:55 EST 2021
COMMENTS

16 <= a(7) <= 18 (Trimble, 2021) . - James Trimble, Nov 09 2021

STATUS

proposed

editing

#11 by James Trimble at Tue Nov 09 07:07:19 EST 2021
STATUS

editing

proposed

#10 by James Trimble at Tue Nov 09 07:06:32 EST 2021
COMMENTS

A graph that contains as induced subgraphs isomorphic copies of all graphs in a family F is called induced universal for F. - _James Trimble_, Nov 09 2021

16 <= a(7) <= 18 (Trimble, 2021) - _James Trimble_, Nov 09 2021

Discussion
Tue Nov 09
07:07
James Trimble: Done. Thanks Michel.