Simple Hypergraphs

Simple Hypergraphs is a hypergraph in which no two hyperedges are identical and no hyperedge is contained within another, thereby ensuring minimality and uniqueness in its edge set.

108

Publications

5K

Citations

192

Authors

129

Institutions

Publications per year

2017–2026

16

Authors

192

  1. VR
    Vojtěch Rödl

    Emory University, United States

    5 publications · 391 citations

    5

    h-index

  2. NA
    Noga Alon

    Tel Aviv University, Israel

    5 publications · 235 citations

    5

    h-index

  3. EG
    Ervin Győri

    Hungarian Academy of Sciences, Hungary

    4 publications · 181 citations

    4

    h-index

  4. VR
    V. Rödl

    Emory University, United States

    4 publications · 509 citations

    4

    h-index

  5. ES
    Endre Szemerédi

    Hungarian Academy of Sciences, Hungary

    4 publications · 298 citations

    4

    h-index

1–5 of 192

Venues

  1. Journal of Combinatorial Theory Series B

    11 publications · 551 citations

    10

    h-index

  2. Journal of Combinatorial Theory Series A

    9 publications · 495 citations

    9

    h-index

  3. COMBINATORICA

    9 publications · 413 citations

    9

    h-index

  4. Discrete Mathematics

    8 publications · 851 citations

    8

    h-index

  5. European Journal of Combinatorics

    7 publications · 428 citations

    7

    h-index

1–5