The multiplication table problem for bipartite graphs
Add to your list(s)
Download to your calendar using vCal
 István Tomon (University of Cambridge)
 Thursday 21 January 2016, 14:3015: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:
Note that exdirectory lists are not shown.
