Ádám Schweitzer: Clique numbers of xor-products of Kneser graphs

Abstract: We study the size of cliques in xor-products and xor-powers of Kneser graphs. This question, while being part of the continuing history of multipartite extremal set theoretic questions, is also a continuation of the study of xor-powers of complete graphs from Noga and Lubetzky.

We present strong bounds on the clique number for the xor-product of Kneser graphs via extremal methods, improve the best known bounds on xor-powers of complete graphs via linear algebraic tools, and provide constructions, bounds and conjectures for the general case.   This is a joint work with Z. Füredi and A. Imolay.