The structure and the number of P7-free bipartite graphs

We show that the number of labelled P7-free bipartite graphs with n vertices grows as nΘ(n). This resolves an open problem posed by Allen (2009), and completes the description of speeds of monogenic classes of bipartite graphs. Our solution is based on a new decomposition scheme of bipartite graphs, which is of independent interest.