Printable PDF
Department of Mathematics,
Department of Mathematics,
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****************************
