University of Cambridge > Talks.cam > Combinatorics Seminar > Induced posets

Induced posets

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

  • UserArès Méroueh (Cambridge)
  • ClockThursday 15 October 2015, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

We prove that for every partially ordered set P, there exists c(P), such that every family of subsets of [n] ordered by inclusion and which contains no induced copy of P, has LYM density bounded by c(P).

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity