Hypergraph Designs is a theoretical framework in combinatorial mathematics that prescribes systematic methods for constructing hypergraphs with specified intersection patterns among edges, distinguished from other hypergraph construction techniques by enforcing regularity, balance, and symmetry constraints akin to those in classical block design theory.
91
Publications
4K
Citations
187
Authors
122
Institutions
Publications per year
2017–2026
15
Parents
Publications
91
Supersaturated graphs and hypergraphs
Paul Erdős, Miklós Simonovits · COMBINATORICA · 1983 · 275 citations
Improved algorithms for hypergraph bipartitioning
Andrew Caldwell, Andrew B. Kahng, Igor L. Markov · 2000 · 149 citations · Full text
1–5 of 91
Authors
187
- AB
8
h-index
- AC
7
h-index
- IL
7
h-index
- ŹT
5
h-index
- CB
5
h-index
1–5 of 187
Institutions
122
Hungarian Academy of Sciences
Budapest, Hungary
10 h-index
15 publications
823 citations
University of Pannonia
Veszprém, Hungary
5 h-index
10 publications
296 citations
Alfréd Rényi Institute of Mathematics
Budapest, Hungary
4 h-index
5 publications
107 citations
Jagiellonian University
Krakow, Poland
3 h-index
9 publications
151 citations
University of California, Los Angeles
Los Angeles, United States
3 h-index
7 publications
597 citations
Texas State University
San Marcos, United States
3 h-index
6 publications
130 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
2 h-index
4 publications
343 citations
Emory University
Atlanta, United States
2 h-index
2 publications
209 citations
1–8 of 122
Venues
- Discrete Mathematics
8 publications · 159 citations
8
h-index
- Journal of Combinatorial Theory Series A
6 publications · 241 citations
6
h-index
- Discrete Applied Mathematics
5 publications · 142 citations
5
h-index
- arXiv (Cornell University)
Repository · 5 publications · 136 citations
5
h-index
- COMBINATORICA
3 publications · 351 citations
3
h-index
1–5