Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

Article Types Accepted

All or part of the publication costs for papers may be covered by one of the agreements Cambridge University Press has made to support open access. For authors not covered by an agreement, and without APC funding, please see this journal's open access options for instructions on how to request an APC waiver.