Erfei Yue: On saturation number of posets and graphs

For a given combinatorial object (graph, hypergraph, poset, and so on) $P$, an object is called $P$-saturated, if it does not contain a copy of $P$, and any enlarge of it will break this condition. The classical Turán number focus on the maximum size of a saturated object. On the other hand, it is also interesting to ask the saturation number, which is the minimum size of a $P$-saturated object. In this talk, we will introduce some result about saturation number on posets and graphs.

Of course with Zoom:

Meeting ID
833 1758 0018

Invite Link https://us06web.zoom.us/j/83317580018?pwd=1lh6qG2Kwg93dm6G0nb8wAxIlRUEjF.1

Passcode:  364380