University of Cambridge > Talks.cam > Combinatorics Seminar > Constructions of Turán systems that are tight up to a multiplicative constant

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹ️ Information

Constructions of Turán systems that are tight up to a multiplicative constant

Download to your calendar using vCal

  • UserOleg Pikhurko (Warwick)
  • ClockThursday 19 March 2026, 14:30-15:30
  • HouseMR12.

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

The Turán density t(s,r) is the asymptotically smallest edge density of an r-graph for which every set of s vertices contains at least one edge. The question of estimating this function received a lot of attention over decades of attempts. A trivial lower bound is t(s,r)\ge 1/{s\choose s−r). In the early 1990s, de Caen conjectured that t(r+1,r) grows faster than O(1/r) and offered 500 Canadian dollars for resolving this question.

I will give an overview of this area and present a construction disproving this conjecture by showing more strongly that for every integer R there is C such that t(r+R,r)\le C/{r+R\choose R}, that is, the trivial lower bound is tight for every fixed R up to a multiplicative constant C=C®.

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

Language Acquisition and Processing Research Cluster SBR Graduate Talks Cambridge University Engineering Department.

Other talks

Title to be confirmed Online Causal Inference Seminar Title to be confirmed Afternoon Break Evolution: Inevitable or Remarkable? Discussion II
 

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