清华主页 EN
导航菜单

On rainbow threshold | Research seminar in Discrete Mathematics

来源: 04-08

时间:2024-04-09 Tue 17:05-18:15

地点:ZOOM:787 662 9899 BIMSA

组织者:Benjamin Sudakov

主讲人:Jie Han Beijing Institute of Technology

Abstract

Solving a problem of Bell, Frieze and Marbach, we extend the recent breakthrough of Frankston,Kahn, Narayanan and Park to the rainbow setting.


Speaker Intro

Jie Han is a professor at the School of Mathematics and Statistics of Beijing Institute ofTechnology. He obtained his Ph.D. degree in 2015 at Georgia State University under thesupervision of Prof. Yi Zhao. He then spent his academic life at the University of Sao Paulo (Brazil)University of Birmingham (UK), University of Rhode lsland (USA), until he ioined BlT in 2022. Hisresearch interests are Extremal Combinatorics, Graph Theory and Theoretical Computer Science


返回顶部
相关文章
  • Uniform Turn density of hypergraphs | Research seminar in Discrete Mathematics

    AbstractIn the early 1980s, Erdos and Ss, initiated the study of the classical Turn problem with auniformity condition: the uniform Turn density of a hypergraph H is the infimum over all d for whichany sufficiently large hypergraph with the property that all its linear-size subhypergraphs havedensity at least d contains H. In particular, they raised the questions of determining the uniformTurn ...

  • Tight Hamilton cycles with high discrepancy | Research seminar in Discrete Mathematics

    AbstractIn discrepancy theory, the basic question is whether a structure can be partitioned in a balancedway, or if there is always some discrepancy no matter how the partition is made.in the context ofgraph theory, a well-studied question is whether for a given host graph, any 2-colouring of its edgesmust contain a specified subgraph "with high discrepancy", meaning that within this subgraph o...