Colloquium Abstracts

Date/Time/Location: Thursday Oct 5, 2017 from 3:00-3:50pm in BAC 219

Speaker/Affiliation: Jie Ma, University of Science and Technology of China

Title: From counting lines to counting subgraphs


Given n points in the plane, how many straight lines can one add between pairs of points such that there is no triple of lines intersecting each other? The analog of this problem in graph theory provided a rich field for research, which remains to lie in the core of the extremal combinatorics even today. In this talk, we will give a brief introduction to some well-know results in this field and then discuss a generalization which recently receives considerable attentions:  given two graphs T and H, to find the maximum number of T-copies in an n-vertex H-free graph.  The talk will assume no prior knowledge of the topic and a broad audience  (graduate students of general mathematical background, etc) are warmly welcome to come.