COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Induced Poset SaturationAdd to your list(s) Download to your calendar using vCal - Maria Ivan (Cambridge)
- Thursday 11 November 2021, 14:30-15:30
- MR12.
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} This talk is part of the Combinatorics Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsDio-Gandhi equations ee287's list Humanitarian events## Other talksRandom feature neural networks learn Black-Scholes type PDEs without curse of dimensionality On super Plucker embedding and cluster algebras Technoscience in the tropics: public agricultural research and environmental imaginaries in Brazil A Trillion Trees - A trillion reasons to thrive! Reconstructing CO2 change on 100 to 100 million year timescales |