Concepedia

Hypergraph Packings

Hypergraph Packings is a combinatorial construct in hypergraph theory that refers to a collection of hyperedges in which no two hyperedges share a common vertex, thereby generalizing the notion of matchings from graphs to hypergraphs.

25

Publications

600

Citations

48

Authors

31

Institutions

Publications per year

2017–2026

4

Parents

Publications

25

MISO Networks With Imperfect CSIT: A Topological Rate-Splitting Approach

Chenxi Hao, Bruno Clerckx · IEEE Transactions on Communications · 2017 · 57 citations

, , +13

Asymptotic packing via a branching process

Joel Spencer · Random Structures and Algorithms · 1995 · 45 citations

, , +15

Asymptotic packing and the random greedy algorithm

Vojt ch R�dl, Lubo Thoma · Random Structures and Algorithms · 1996 · 41 citations

, , +14

Interval Packing and Covering in the Boolean Lattice

Konrad Engel · Combinatorics Probability Computing · 1996 · 37 citations

, , +12

New Results on Degree Sequences of Uniform Hypergraphs

Sarah Behrens, Catherine Erbes, Michael Ferrara et al. · The Electronic Journal of Combinatorics · 2013 · 32 citations · Full text

, , +8

1–5 of 25

Authors

48

  1. AF
    Alan Frieze

    Carnegie Mellon University, United States

    3 publications · 78 citations

    3

    h-index

  2. RM
    Richard Mycroft

    University of Birmingham, United Kingdom

    2 publications · 38 citations

    2

    h-index

  3. MK
    Michael Krivelevich

    Tel Aviv University, Israel

    2 publications · 58 citations

    2

    h-index

  4. VR
    V. Rödl

    Emory University, United States

    2 publications · 42 citations

    2

    h-index

  5. DA
    David A. Grable

    Humboldt-Universität zu Berlin, Germany

    2 publications · 42 citations

    2

    h-index

1–5 of 48

Institutions

31

  1. Humboldt-Universität zu Berlin

    Berlin, Germany

    4 h-index

    4 publications

    84 citations

  2. Emory University

    Atlanta, United States

    4 h-index

    5 publications

    117 citations

  3. University of Birmingham

    Birmingham, United Kingdom

    3 h-index

    3 publications

    59 citations

  4. Carnegie Mellon University

    Pittsburgh, United States

    3 h-index

    5 publications

    113 citations

  5. Tel Aviv University

    Tel Aviv, Israel

    2 h-index

    2 publications

    58 citations

  6. Adam Mickiewicz University in Poznań

    Poznan, Poland

    2 h-index

    2 publications

    40 citations

  7. University of Illinois Urbana-Champaign

    Urbana, United States

    2 h-index

    5 publications

    121 citations

  8. Laboratoire des Sciences pour la Conception, l'Optimisation et la Production

    Grenoble, France

    1 h-index

    2 publications

    30 citations

1–8 of 31

Venues

  1. Random Structures and Algorithms

    5 publications · 162 citations

    5

    h-index

  2. Journal of Combinatorial Theory Series B

    3 publications · 51 citations

    3

    h-index

  3. Combinatorics Probability Computing

    3 publications · 94 citations

    3

    h-index

  4. The Electronic Journal of Combinatorics

    2 publications · 56 citations

    2

    h-index

  5. SIAM Journal on Discrete Mathematics

    2 publications · 34 citations

    2

    h-index

1–5