Subscribe to Events
Coloring subsets with r-wise intersecting color classes
Noga Alon, Princeton University
Date & time: Thursday, 23 September 2021 at 5:00PM - 6:00PM
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.
Password: The 20th Catalan number, alias (40)!/(20!*21!), alias 6564120420