### Upcoming Talks

#### Combinatorics Seminar

**Title:**Maximum likelihood estimators and subgraph counts in planar graphs

**Speaker:**Chris Wells (Auburn University)

**Date:**Friday 19th July 12:30

**Room:**AE06, Steyrergasse 30

**Abstract:**

How many copies of a graph $H$ can appear in a planar graph? We develop a technique which, for many graphs $H$, reduces this question to one of determining a "maximum likelihood estimator" of a graph related to $H$. For example, in the case of $H=C_{2m}$, we are led to the following question: which probability mass (on the edges of some big clique) maximizes the probability that $m$ independent samples from the mass form a copy of an $m$-cycle?