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-05-01 to 2025-05-01.)

Article	Citations
Triangle-free subgraphs with large fractional chromatic number	20
A blurred view of Van der Waerden type theorems	9
On the maximum number of edges in -critical graphs	8
On Turán exponents of bipartite graphs	8
A bipartite version of the Erdős–McKay conjecture	6
A generalization of Bondy’s pancyclicity theorem	6
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree	5
Essential covers of the hypercube require many hyperplanes	5
Vertex-critical graphs far from edge-criticality	5
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics	5
A generalisation of Varnavides’s theorem	5
Ramsey upper density of infinite graphs	5
The distribution of the maximum protection number in simply generated trees	4
Spectral gap in random bipartite biregular graphs and applications	4
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs	4
Hypergraph independence polynomials with a zero close to the origin	4
Unimodular random one-ended planar graphs are sofic	4
Bipartite-ness under smooth conditions	4
Threshold graphs maximise homomorphism densities	3
The chromatic profile of locally colourable graphs	3
Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems	3
Clustered colouring of graph classes with bounded treedepth or pathwidth	3
On perfect subdivision tilings	3
Transversal C_k-factors in subgraphs of the balanced blow-up of C_k	3
Sampling repulsive Gibbs point processes using random graphs	3

Random feedback shift registers and the limit distribution for largest cycle lengths	3
On random walks and switched random walks on homogeneous spaces	3
Critical configurations of the hard-core model on square grid graphs	3
On the size of maximal intersecting families	3
On the exponential growth rates of lattice animals and interfaces	3
Noise sensitivity of the minimum spanning tree of the complete graph	2
Forcing generalised quasirandom graphs efficiently	2
Product structure of graph classes with bounded treewidth	2
Expected number of faces in a random embedding of any graph is at most linear	2
On minimum spanning trees for random Euclidean bipartite graphs	2
Large N behaviour of the two-dimensional Yang–Mills partition function	2
Clique-factors in graphs with sublinear -independence number	2
Strong complete minors in digraphs	2
The critical mean-field Chayes–Machta dynamics	2
Supercritical site percolation on the hypercube: small components are small	2
On bucket increasing trees, clustered increasing trees and increasing diamonds	2
Many Hamiltonian subsets in large graphs with given density	2
Distribution of tree parameters by martingale approach	2
Poset Ramsey numbers: large Boolean lattice versus a fixed poset	2
Hypergraphs without non-trivial intersecting subgraphs	2
Sharp bounds for a discrete John’s theorem	2
Algorithms for the ferromagnetic Potts model on expanders	2
Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph	2
Removal lemmas and approximate homomorphisms	2
Unavoidable patterns in locally balanced colourings	2
Expansion for the critical point of site percolation: the first three terms	2
Card guessing with partial feedback	2
Approximation of subgraph counts in the uniform attachment model	1
Refined universality for critical KCM: lower bounds	1
On the number of Hadamard matrices via anti-concentration	1
Hamiltonicity of sparse pseudorandom graphs	1
A smoother notion of spread hypergraphs	1
Convergence of blanket times for sequences of random walks on critical random graphs	1
Colouring graphs with forbidden bipartite subgraphs	1
On directed analogues of expander and hyperfinite graph sequences	1
Continuous phase transitions on Galton–Watson trees	1
Extending the Tutte and Bollobás–Riordan polynomials to rank 3 weakly coloured stranded graphs	1
A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree	1
Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field	1
Spanning -cycles in random graphs	1
Ramsey simplicity of random graphs	1
On the zeroes of hypergraph independence polynomials	1
On the edit distance function of the random graph	1
Maximal chordal subgraphs	1
Degree sequences of sufficiently dense random uniform hypergraphs	1
Polynomials over structured grids	1
Percolation on irregular high-dimensional product graphs	1
On the smallest singular value of symmetric random matrices	1
Colouring random subgraphs	1
On deficiency problems for graphs	1

On oriented cycles in randomly perturbed digraphs	1
On convex holes in d-dimensional point sets	1
Tree universality in positional games	1
Clustered 3-colouring graphs of bounded degree	1
Sandwiching biregular random graphs	1
Maximum chordal subgraphs of random graphs	1
Satisfiability thresholds for regular occupation problems	1
Small subsets with large sumset: Beyond the Cauchy–Davenport bound	1
Improved lower bound for the list chromatic number of graphs with no K_t minor	1
On the size-Ramsey number of grids	1
Mastermind with a linear number of queries	1
Universal geometric graphs	1
Problems and results on 1-cross-intersecting set pair systems	1
The full rank condition for sparse random matrices	1
A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs	1
Lower bound on the size of a quasirandom forcing set of permutations	1