Convexity, color avoidance, and total domination

Abstract: In this talk, I will discuss a few old and new hypergraph coloring questions which arise in the context of the Erdős-Szekeres problem in three dimensions, along with recent (partial) progress on some of them and various speculations.

computational geometrydiscrete mathematicscommutative algebracombinatorics

Audience: researchers in the topic

Copenhagen-Jerusalem Combinatorics Seminar

Series comments: There is a mailing list for talk announcements. If you want to receive the announcements, send an e-mail to the organizer to subscribe to the mailing list.

The password for the zoom room is 123456