Seminars & Colloquia Calendar

Download as iCal file

Discrete Math

The Random Turán Problem for Bipartite Graphs

Sam Spiro - Rutgers University

Location:  Hill Center Room 705
Date & time: Monday, 26 September 2022 at 2:00PM - 3:00PM

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 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 ex(G_{n,p},F) was determined in breakthrough work independently by Conlon-Gowers and by Schacht.  Much less is known when F is bipartite.  In this talk we will survey the known bounds on ex(G_{n,p},F) when F is bipartite, as well as the general techniques used for these problems.  We will also discuss the random Turán problem for r-partite r-uniform hypergraphs as time permits.

Special Note to All Travelers

Directions: map and driving directions. If you need information on public transportation, you may want to check the New Jersey Transit page.

Unfortunately, cancellations do occur from time to time. Feel free to call our department: 848-445-6969 before embarking on your journey. Thank you.