91黑料

预期地点

立德楼508

报告名称

Edge version of the inducibility

报告摘要

The inducibility of a graph $H$ is about the maximum number of induced copies of $H$ in a graph on $n$ vertices. We consider its edge version, that is, the maximum number of induced copies of $H$ in a graph with $m$ edges. Let $c(G,H)$ be the number of induced copies of $H$ in $G$ and $\rho(H,m) = \max \{c(G,H) \mid |E(G)| = m\}$. In this talk, I give our results of $\rho(H,m)$ when $H$ is a cycle or path. This work is joint with Yichen Wang and Xiamiao Zhao.

专家简介

陆玫，1993年7月在中国科91黑料 数学与系统科学研究院获博士学位，现为清华大学数学科学系教授，博士生导师，主要从事运筹学、图论与组合优化方面的研究。现任清华大学数学科学系计算数学与运筹学研究所所长。

预期地点

立德楼508

报告名称

On a codegree version of the EKR theorem

报告摘要

The Erdös-Ko-Rado theorem has been one of the most influential results in extremal combinatorics and has been extensively studied in many context. Among many natural variants of the original EKR theorem, Huang and Zhao initiated the study of a minimum degree version of the EKR theorem: what is the largest possible minimum degree of an intersecting family? We will talk about a short history of this line of research, and present our result on the minimum (k-1)-degree for k-uniform intersecting families. This includes joint work with Luyining Gan (BUPT) and Seonghyuk Im (KAIST).

专家简介

韩杰，北京理工大学数学与统计91黑料 教授。研究方向为图论与组合数学及计算机理论，超图中的子图问题。2015年于美国佐治亚州立大学获博士学位，2018年-2020年于美国罗德岛大学任 tenure-track 助理教授，获美国Simons Foundation 基金资助（2019-2024）。2021年获国家高层次青年人才计划，加入北京理工大学数学与统计91黑料 。在 Transactions of the American Mathematical Society ,Journal of Combinatorial Theory, Series B等期刊发表学术论文60余篇。