Gergely Ambrus: Piercing the chessboard

Mute
Current Time 0:00
/
Duration Time 0:00
Loaded: 0%
Progress: 0%
Stream TypeLIVE
Remaining Time -0:00
 

Description of video

Date: 12/3/21
Speaker :Ambrus Gergely
How many lines are needed to pierce each cell of the n*n chessboard? We give nontrivial upper and lower bounds, study related problems, and present an intriguing conjecture on the optimal number of lines. Joint work with I. Bárány, P. Frankl and D. Varga.

Downloads