University of Cambridge > Talks.cam > Combinatorics Seminar > Induced Poset Saturation

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Induced Poset Saturation

Download to your calendar using vCal

  • UserMaria Ivan (Cambridge)
  • ClockThursday 11 November 2021, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact HoD Secretary, DPMMS .

Given a fixed poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is \textit{$\mathcal P$-free} if it does not contain an (induced) copy of$\mathcal P$. And we say that $\mathcal F$ is \textit{$\mathcal P$-saturated} if it is maximal $\mathcal P$-free. How small can a $\mathcal P$-saturated family be? The smallest such size is the \textit{induced saturation number} of $\mathcal P$, $\text{sat}$. Even for very small posets, the question of the growth speed of $\text{sat}(n,\mathcal P)$ seems to be hard. We present background on this problem and some recent results.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Monday Mechanics Seminars (DAMTP) Lecture Room 1, Dept. of Engineering (Trumpington St) Level 5 seminar room, LMB

Other talks

title and abstract tba (joint seminar with Spectral Geometry in the Clouds) Using Light for Cancer Detection Group Work Zooming in on the assembly of galaxies in the early Universe Atmospheric Methane - rise, surge, and ongoing post-surge growth. Can we mitigate the rise, and can anything be done to reduce emissions? Title to be confirmed
 

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