Speaker: Mao Dingjia, PhD student in the Probability and Combinatorics Program at the University of California, Irvine, under the supervision of Asaf Ferber.

Date: September 4, 2025

Time: 09:00-09:50 am

Location: C717, Mingde Building, Shandong University

Sponsor: School of Mathematics, Shandong University

Abstract:

We prove that for each d≥2, the union of a d-regular graph with a uniformly random 2-factor on the same vertex set is Hamiltonian with high probability. This resolves a conjecture by Draganic and Keevash for all values ofd.

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/205770.htm