比利时vs摩洛哥足彩
,
university of california san diego
****************************
math 269 - seminar in combinatorics
dr. sam spiro
rutgers university
the random turan problem
abstract:
let $g_{n,p}$ denote the random $n$-vertex graph obtained by including each edge independently and with probability $p$. given a graph $f$, let $\mathrm{ex}(g_{n,p},f)$ denote the size of a largest $f$-free subgraph of $g_{n,p}$. when $f$ is non-bipartite, the asymptotic behavior of $\mathrm{ex}(g_{n,p},f)$ is determined by breakthrough work done independently by conlon-gowers and by schacht, but the behavior for bipartite $f$ remains largely unknown.
we will discuss some recent developments that have been made for bipartite $f$, with a particular emphasis on the case of theta graphs. based on joint work with gwen mckinley.
january 14, 2025
2:00 pm
apm 7321
research areas
combinatorics****************************