Renyi Video PortalVIDEO PORTAL

Nearly tight bounds for MaxCut in hypergraphs

Description of video

Date: 8/28/25
Speaker :Oliver Janzer

EuroComb25

Conferences

Keywords

    Recipient of the European Prize in

    Combinatorics -

    Nearly tight bounds for MaxCut in hypergraphs

    Oliver Janzer

    Joint work with Julien Portier

    Downloads

    Related videos

    00:52:00

    Chromatic, homomorphism blowup threshold and beyond

    Hong Liu

    EuroComb25

    on 8/26/25
    00:57:00

    The Erdős-Szekeres problem: Convexity, color avoidance, and total domination

    Cosmin Pohoata

    EuroComb25

    on 8/28/25
    00:52:00

    Stability of large cuts in random graphs

    Wojciech Samotij

    EuroComb25

    on 8/26/25