1 citations · 1 across the 2 of their papers we have counts for
5 papers
Asymptotic enumeration of 2-covers and line graphs
Peter Cameron, Thomas Prellberg, Dudley Stark
In this paper we find asymptotic enumerations for the number of line graphs on -labelled vertices and for different types of related combinatorial objects called 2-covers. We fi…
Meinardus' theorem on weighted partitions: extensions and a probabilistic proof
Boris L. Granovsky, Dudley Stark, Michael Erlihson
We give a probalistic proof of the famous Meinardus' asymptotic formula for the number of weighted partitions with weakened one of the three Meinardus' conditions, and extend the r…
Asymptotic enumeration of incidence matrices
Peter Cameron, Thomas Prellberg, Dudley Stark
We discuss the problem of counting {\em incidence matrices}, i.e. zero-one matrices with no zero rows or columns. Using different approaches we give three different proofs for the…
Asymptotics for incidence matrix classes
Peter Cameron, Thomas Prellberg, Dudley Stark
We define {\em incidence matrices} to be zero-one matrices with no zero rows or columns. A classification of incidence matrices is considered for which conditions of symmetry by tr…
Asymptotic enumeration and logical limit laws for expansive multisets and selections
Boris L. Granovsky, Dudley Stark
Given a sequence of integers a multiset is a combinatorial object composed of unordered components, such that there are exactly one-component multisets of size…