Judicious partitions of hypergraphs

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

• John Haslegrave (University of Cambridge)
• Thursday 10 March 2011, 15:00-16:00
• MR12.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.