University of Cambridge > Talks.cam > Combinatorics Seminar > Judicious partitions of hypergraphs

Judicious partitions of hypergraphs

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

  • UserJohn Haslegrave (University of Cambridge)
  • ClockThursday 10 March 2011, 15:00-16:00
  • HouseMR12.

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

Judicious partitioning problems on hypergraphs seek to find partitions of the vertex set such that a given parameter is reasonably large for every part. Typically we ask for the maximum value which can be acheived for any hypergraph. Bollobas and Thomason conjectured that for a particular problem on r-uniform hypergraphs the worst case is given by the complete hypergraph on 2r-1 vertices; we prove this conjecture in the case r=3.

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-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity