Uniform Hypergraphs

Uniform Hypergraphs is a hypergraph in which all hyperedges have the same cardinality, distinguishing it from general hypergraphs by enforcing uniformity in edge size.

382

Publications

13.7K

Citations

443

Authors

246

Institutions

Publications per year

2017–2026

83

Authors

443

  1. VR
    Vojtěch Rödl

    Emory University, United States

    25 publications · 2.2K citations

    19

    h-index

  2. LQ
    Liqun Qi

    Hong Kong Polytechnic University, Hong Kong SAR China

    14 publications · 848 citations

    14

    h-index

  3. MS
    Mathias Schacht

    Humboldt-Universität zu Berlin, Germany

    16 publications · 954 citations

    14

    h-index

  4. AK
    Alexandr Kostochka

    University of Illinois Urbana-Champaign, United States

    16 publications · 380 citations

    13

    h-index

  5. DO
    Deryk Osthus

    University of Birmingham, United Kingdom

    11 publications · 609 citations

    11

    h-index

1–5 of 443

Venues

  1. Random Structures and Algorithms

    46 publications · 2.2K citations

    27

    h-index

  2. The Electronic Journal of Combinatorics

    27 publications · 657 citations

    17

    h-index

  3. Journal of Combinatorial Theory Series A

    18 publications · 804 citations

    15

    h-index

  4. Linear Algebra and its Applications

    18 publications · 510 citations

    15

    h-index

  5. arXiv (Cornell University)

    Repository · 24 publications · 462 citations

    15

    h-index

1–5