Seminars & Colloquia Calendar

Download as iCal file

Graduate Student Combinatorics Seminar Sponsored by DIMACS

Automorphisms of Induced Subgraphs of Gn,p.

Keith Frankston

Location:  Hill 701
Date & time: Wednesday, 11 March 2020 at 12:15PM - 1:15PM

Abstract: The Erdos Rényi random graph (denoted Gn,p) is a random object on n vertices where each edge appears independently with probability p. We call a graph rigid if it has no non-trivial automorphisms. A classical result in random graph theory states that the probability that Gn,p is rigid goes to 1 (as n goes to infinity) for p(1-p)>>log(n)/n. In this talk we discuss what happens when we instead at look at induced subgraphs of Gn,p. We will show that almost surely any induced subgraph of sufficient size is rigid by proving 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.