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

  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

Judicious partitions of hypergraphs

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Online & Room SG1, Alison Richard Building, 7 West Road, Cambridge Dept. of Chemistry, U203 FW11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

Chemical strategies for biomolecule functionalisation, and biomaterial conjugation When Programmes Disagree About Programmes: Code Poetry and the Problem of Programme–Programme Communication The Imagined Conflict: On Science and God Welfare Reform and the Imperative of Cooperation Cambridge RNA Club - ONLINE Title to be confirmed
 

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