University of Cambridge > > Combinatorics Seminar > A problem of Erdos and Sos on 3-graphs

A problem of Erdos and Sos on 3-graphs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Andrew Thomason.

We show that for every positive epsilon there exist positive delta and n_0 such that every 3-uniform hypergraph on n>=n_0 vertices with the property that every k-vertex subset, where k>=deltan, 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. Joint work with Dan Kral and Jan Volec.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity