Seminar Details
Coloring Subsets with r-wise Intersecting Color Classes
- Start Date: September 23, 2021
- Event Start Time: 5:00 PM
- Event End Time: 6:00 PM
- Seminar Series: Experimental Math Seminar
- Presenter(s): Noga Alon - Princeton University and Tel Aviv University
- Event Location: Online Event
- Event Additional Info: <p>Presented Via Zoom: <a href="https://rutgers.zoom.us/j/94346444480">https://rutgers.zoom.us/j/94346444480</a></p> <p>Password: 6564120420</p> <p>For further information see: <a href="https://sites.math.rutgers.edu/~zeilberg/expmath/">https://sites.math.rutgers.edu/~zeilberg/expmath/</a></p>
- Presentation Type: Stand Alone Presentation
- 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