Algebra & Combinatorics Seminar

Turán theorems for even cycles in random hypergraph

  • 演讲者:Felix Lazebnik(特拉华大学)

  • 时间:2024-05-23 10:00-11:00

  • 地点:理学院大楼M1001,腾讯会议 ID: 766 511 815


In this talk I will describe the ideas behind  1) a new lower bound on  Turan number of 14-cycle, due to A. Terlep and J. Williford;

2)  a new proof for the lower bound on the girth of graphs CD(k, q), due to V. Taranchuk;  3)  a construction of polynomial graphs with small automorphism group and its corollaries, due to V. Taranchuk and myself.  At the end,  several related open questions will be mentioned.