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 2022-08-01 to 2026-08-01.)

Article	Citations
On the maximum number of edges in -critical graphs	12
A bipartite version of the Erdős–McKay conjecture	10
A generalization of Bondy’s pancyclicity theorem	9
Beyond the classification theorem of Cameron, Goethals, Seidel, and Shult	8
Vertex-critical graphs far from edge-criticality	7
A generalisation of Varnavides’s theorem	7
Essential covers of the hypercube require many hyperplanes	6
Clique density vs blowups	6
Ramsey upper density of infinite graphs	6
Unimodular random one-ended planar graphs are sofic	5
Hypergraph independence polynomials with a zero close to the origin	5
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics	5
Disperse hypergraphs	5
Bipartite-ness under smooth conditions	5
Sidorenko’s conjecture for subdivisions and theta substitutions	5
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs	5
The distribution of the maximum protection number in simply generated trees	5
Threshold graphs maximise homomorphism densities	4
On random walks and switched random walks on homogeneous spaces	4
Canonization of a random circulant graph by counting walks	4
Random feedback shift registers and the limit distribution for largest cycle lengths	3
The Rank-Ramsey problem and the Log-Rank conjecture	3
Sampling repulsive Gibbs point processes using random graphs	3
On the exponential growth rates of lattice animals and interfaces	3
On the size of maximal intersecting families	3

Critical configurations of the hard-core model on square grid graphs	3
Forcing generalised quasirandom graphs efficiently	3
The largest subcritical component in inhomogeneous random graphs of preferential attachment type	3
On perfect subdivision tilings	3
On approximability of satisfiable $\boldsymbol {k}$ -CSPs: II	3
Trace reconstruction of matrices and hypermatrices	2
Embedding nearly spanning trees	2
Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph	2
A stability theorem for multi-partite graphs	2
Graphical sequences and plane trees	2
On minimum spanning trees for random Euclidean bipartite graphs	2
Many Hamiltonian subsets in large graphs with given density	2
A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs	2
Poset Ramsey numbers: large Boolean lattice versus a fixed poset	2
Powers of Hamilton cycles in oriented and directed graphs	2
Noise sensitivity of the minimum spanning tree of the complete graph	2
Computing the probability of intersection	2
Hypergraphs with uniform Turán density equal to 8/27	2
Ramsey simplicity of random graphs	2
Conflict-free hypergraph matchings and coverings	2
Expected number of faces in a random embedding of any graph is at most linear	2
Saturation in random hypergraphs	2
Clique-factors in graphs with sublinear -independence number	2
Product structure of graph classes with bounded treewidth	2
Supercritical site percolation on the hypercube: small components are small	2
Sharp bounds for a discrete John’s theorem	2
Algorithms for the ferromagnetic Potts model on expanders	2
On the zeroes of hypergraph independence polynomials	2
Unavoidable patterns in locally balanced colourings	2
Off-diagonal Ramsey numbers for linear hypergraphs	2
Problems and results on 1-cross-intersecting set pair systems	1
Optimal thresholds for monotone non-Boolean functions	1
Spanning -cycles in random graphs	1
Approximation of subgraph counts in the uniform attachment model	1
A large hole in pseudo-random graphs	1
Beyond the broken tetrahedron	1
Trees and treelike structures in dense digraphs	1
On oriented cycles in randomly perturbed digraphs	1
Rough permutations with a fixed set of a given size	1
A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree	1
The random italic k 1
Mastermind with a linear number of queries	1
Time-inhomogeneous random walks on finite groups and cokernels of random integer block matrices	1
A note on the computational complexity of weak saturation	1
Tree universality in positional games	1
Maximal chordal subgraphs	1
A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs	1
Percolation on irregular high-dimensional product graphs	1
On the size-Ramsey number of grids	1
Transversal Hamilton cycles in digraph collections	1

Polynomials over structured grids	1
Colouring random subgraphs	1
The full rank condition for sparse random matrices	1
Optimal tree-decompositions with bags of bounded treewidth	1
Short proof of the hypergraph container theorem	1
Hamiltonicity of sparse pseudorandom graphs	1
Structural convergence and algebraic roots	1
Couplings and Poisson approximation for stabilising functionals of determinantal point processes	1
A conditional lower bound for the Turán number of spheres	1
Maximum chordal subgraphs of random graphs	1
Comparing the sets of volume polynomials and Lorentzian polynomials	1
Universal geometric graphs	1