Seminars & Colloquia Calendar

Download as iCal file

Graduate Student Combinatorics Seminar Sponsored by DIMACS

Automorphisms of Induced Subgraphs of G(n,1/2)

Keith Frankston - Rutgers University

Location:  GSL - Hill 701
Date & time: Wednesday, 30 October 2019 at 12:15PM - 1:15PM

Abstract: The Erd?s Rényi random graph (denoted G(n,1/2)) is a random object on n vertices where each edge appears independently with probability 1/2. We call a graph rigid if it has no non-trivial automorphisms. A classical result in random graph theory states that the probability that G(n,1/2) is rigid goes to 1 (as n goes to infinity). In this talk we discuss what happens when we look, not at G(n,1/2), but its induced subgraphs. We will show that almost surely any induced subgraph of size (1+?)n/2 is rigid by looking at a more general result.

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.