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

Authors

132

  1. HH
    Hossein Hajiabolhassan

    Shahid Beheshti University, Iran

    5 publications · 110 citations

    5

    h-index

  2. PF
    Péter Frankl

    Centre National de la Recherche Scientifique, France

    4 publications · 221 citations

    4

    h-index

  3. FM
    Frédéric Meunier

    CERMICS, France

    4 publications · 105 citations

    4

    h-index

  4. BO
    Behnaz Omoomi

    Isfahan University of Technology, Iran

    3 publications · 84 citations

    3

    h-index

  5. TM
    Torsten Mütze

    ETH Zurich, Switzerland

    3 publications · 59 citations

    3

    h-index

1–5 of 132

Venues

  1. Journal of Combinatorial Theory Series A

    9 publications · 1.1K citations

    9

    h-index

  2. Discrete Mathematics

    8 publications · 189 citations

    8

    h-index

  3. Journal of Graph Theory

    8 publications · 211 citations

    8

    h-index

  4. Journal of Combinatorial Theory Series B

    7 publications · 246 citations

    7

    h-index

  5. The Electronic Journal of Combinatorics

    6 publications · 191 citations

    6

    h-index

1–5