MATH Seminar
Title: Regular subgraphs of 3-uniform hypergraphs |
---|
Seminar: Combinatorics |
Speaker: Domingos Dellamonica of Emory University |
Contact: Dwight Duffus, dwight@mathcs.emory.edu |
Date: 2010-09-17 at 4:00PM |
Venue: W306 |
Download Flyer |
Abstract: Every graph on n vertices with at least n edges necessarily contains a 2-regular subgraph (a cycle). It is much more difficult to determine how many edges are necessary for a graph to contain a k-regular subgraph and the best known bounds so far are due to Pyber, Rödl and Szemerédi. In this talk I will present our recent attempt to answer these type of questions in the setting of 3-uniform hypergraphs.\\ \\ (This research was partially done at the Banff workshop 2010 in collaboration with P. Haxell, T. Luczak, D. Mubayi, B. Nagle, Y. Person, V. Rödl, M. Schacht, J. Verstraete) |
See All Seminars