Proportions of Irreducible Diagrams

We investigate the proportion of graphs on n-vertices each of which is m-valent, that are “k-reducible”. An asymptotic formula is developed for large n and fixed values of the other variables, in terms of an n-independent parameter that is evaluated for a number of (m, k) values.