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

The multiplication table problem for bipartite graphs

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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