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

Article	Citations
On the maximum number of edges in -critical graphs	11
A generalization of Bondy’s pancyclicity theorem	7
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics	6
On Turán exponents of bipartite graphs	6
Ramsey upper density of infinite graphs	6
A generalisation of Varnavides’s theorem	6
A blurred view of Van der Waerden type theorems	6
Essential covers of the hypercube require many hyperplanes	6
Vertex-critical graphs far from edge-criticality	6
A bipartite version of the Erdős–McKay conjecture	6
The distribution of the maximum protection number in simply generated trees	5
Hypergraph independence polynomials with a zero close to the origin	5
Unimodular random one-ended planar graphs are sofic	5
Bipartite-ness under smooth conditions	5
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs	5
Critical configurations of the hard-core model on square grid graphs	4
Threshold graphs maximise homomorphism densities	4
On perfect subdivision tilings	4
On the size of maximal intersecting families	4
On random walks and switched random walks on homogeneous spaces	4
Sampling repulsive Gibbs point processes using random graphs	3
Transversal C_k-factors in subgraphs of the balanced blow-up of C_k	3
Supercritical site percolation on the hypercube: small components are small	3
Random feedback shift registers and the limit distribution for largest cycle lengths	3
The chromatic profile of locally colourable graphs	3

On the exponential growth rates of lattice animals and interfaces	3
Forcing generalised quasirandom graphs efficiently	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
The critical mean-field Chayes–Machta dynamics	3
Sharp bounds for a discrete John’s theorem	2
On minimum spanning trees for random Euclidean bipartite graphs	2
Unavoidable patterns in locally balanced colourings	2
Short proof of the hypergraph container theorem	2
Many Hamiltonian subsets in large graphs with given density	2
On bucket increasing trees, clustered increasing trees and increasing diamonds	2
Clique-factors in graphs with sublinear -independence number	2
Hypergraphs without non-trivial intersecting subgraphs	2
Expected number of faces in a random embedding of any graph is at most linear	2
Distribution of tree parameters by martingale approach	2
Refined universality for critical KCM: lower bounds	2
Approximation of subgraph counts in the uniform attachment model	2
Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph	2
Strong complete minors in digraphs	2
Removal lemmas and approximate homomorphisms	2
Noise sensitivity of the minimum spanning tree of the complete graph	2
Expansion for the critical point of site percolation: the first three terms	2
On the zeroes of hypergraph independence polynomials	2
Ramsey simplicity of random graphs	2
Poset Ramsey numbers: large Boolean lattice versus a fixed poset	2
Algorithms for the ferromagnetic Potts model on expanders	2
Product structure of graph classes with bounded treewidth	2