BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

Bounds for Folkmanâ s Theorem Narayanan, Bhargav


Folkmanâ s theorem asserts that in any red-blue colouring of [N], there is an n-set all of whose finite sums are the same colour. How large must N be in terms of n Improving on Erdosâ Spencer from the 80s, Iâ ll show that N must be at least doubly exponential in n.

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International