Long induced paths and cycles in Kneser graphs (Q1263600)

The Kneser graph K(n,r) is the graph whose vertex set is the family of all r-element subsets of \(\{\) 1,2,...,n\(\}\), and a pair of vertices forms an edge if the corresponding subsets are disjoint. The authors present some lower and upper bounds on the length of the maximum induced paths and cycles in Kneser graphs.