OOIR: Observatory of International Research

Papers

(The TQCC of Combinatorics Probability & Computing is 2. 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-05-01 to 2026-05-01.)

Article	Citations
On the maximum number of edges in -critical graphs	12
A generalization of Bondy’s pancyclicity theorem	9
A bipartite version of the Erdős–McKay conjecture	9
A generalisation of Varnavides’s theorem	8
Beyond the classification theorem of Cameron, Goethals, Seidel, and Shult	8
Ramsey upper density of infinite graphs	7
Vertex-critical graphs far from edge-criticality	7
Clique density vs blowups	6
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics	6
Essential covers of the hypercube require many hyperplanes	6
Sidorenko’s conjecture for subdivisions and theta substitutions	6
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs	5
Unimodular random one-ended planar graphs are sofic	5
The distribution of the maximum protection number in simply generated trees	5
Disperse hypergraphs	5
Hypergraph independence polynomials with a zero close to the origin	5
Canonization of a random circulant graph by counting walks	4
Bipartite-ness under smooth conditions	4
Critical configurations of the hard-core model on square grid graphs	4
On random walks and switched random walks on homogeneous spaces	4
On perfect subdivision tilings	4
Threshold graphs maximise homomorphism densities	4
Transversal C_k-factors in subgraphs of the balanced blow-up of C_k	3
Forcing generalised quasirandom graphs efficiently	3
On the exponential growth rates of lattice animals and interfaces	3

The largest subcritical component in inhomogeneous random graphs of preferential attachment type	3
Random feedback shift registers and the limit distribution for largest cycle lengths	3
Clustered colouring of graph classes with bounded treedepth or pathwidth	3
Supercritical site percolation on the hypercube: small components are small	3
On the size of maximal intersecting families	3
On approximability of satisfiable $\boldsymbol {k}$ -CSPs: II	3
The critical mean-field Chayes–Machta dynamics	3
Noise sensitivity of the minimum spanning tree of the complete graph	3
The chromatic profile of locally colourable graphs	3
Sampling repulsive Gibbs point processes using random graphs	3
Algorithms for the ferromagnetic Potts model on expanders	2
Clique-factors in graphs with sublinear -independence number	2
Hypergraphs with uniform Turán density equal to 8/27	2
Hypergraphs without non-trivial intersecting subgraphs	2
Sharp bounds for a discrete John’s theorem	2
Short proof of the hypergraph container theorem	2
Ramsey simplicity of random graphs	2
On minimum spanning trees for random Euclidean bipartite graphs	2
Many Hamiltonian subsets in large graphs with given density	2
Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph	2
Product structure of graph classes with bounded treewidth	2
Embedding nearly spanning trees	2
Trace reconstruction of matrices and hypermatrices	2
Expected number of faces in a random embedding of any graph is at most linear	2
Approximation of subgraph counts in the uniform attachment model	2
On the zeroes of hypergraph independence polynomials	2
Conflict-free hypergraph matchings and coverings	2
Unavoidable patterns in locally balanced colourings	2
A stability theorem for multi-partite graphs	2
Poset Ramsey numbers: large Boolean lattice versus a fixed poset	2
Powers of Hamilton cycles in oriented and directed graphs	2
Graphical sequences and plane trees	2
A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs	2
Off-diagonal Ramsey numbers for linear hypergraphs	2
A note on the computational complexity of weak saturation	2
Tree universality in positional games	2
Saturation in random hypergraphs	2