On the Chromatic Number of Kneser Graphs and Hypergraphs and Their Variants.''', abstract = '''Some topological, combinatorial and algebraic methods to derive bounds for chromatic number of Kneser graphs and hypergraphs will be presented. We will review the original methods of Lovasz using topology and their extensions by Alon and Frankl to hypergraph version of Kneser graph. We present some other variants of Kneser graphs and hypergraphs and discuss some bounds on their chromatic numbers. The results are obtained jointly with collaboration of Sharareh Alipour, Soheil Azarpensar and Javad Moghaddam Zadeh.