Hypergraph Extremal Problems

Hypergraph Extremal Problems is a research framework in extremal combinatorics that systematically studies the maximum or minimum possible size of a hypergraph subject to specific structural or combinatorial constraints, distinguishing it from other extremal problems by its focus on hypergraph families and their forbidden substructures, Turán-type thresholds, or extremal configurations.

79

Publications

3.1K

Citations

127

Authors

88

Institutions

Publications per year

2017–2026

16

Authors

127

  1. VR
    Vojtěch Rödl

    Emory University, United States

    7 publications · 702 citations

    7

    h-index

  2. MS
    Miklós Simonovits

    Hungarian Academy of Sciences, Hungary

    4 publications · 235 citations

    4

    h-index

  3. DM
    Dhruv Mubayi

    University of Illinois Chicago, United States

    3 publications · 36 citations

    3

    h-index

  4. JB
    József Balogh

    University of Illinois Urbana-Champaign, United States

    3 publications · 375 citations

    3

    h-index

  5. PF
    Péter Frankl

    Centre National de la Recherche Scientifique, France

    3 publications · 286 citations

    3

    h-index

1–5 of 127

Venues

  1. arXiv (Cornell University)

    Repository · 9 publications · 172 citations

    9

    h-index

  2. Discrete Mathematics

    8 publications · 252 citations

    8

    h-index

  3. Random Structures and Algorithms

    6 publications · 698 citations

    6

    h-index

  4. Journal of Combinatorial Theory Series A

    4 publications · 147 citations

    4

    h-index

  5. European Journal of Combinatorics

    4 publications · 90 citations

    4

    h-index

1–5