Zeyu Zheng, Rutgers University

Abstract

One of the most famous results in extremal graph theory is Turàn's theorem, which leads to a series of remarkable results which we now consider Turàn-type problems. The study of the planar Turàn Number ex_P(n,H), initiated by Chris Dowden in 2016, is a variant of a Turàn-type problems in planar graphs. In this talk, we discuss a useful tool in this field, and several sharp bounds we found using a similar technique. This talk is based on a joint work with Professor Ervin Györi and Xianzhi Wang.