Hypergraph Connectivity

Hypergraph Connectivity is a structural property in hypergraph theory that characterizes the minimum degree of interconnection among vertices through hyperedges, distinguishing it from graph-based connectivity by accounting for multi-node relationships within a unified hyperedge framework.

70

Publications

3.6K

Citations

150

Authors

101

Institutions

Publications per year

2017–2026

16

Authors

150

  1. DM
    David Maier

    Portland State University, United States

    3 publications · 68 citations

    3

    h-index

  2. JD
    Jeffrey D. Ullman

    Stanford University, United States

    3 publications · 68 citations

    3

    h-index

  3. LQ
    Liqun Qi

    Hong Kong Polytechnic University, Hong Kong SAR China

    3 publications · 359 citations

    3

    h-index

  4. SS
    Sebastian Schlag

    Karlsruhe Institute of Technology, Germany

    2 publications · 123 citations

    2

    h-index

  5. IS
    Ilya Safro

    Clemson University, United States

    2 publications · 103 citations

    2

    h-index

1–5 of 150

Venues

  1. Theoretical Computer Science

    7 publications · 289 citations

    7

    h-index

  2. Discrete Applied Mathematics

    5 publications · 133 citations

    5

    h-index

  3. Journal of Combinatorial Theory Series B

    3 publications · 415 citations

    3

    h-index

  4. Discrete Mathematics

    3 publications · 116 citations

    3

    h-index

  5. Information Processing Letters

    2 publications · 65 citations

    2

    h-index

1–5