![]() |
![]() |
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 listsType the title of a new list here IRLab Seminars: Robotics, Computer Vision & AI Type the title of a new list hereOther talksUltrafast, all-optical, and highly efficient imaging of molecular chirality Modelling uncertainty in image analysis. Hodge Theory: Connecting Algebra and Analysis Geometry of alternating projections in metric spaces with bounded curvature Perfect matchings in random sparsifications of Dirac hypergraphs TBC |