AbstractLet $H$ be a graph with $\chi(H) = r+1$. Simonovits's theorem states that, for every edge-critical graph $H$, the unique largest $H$-free subgraph of $K_n$ is its largest $r$-partite subgraph, provided that $n$ is sufficiently large. We show that the same holds with $K_n$ replaced by $G_{n,p}$ whenever $H$ is also strictly 2-balanced and $p \ge C_H n^{-1/m_2(H)} \log(n)^{1/(e(H)-1)}$ fo...
BIMSA-YMSC Number Theory Lunch SeminarOrganizers:Yong Suk Moon, Koji ShimizuSpeaker:Dali ShenTime:Thur., 12:00-13:00, Oct. 31, 2024Venue:BIMSA A4-1Title:Interlacing property and the Prime Number TheoremAbstract:The interlacing property of Beukers-Heckman, which is used to determine the finiteness of the monodromy groups of the higher-order hypergeometric equations, also appears in the proo...