Seminars & Colloquia Calendar

Download as iCal file

Discrete Math

Generalized Turan-type problems for random graphs

Clara Shikhelman, Tel Aviv

Location:  Hill 705
Date & time: Monday, 08 October 2018 at 2:00PM - 3:00PM


For two fixed graphs \(T\) and \(H\), a positive integer \(n\) and a real number \(p in [0,1]\) let \(ex(G(n,p),T,H)\) be the random variable counting the maximum number of copies of \(T\) in an \(H\)-free subgraph of the random graph \(G(n,p)\). In this talk we discuss this variable, its phase transition as a function of \(p\) and its connection to the deterministic function counting the maximum number of copies of \(T\) in an \(H\)-free graph on \(n\) vertices.

Based on joint works with N. Alon, A. Kostochka and W. Samotij.

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.