OOIR: Observatory of International Research

Papers

(The median citation count of Combinatorics Probability & Computing is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-04-01 to 2025-04-01.)

Article	Citations
Triangle-free subgraphs with large fractional chromatic number	19
Approximation of subgraph counts in the uniform attachment model	9
Sampling repulsive Gibbs point processes using random graphs	8
Tight bound for the Erdős–Pósa property of tree minors	7
Long induced paths in expanders	6
On the maximum number of edges in -critical graphs	5
A generalization of Bondy’s pancyclicity theorem	5
Maximum chordal subgraphs of random graphs	5
Partial recovery and weak consistency in the non-uniform hypergraph stochastic block model	5
Antidirected subgraphs of oriented graphs	5
Ramsey simplicity of random graphs	5
Degree sequences of sufficiently dense random uniform hypergraphs	4
Subspace coverings with multiplicities	4
Satisfiability thresholds for regular occupation problems	4
Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems	4
Improved bound for improper colourings of graphs with no odd clique minor	4
On Turán exponents of bipartite graphs	4
Transversal C_k-factors in subgraphs of the balanced blow-up of C_k	4
A blurred view of Van der Waerden type theorems	3
Random feedback shift registers and the limit distribution for largest cycle lengths	3
A bipartite version of the Erdős–McKay conjecture	3
Tree universality in positional games	3
The critical window in random digraphs	3
Colouring graphs with forbidden bipartite subgraphs	3
The chromatic profile of locally colourable graphs	3

The distance profile of rooted and unrooted simply generated trees	3
Large cliques or cocliques in hypergraphs with forbidden order-size pairs	3
Convergence of blanket times for sequences of random walks on critical random graphs	3
Structural convergence and algebraic roots	3
On the exponential growth rates of lattice animals and interfaces	2
Spanning subdivisions in Dirac graphs	2
Multiple random walks on graphs: mixing few to cover many	2
Twin-width of sparse random graphs	2
Vertex-critical graphs far from edge-criticality	2
Behaviour of the minimum degree throughout the ${\textit{d}}$ -process	2
On the number of Hadamard matrices via anti-concentration	2
New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers	2
Spanning -cycles in random graphs	2
Extremal problems for GCDs	2
Counting matchings via capacity-preserving operators	2
A smoother notion of spread hypergraphs	2
A spanning bandwidth theorem in random graphs	2
Forcing generalised quasirandom graphs efficiently	2
Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings	2
The critical mean-field Chayes–Machta dynamics	2
Noisy group testing via spatial coupling	2
Polarised random -SAT	2
Small subsets with large sumset: Beyond the Cauchy–Davenport bound	2
The diameter of the uniform spanning tree of dense graphs	2
A note on extremal constructions for the Erdős–Rademacher problem	2
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics	2
Card guessing with partial feedback	1
Central limit theorem for components in meandric systems through high moments	1
Sharp bounds for a discrete John’s theorem	1
On deficiency problems for graphs	1
Concentration functions and entropy bounds for discrete log-concave distributions	1
The power of two choices for random walks	1
On mappings on the hypercube with small average stretch	1
Face enumeration for split matroid polytopes	1
On convex holes in d-dimensional point sets	1
Ramsey upper density of infinite graphs	1
Irregular subgraphs	1
Essential covers of the hypercube require many hyperplanes	1
Intersecting families without unique shadow	1
Spanning trees in graphs without large bipartite holes	1
The full rank condition for sparse random matrices	1
Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field	1
A class of graphs of zero Turán density in a hypercube	1
Hypergraphs without non-trivial intersecting subgraphs	1
The Bernoulli clock: probabilistic and combinatorial interpretations of the Bernoulli polynomials by circular convolution	1
Unimodular random one-ended planar graphs are sofic	1
A generalisation of Varnavides’s theorem	1
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree	1
Brownian bridge expansions for Lévy area approximations and particular values of the Riemann zeta function	1
Perfect matchings, rank of connection tensors and graph homomorphisms	1

Mastermind with a linear number of queries	1
On the choosability of -minor-free graphs	1
On the peel number and the leaf-height of Galton–Watson trees	1
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs	1
Sparse recovery properties of discrete random matrices	1
Strong complete minors in digraphs	1
Supercritical site percolation on the hypercube: small components are small	1
Universal and unavoidable graphs	1
Large monochromatic components in expansive hypergraphs	1
Quasipolynomial-time algorithms for Gibbs point processes	1
A new formula for the determinant and bounds on its tensor and Waring ranks	1
Clustered colouring of graph classes with bounded treedepth or pathwidth	1
Extending the Tutte and Bollobás–Riordan polynomials to rank 3 weakly coloured stranded graphs	1
Problems and results on 1-cross-intersecting set pair systems	1
Product structure of graph classes with bounded treewidth	1