University of Cambridge > Talks.cam > Combinatorics Seminar > The multiplication table problem for bipartite graphs

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

The multiplication table problem for bipartite graphs

Download to your calendar using vCal

  • UserIstván Tomon (University of Cambridge)
  • ClockThursday 21 January 2016, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason .

We investigate the following generalization of the `multiplication 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 estimating the number of distinct products ab with a, b less than n is precisely the problem under consideration when the graph in question is the complete bipartite graph K_{n,n}.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Wolfson Lecture Theatre & ONLINE - Details to be sent by email Blog Seminar time is 1pm BST in Room FW 11, Willam Gates Hall. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

Tea and Coffee Break Science & the Public in Action: Can and should climate scientists be activists? title abstract tbc An Amphibious Urbanism | | Cut 4: The Desert Arrives Slowly Novel neuroimaging methods in Lewy body dementia External Seminar - Hilde Nelissen TBC
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity