Palestra: Spanning subgraphs of random graphs
Palestrante: Rob Morris (IMPA)

Data: 29/04/2019 (segunda-feira)
Horário: 15:30h
Local: Sala B106-a (Bloco B - CT), Instituto de Matemática - UFRJ

Resumo: Let H be a graph on n vertices with maximum degree at most d. What is the threshold for the appearance of H in the Erdos-Renyi random graph G(n,p)? A well-known conjecture states that for every such H the threshold is at most n^{-2/(d+1)} (log n)^{O(1)}, and this has been proved for "nowhere dense" graphs by Riordan, and for graphs with bounded components by Johansson, Kahn and Vu. In this talk we will discuss some recent progress on this conjecture for odd values of d.