![]() |
![]() |
University of Birmingham > Talks@bham > Reading Group in Combinatorics and Probability > Well quasi orderings of trees
Well quasi orderings of treesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Felix Joos. We look into the proof given by Kruskal from 1960 showing that the set of trees is well quasi ordered by the minor relation. This talk is part of the Reading Group in Combinatorics and Probability series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsJane Langdale Featured talks What's on in Physics?Other talksPrincipal Component Analysis of Quantum Materials Data: a Study in Augmented Intelligence Roots of random functions Variational Bayesian inference for point processes - a latent variable approach Outerspacial 2-complexes Prediction of Toric Code Topological Order from Rydberg Blockade |