Subgraph conditioning methodSpeaker: Chi-Ning
Title: Subgraph conditioning method
Date: 12 Feb 2018 5:30pm-7:00pm
Location: Pierce 320
Food: Indian food
Abstract: Subgraph conditioning method is a technique for characterizing a property in random graph model by conditioning on the number of small subgraphs. It mysteriously bypasses the obstacles encountered by naive analysis and results in many surprising results. In this talk, we will focus on a running example: random r-regular graph is asymptotic almost surely Hamiltonian for r>=3. We will start from the definition and properties of random regular graph model and only some background in provability is assumed.
- Chi-Ning’s notes: link.