Packing Numbers

Packing Numbers is a mathematical construct in combinatorics that quantifies the maximum number of pairwise disjoint subsets within a given set system, distinguished by its focus on maximizing non-overlapping configurations under specified constraints.

35

Publications

1.6K

Citations

72

Authors

44

Institutions

Publications per year

2017–2026

6

Variants

Packing Number

Authors

72

  1. RY
    Raphael Yuster

    University of Haifa, Israel

    3 publications · 82 citations

    3

    h-index

  2. SK
    Sandi Klavžar

    University of Maribor, Slovenia

    3 publications · 117 citations

    3

    h-index

  3. YC
    Yair Caro

    University of Haifa, Israel

    2 publications · 54 citations

    2

    h-index

  4. RG
    Ronald Graham

    University of California San Diego, United States

    2 publications · 195 citations

    2

    h-index

  5. JC
    Jeffrey C. Lagarias

    AT&T (United States), United States

    2 publications · 154 citations

    2

    h-index

1–5 of 72

Venues

  1. Discrete Mathematics

    4 publications · 137 citations

    4

    h-index

  2. 4

    h-index

  3. Discrete Applied Mathematics

    3 publications · 141 citations

    3

    h-index

  4. The Electronic Journal of Combinatorics

    2 publications · 48 citations

    2

    h-index

  5. Designs Codes and Cryptography

    2 publications · 41 citations

    2

    h-index

1–5