|Title: On Turan Problems for Weakly Quasirandom 3-uniform Hypergraphs|
|Speaker: Christian Reiher of University Hamburg|
|Contact: Vojtech Rodl, Rodl@mathcs.emory.edu|
|Date: 2015-09-15 at 4:00PM|
In recent work, we found a new proof of a conjecture due to Erdnd Stating that large weakly quasirandom 3-uniform hypergraphs with density greater than 1/4 contain four vertices spanning at least three hyperedges. This was proved earlier by Glebov, Kral, and Volec using flag algebras and computers. The new proof is based on the hypergraph regularity method and gave rise to further developments some of which are surveyed in this talk. This is joint work with Vojtech Rodl and Mathias Schacht.
See All Seminars