SUSTech Discrete Mathematics Seminar

Logo

This is the homepage of the SUSTech Discrete Mathematics Seminar at the Department of Mathematics at SUSTech.

Past Talks

2024-05-23

Some recent results and open questions on polynomial graphs

Speaker: Felix Lazebnik (University of Delaware)
Room: College of Science M1001
Time: 10:00 - 11:00
Tencent Meeting: 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.

tags: