COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

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

## The multiplication table problem for bipartite graphsAdd to your list(s) Download to your calendar using vCal - István Tomon (University of Cambridge)
- Thursday 21 January 2016, 14:30-15:30
- MR12.
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:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsCambridge Conference on Global Food Security 2016 Wolfson College Humanities Society talks BHRU Annual Lecture 2016## Other talksStopping the Biological Clock – The Lazarus factor and Pulling Life back from the Edge. Making Refuge: Academics at Risk Methane and the Paris Agreement Developing and Selecting Tribological Coatings Superconformal quantum mechanics and integrability Tunable Functional Magnetic Skyrmions at Room Temperature |