Simple Hypergraphs
Simple Hypergraphs is a hypergraph in which no two hyperedges are identical and no hyperedge is contained within another, thereby ensuring minimality and uniqueness in its edge set.
108
Publications
5K
Citations
192
Authors
129
Institutions
Publications per year
2017–2026
16
Parents
108
Normal hypergraphs and the perfect graph conjecture
László Lovász · Discrete Mathematics · 1972 · 762 citations
1–5 of 108
192
5
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 192
129

Hungarian Academy of Sciences
Budapest, Hungary
11 h-index
13 publications
423 citations

Alfréd Rényi Institute of Mathematics
Budapest, Hungary
7 h-index
8 publications
269 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
6 h-index
8 publications
370 citations

Adam Mickiewicz University in Poznań
Poznan, Poland
6 h-index
6 publications
334 citations

Shanghai University
Shanghai, China
5 h-index
12 publications
211 citations
Emory University
Atlanta, United States
5 h-index
7 publications
444 citations

Tel Aviv University
Tel Aviv, Israel
5 h-index
5 publications
235 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
8 publications
125 citations
1–8 of 129
11 publications · 551 citations
10
h-index
9 publications · 495 citations
9
h-index
9 publications · 413 citations
9
h-index
8 publications · 851 citations
8
h-index
7 publications · 428 citations
7
h-index
1–5