Title	Bounds for Folkmanâ s Theorem
Creator	Narayanan, Bhargav
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-11-12T12:01
Description	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.
Extent	27.0 minutes
Subject	Mathematics; Combinatorics; Number theory; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Rutgers University
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2020-05-11
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0390444
URI	http://hdl.handle.net/2429/74393
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Researcher
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos