Rose McCarty, Princeton University

Abstract

There are many classical constructions of graphs with arbitrarily large minimum degree and without big bicliques. A class of graphs is 𝛿-bounded if, essentially, it avoids all such constructions. We give an overview of this area and discuss a very recent theorem which is joint work with Xiying Du. The theorem says that for any such class, the minimum degree 𝛿 is at most triply exponential in the size of the largest balanced biclique. 

See: https://sites.google.com/view/rutgersdmseminar