BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Induced Poset Saturation - Maria Ivan (Cambridge)
DTSTART:20211111T143000Z
DTEND:20211111T153000Z
UID:TALK165802@talks.cam.ac.uk
CONTACT:HoD Secretary\, DPMMS
DESCRIPTION:Given a fixed poset $\\mathcal P$\, we say that a family $\\ma
 thcal F$ of subsets of $[n]$ is\n\\textit{$\\mathcal P$-free} if it does n
 ot contain an (induced) copy of$\\mathcal P$. And we say that $\\mathcal F
 $ is\n\\textit{$\\mathcal P$-saturated} if it is maximal $\\mathcal P$-fre
 e. How small can a $\\mathcal P$-saturated family be?\nThe smallest such s
 ize is the \\textit{induced saturation number} of $\\mathcal P$\, $\\text{
 sat}^*(n\, \\mathcal P)$.\nEven for very small posets\, the question of th
 e growth speed of $\\text{sat}^*(n\,\\mathcal P)$ seems\nto be hard. We pr
 esent background on this problem and some recent results.
LOCATION:MR12
END:VEVENT
END:VCALENDAR