BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The multiplication table problem for bipartite graphs - István To
 mon (University of Cambridge)
DTSTART:20160121T143000Z
DTEND:20160121T153000Z
UID:TALK63267@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:We investigate the following generalization of the `multiplica
 tion table problem' of Erdős: given a bipartite graph with m edges\, how 
 large is the set of sizes of its induced subgraphs? Erdős's problem of es
 timating the number of distinct products ab with a\, b less than n is prec
 isely the problem under consideration when the graph in question is the co
 mplete bipartite graph K_{n\,n}.
LOCATION:MR12
END:VEVENT
END:VCALENDAR