Renyi Video PortalVIDEO PORTAL

A general framework for bounding the independence number of geometric hypergraphs, Part II: Applications

Description of video

Date: 4/10/26
Speaker :Varga Dániel

BBC+G Seminar

Seminars

Keywords

    Dániel Varga. A general framework for bounding the independence number of geometric hypergraphs, Part II: Applications

    Downloads

    Related videos

    01:21:00

    Márton Naszódi: Computing the Covering Radius with an Application to the Lonely Runner Conjecture

    Naszódi Márton

    BBC+G Seminar

    on 10/30/20

    Endre Csóka: Upper bounds for the necklace folding problems

    Csóka Endre

    BBC+G Seminar

    on 4/16/21

    A general framework for bounding the independence number of geometric hypergraphs, Part I: The Method

    Varga Dániel

    BBC+G Seminar

    on 3/27/26
    00:50:00

    Computer search in pure mathematics

    Varga Dániel

    Osszintezeti szeminarium

    on 4/24/23