Title: The Turán number of blow-ups of graphs Speaker: Liying Kang (Shanghai University) Abstract： The blow-up of a graph H is the graph obtained from replacing each edge in H by a clique of the same[详细]
2020-11-10题目：Erdos distinct distances problem in hyperbolic surfaces 主讲人：路志鹏（University of Göttingen） 摘要：Erdos distinct distances problem asks for the lower bound of number of distinct distances between pairs[详细]
2020-11-23题目：Erdos distinct distances problem in hyperbolic surfaces 主讲人：路志鹏（University of Göttingen） 摘要：Erdos distinct distances problem asks for the lower bound of number of distinct distances between pairs[详细]
2020-11-23报告题目: A decomposition problem for random hypergraphs 报告人：彭兴（安徽大学） 时间：2020-11-17, 19:00-20:00 地点：腾讯会议，ID: 868 758 954 摘要: In this talk, we will discuss the problem of decomposing random r-uniform[详细]
2020-11-15题目：On a generalization of the Euler totient function 主讲人：翟文广（中国矿业大学（北京）） 摘要：J. Kaczorowski defined the generalized Euler totient function $\varphi(n, F)$ corresponding to a polynomial Euler product[详细]
2020-11-12题目：Distinct distances on hyperbolic surfaces 主讲人：孟宪昌（University of Göttingen） 摘要：Erdos in 1946 asked the question of finding the minimal number of distinct distances among any $N$ points in[详细]
2020-11-30题目：Distinct distances on hyperbolic surfaces 主讲人：孟宪昌（University of Göttingen） 摘要：Erdos in 1946 asked the question of finding the minimal number of distinct distances among any $N$ points in[详细]
2020-11-30