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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

A problem of Erdos and Sos on 3-graphs

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Imagine2027 https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon ATC Seminar rooms 6A&B, Addenbrooke’s

Other talks

Morning Tea and Coffee Tea and Coffee Break Reproducibility In Astrophysical Simulations: The AGORA Initiative and a 14-Year Human Experiment (In Memory of Joel Primack) Cooperation in Nature Talk title TBC The role of radiation in cancer care: a spotlight on cancers of the oesophagus, head and neck
 

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