Sign Up to like & get
recommendations!
1
Published in 2017 at "Combinatorica"
DOI: 10.1007/s00493-016-3322-0
Abstract: We investigate the following generalisation 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…
read more here.
Keywords:
bipartite;
multiplication table;
problem;
table problem ... See more keywords