Non-uniform Hypergraphs
Non-Uniform Hypergraphs is a hypergraph in which the edges, referred to as hyperedges, exhibit varying cardinalities, thereby distinguishing it from uniform hypergraphs where all hyperedges have the same number of vertices.
47
Publications
1.2K
Citations
103
Authors
72
Institutions
Publications per year
2017–2026
10
Parents
47
The Uniformity Lemma for hypergraphs
Péter Frankl, V. Rödl · Graphs and Combinatorics · 1992 · 83 citations
Suboptimality of local algorithms for a class of max-cut problems
Wei‐Kuo Chen, David Gamarnik, Dmitry Panchenko et al. · The Annals of Probability · 2019 · 58 citations · Full text
1–5 of 47
103
3
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 103
72

Hungarian Academy of Sciences
Budapest, Hungary
5 h-index
7 publications
320 citations
Emory University
Atlanta, United States
3 h-index
4 publications
156 citations
University of Illinois Chicago
Chicago, United States
3 h-index
4 publications
66 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
4 publications
138 citations

Moscow Institute of Physics and Technology
Dolgoprudnyy, Russia
2 h-index
4 publications
60 citations

Worcester Polytechnic Institute
Worcester, United States
2 h-index
2 publications
42 citations
Harvard University
Cambridge, United States
2 h-index
4 publications
68 citations

Anhui University
Hefei, China
2 h-index
5 publications
169 citations
1–8 of 72
5 publications · 81 citations
5
h-index
4 publications · 69 citations
4
h-index
3 publications · 35 citations
3
h-index
2 publications · 79 citations
2
h-index
2 publications · 138 citations
2
h-index
1–5