Kneser Graphs
Kneser Graphs is a family of graphs in algebraic and topological combinatorics defined as the graph whose vertices correspond to the k-element subsets of a fixed n-element set and in which two vertices are adjacent if and only if the corresponding subsets are disjoint.
90
Publications
3.6K
Citations
132
Authors
92
Institutions
Publications per year
2017–2026
11
Parents
90
A short proof of Kneser's conjecture
J Bárány · Journal of Combinatorial Theory Series A · 1978 · 148 citations
1–5 of 90
132
5
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 132
92

Hungarian Academy of Sciences
Budapest, Hungary
6 h-index
7 publications
187 citations

University of Maribor
Maribor, Slovenia
5 h-index
14 publications
328 citations
Shahid Beheshti University
Tehran, Iran
5 h-index
5 publications
110 citations

Moscow Institute of Physics and Technology
Dolgoprudnyy, Russia
4 h-index
5 publications
55 citations

University of Ljubljana
Ljubljana, Slovenia
4 h-index
12 publications
354 citations
Institute of Mathematics, Physics, and Mechanics
Ljubljana, Slovenia
4 h-index
11 publications
291 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
4 h-index
10 publications
214 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
6 publications
105 citations
1–8 of 92
9 publications · 1.1K citations
9
h-index
8 publications · 189 citations
8
h-index
8 publications · 211 citations
8
h-index
7 publications · 246 citations
7
h-index
6 publications · 191 citations
6
h-index
1–5