University of Cambridge > Talks.cam > Combinatorics Seminar > A hypergraph regularity method for generalised Turán problems

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

A hypergraph regularity method for generalised Turán problems

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

  • UserPeter Keevash (Queen Mary, London)
  • ClockThursday 24 January 2008, 14:30-15:30
  • HouseMR12.

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

Abstract not available

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.

Other lists

Project Access Cambridge Clinical Research Centre for Affective Disorders (C2:AD) Bullard Laboratories Tea Time Talks

Other talks

Single Cell Seminars (November) Can land rights prevent deforestation? Evidence from a large-scale titling policy in the Brazilian Amazon. MicroRNAs as circulating biomarkers in cancer Action Stations! Human Brain Development Modelled in a Dish Molecular mechanisms of cardiomyopathies in patients with severe non-ischemic heart failure Refugees and Migration Protein Folding, Evolution and Interactions Symposium Single Cell Seminars (August) Computing knot Floer homology
 

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