University of Birmingham > Talks@bham > Reading Group in Combinatorics and Probability > Well quasi orderings of trees

Well quasi orderings of trees

Add to your list(s) Download to your calendar using vCal

  • UserTassio
  • ClockWednesday 17 January 2018, 14:00-15:00
  • HouseLRC.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.