![]() |
![]() |
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 listsElectromagnetic Communications and Sensing Research Seminar Series Type the title of a new list here EPS - College Research and KT Support ActivitiesOther talksWaveform modelling and the importance of multipole asymmetry in Gravitational Wave astronomy Life : it’s out there, but what and why ? Counting cycles in planar graphs The tragic destiny of Mileva Marić Einstein Proofs of Turán's theorem TBA |