Seminar Details
Embedding Spanning Trees in the Random Graph
- Start Date: February 18, 2026
- Event Start Time: 12:15 PM
- Event End Time: 1:15 PM
- Seminar Series: Graduate Combinatorics Seminar
- Presenter(s): Caleb Fong - Rutgers University
- Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
- Presentation Type: Stand Alone Presentation
- Abstract:
Understanding the random graph threshold for "containing H as a subgraph" is not hard when H is a fixed graph. In contrast, when H is a spanning subgraph, the question rapidly becomes more interesting (and difficult!). Some standard examples include H = Hamilton cycle, or H = perfect matching. In this talk, we will consider the case H = T_n (a spanning tree on n vertices) and survey some of the existing work on the problem.