Uniform Hypergraphs
Uniform Hypergraphs is a hypergraph in which all hyperedges have the same cardinality, distinguishing it from general hypergraphs by enforcing uniformity in edge size.
382
Publications
13.7K
Citations
443
Authors
246
Institutions
Publications per year
2017–2026
83
Parents
382
Regularity Lemma for k‐uniform hypergraphs
Vojtěch Rödl, Jozef Skokan · Random Structures and Algorithms · 2004 · 266 citations
The counting lemma for regular k-uniform hypergraphs
Brendan Nagle, Vojtěch Rödl, Mathias Schacht · 2004 · 234 citations
1–5 of 382
443
19
h-index
14
h-index
14
h-index
University of Illinois Urbana-Champaign, United States
16 publications · 380 citations
13
h-index
11
h-index
1–5 of 443
246
Emory University
Atlanta, United States
22 h-index
43 publications
3K citations
University of Illinois Urbana-Champaign
Urbana, United States
15 h-index
27 publications
1.3K citations

Tel Aviv University
Tel Aviv, Israel
14 h-index
23 publications
1.2K citations

Adam Mickiewicz University in Poznań
Poznan, Poland
14 h-index
17 publications
1.2K citations

Hungarian Academy of Sciences
Budapest, Hungary
14 h-index
25 publications
979 citations

Alfréd Rényi Institute of Mathematics
Budapest, Hungary
12 h-index
19 publications
692 citations
Carnegie Mellon University
Pittsburgh, United States
12 h-index
16 publications
579 citations

University of Birmingham
Birmingham, United Kingdom
12 h-index
28 publications
1.5K citations
1–8 of 246
46 publications · 2.2K citations
27
h-index
27 publications · 657 citations
17
h-index
18 publications · 804 citations
15
h-index
18 publications · 510 citations
15
h-index
Repository · 24 publications · 462 citations
15
h-index
1–5