Write in a clean editor, then format for Combinatorics Probability Computing in one click — DocuGuru applies the official Cambridge University Press template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
Combinatorics Probability Computing is a peer-reviewed journal published by Cambridge University Press, covering Limits and Structures in Graph Theory, Advanced Graph Theory Research, Graph theory and applications.
| Publisher | Cambridge University Press |
|---|---|
| Reference style | Numbered Numbered — [1], [2] in the text [1] A. Smith, B. Jones, and C. Lee, A representative article title, Combinatorics Probability Computing 12 (2023) 45–58.
Formats any DOI in the closest standard style — Combinatorics Probability Computing has no published style definition, so this is an approximation. No sign-up. |
| Publishes research in | Limits and Structures in Graph Theory Advanced Graph Theory Research Graph theory and applications Stochastic processes and statistical mechanics graph theory and CDMA systems |
| ISSN | 0963-5483 |
| Citation impact (2-yr) | 0.67 |
| h-index | 77 |
| i10-index | 723 |
| Total citations | 32,416 |
| Top institutions publishing here | Tel Aviv University |
| Journal website | journals.cambridge.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Given a sequence of nonnegative real numbers λ0, λ1, … that sum to 1, we consider a random graph having approximately λin vertices of degree i. In [12] the authors essentially show that if [sum ]i(i−2)λi>0 then the graph a.s. has a giant component, while if [sum ]i(i−2)λi<0 then a.s. all components in the graph…
We present a general algebraic technique and discuss some of its numerous applications in combinatorial number theory, in graph theory and in combinatorics. These applications include results in additive number theory and in the study of graph colouring problems. Many of these are known results, to which we present unified proofs, and some results are…
The paper is concerned with tools for the quantitative analysis of finite Markov chains whose states are combinatorial structures. Chains of this kind have algorithmic applications in many areas, including random sampling, approximate counting, statistical physics and combinatorial optimisation. The efficiency of the resulting algorithms depends crucially on the mixing rate of the chain, i.e.…
This article proposes a surprisingly simple framework for the random generation of combinatorial configurations based on what we call Boltzmann models . The idea is to perform random generation of possibly complex structured objects by placing an appropriate measure spread over the whole of a combinatorial class – an object receives a probability essentially proportional…
We show that an old but not well-known lower bound for the crossing number of a graph yields short proofs for a number of bounds in discrete plane geometry which were considered hard before: the number of incidences among points and lines, the maximum number of unit distances among n points, the minimum number of…
