(1) W7 Recall the Erds-Ko-Rado theorem from a week 3 video, which states that for positive integers n, k with n > 2k, the maximum size of a collection of pairwise-intersecting k-element subsets of [n] is (n=1). Write a (very simple) equation that reinterprets the Erds-Ko-Rado theorem as a statement about the Kneser graph K(n,k) (from Assignment 3 Problem 8)