You are here

Computer Science/Discrete Mathematics Seminar II

Regularity lemma and its applications Part I

Szemeredi's regularity lemma is an important tool in modern graph theory. It and its variants have numerous applications in graph theory, which in turn has applications in fields such as theoretical computer science and number theory. The first part of the talk covers some basic knowledge about the regularity lemma and some of its applications, such as the graph removal lemma. I will also discuss some recent works related to the removal lemma. 

Featuring

Fan Wei

Speaker Affiliation

Member, School of Mathematics

Affiliation

Mathematics

Event Series

Date & Time
December 03, 2019 | 10:30am12:30pm

Location

Simonyi Hall 101

Categories