Noga Alon, Princeton University and Tel Aviv University

Abstract

What is the minimum number of colors required in a coloring of all k-subsets of an n-set so that every color class is r-wise intersecting? We suggest a conjectured answer for all r, k and n, note that for r=2 this is Kneser's conjecture proved by Lovasz, and prove the conjecture for any r which is either a prime or a power of 2.

Link to video: https://vimeo.com/618144251

Presented Via Zoom: https://rutgers.zoom.us/j/94346444480

Password: 6564120420

For further information see: https://sites.math.rutgers.edu/~zeilberg/expmath/