• Start Date: September 23, 2020
  • Event Start Time: 12:15 PM
  • Event End Time: 1:15 PM
  • Seminar Series: Graduate Combinatorics Seminar
  • Presenter(s): Corrine Yap - Rutgers University
  • Event Location: Online Event
  • Event Additional Info: <p>Presented via Zoom:&nbsp;<a href="https://rutgers.zoom.us/j/98441409199">https://rutgers.zoom.us/j/98441409199</a></p> <p>&nbsp;</p> <p>Password: 715004</p> <p>&nbsp;</p> <p>See:&nbsp;<a href="https://sites.math.rutgers.edu/~qcd2/GCS.html" target="_blank">https://sites.math.rutgers.edu/~qcd2/GCS.html</a></p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p>
  • Presentation Type: Stand Alone Presentation
  • Abstract:

    I will introduce a probabilistic technique called dependent random choice, which allows us to analyze dense graphs and find many small sets of vertices with large common neighborhoods. We'll discuss applications of this tool to Turán-type problems where we want to find an isomorphic or homeomorphic copy of a fixed subgraph inside a larger graph, and Ramsey problems where we want to find a monochromatic subgraph inside an edge-coloring of a larger graph.