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

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

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.

Other lists

dddd EPS - College Research and KT Support Activities Particle Physics Seminars

Other talks

FENL: an ISE to mitigate analogue micro-architectural leakage EV Charging Security at the Physical-Layer Algebraic and combinatorial decompositions of Fuchsian groups Intriguing Properties of Adversarial ML Attacks in the Problem Space Sublattice Groups Accurate and efficient numerical methods for molecular dynamics and data science using adaptive thermostats
 

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