MATH Seminar
| Title: A problem of Erdos and Sós on 3-graphs |
|---|
| Seminar: Combinatorics |
| Speaker: Jan Volec of University of Warwick |
| Contact: Vojtech Rodl, rodl@mathcs.emory.edu |
| Date: 2013-09-23 at 4:00PM |
| Venue: MSC W301 |
| Download Flyer |
| Abstract: We show that for every epsilon > 0 there exist delta > 04 and natural number n_0 such that every 3-uniform hypergraph on n >= n_0 vertices with the property that every k-vertex subset, where k is at least delta*n, induces at least (1/4 + epsilon)*(k choose 3) edges, contains K4- as a subgraph, where K4- is the 3-uniform hypergraph on 4 vertices with 3 edges. This question was originally raised by Erdos and Sos. The constant 1/4 is the best possible. |
See All Seminars