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
Parents
35
Apollonian circle packings: number theory
Ronald Graham, Jeffrey C. Lagarias, Colin L. Mallows et al. · Journal of Number Theory · 2003 · 141 citations
Integer and Fractional Packings in Dense Graphs
Penny Haxell, V. Rödl · COMBINATORICA · 2001 · 92 citations
1–5 of 35
72
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 72
44
Oranim Academic College of Education
Haifa, Israel
3 h-index
5 publications
136 citations

University of Maribor
Maribor, Slovenia
3 h-index
4 publications
205 citations
University of Haifa
Haifa, Israel
3 h-index
4 publications
100 citations

Eötvös Loránd University
Budapest, Hungary
2 h-index
2 publications
28 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
4 publications
76 citations
University of Pannonia
Veszprém, Hungary
2 h-index
3 publications
39 citations

Incheon National University
Incheon, South Korea
2 h-index
3 publications
39 citations

University of Ljubljana
Ljubljana, Slovenia
2 h-index
2 publications
29 citations
1–8 of 44
4 publications · 137 citations
4
h-index
4 publications · 105 citations
4
h-index
3 publications · 141 citations
3
h-index
2 publications · 48 citations
2
h-index
2 publications · 41 citations
2
h-index
1–5