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 2020-11-01 to 2024-11-01.)

Article	Citations
Spectral gap in random bipartite biregular graphs and applications	15
Tail bounds on hitting times of randomized search heuristics using variable drift analysis	13
Optimal group testing	12
Concentration functions and entropy bounds for discrete log-concave distributions	9
On the Erdős–Sós conjecture for trees with bounded degree	8
Clustered 3-colouring graphs of bounded degree	7
Refined universality for critical KCM: lower bounds	6
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques	6
Card guessing with partial feedback	6
Full rainbow matchings in graphs and hypergraphs	5
Triangles in randomly perturbed graphs	5
Making K_r+1-free graphs r-partite	5
Powers of paths in tournaments	5
Subgraph densities in a surface	5
On tripartite common graphs	5
On the mixing time of coordinate Hit-and-Run	5
Tree limits and limits of random trees	5
On Turán exponents of bipartite graphs	5
Counting Hamilton cycles in Dirac hypergraphs	4
Improved lower bound for the list chromatic number of graphs with no K_t minor	4
Turán-type results for intersection graphs of boxes	4
Irregular subgraphs	4
On the size-Ramsey number of grid graphs	4
Product structure of graph classes with bounded treewidth	4
Colouring graphs with forbidden bipartite subgraphs	4

Lower bound on the size of a quasirandom forcing set of permutations	4
Expansion for the critical point of site percolation: the first three terms	3
The length of an s-increasing sequence of r-tuples	3
Independent sets of a given size and structure in the hypercube	3
The power of two choices for random walks	3
Clustered colouring of graph classes with bounded treedepth or pathwidth	3
Short proofs for long induced paths	3
Archaeology of random recursive dags and Cooper-Frieze random networks	3
Singularity of sparse random matrices: simple proofs	3
On convex holes in d-dimensional point sets	3
Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems	3
Off-diagonal book Ramsey numbers	3
Poset Ramsey numbers: large Boolean lattice versus a fixed poset	3
Cycle partitions of regular graphs	3
Large complete minors in random subgraphs	3
The chromatic profile of locally colourable graphs	3
Strong complete minors in digraphs	2
Universal and unavoidable graphs	2
On the exponential growth rates of lattice animals and interfaces	2
Counting matchings via capacity-preserving operators	2
Height function localisation on trees	2
Many Turán exponents via subdivisions	2
On the smallest singular value of symmetric random matrices	2
Lipschitz bijections between boolean functions	2
On deficiency problems for graphs	2
Spanning -cycles in random graphs	2
On the number of Hadamard matrices via anti-concentration	2
A smoother notion of spread hypergraphs	2
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs	2
Towards the 0-statement of the Kohayakawa-Kreuter conjecture	2
Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph	2
New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs	2
Brownian bridge expansions for Lévy area approximations and particular values of the Riemann zeta function	2
The critical mean-field Chayes–Machta dynamics	2
Near-perfect clique-factors in sparse pseudorandom graphs	2
The critical window in random digraphs	2
The bunkbed conjecture holds in the limit	2
On oriented cycles in randomly perturbed digraphs	2
A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles	2
Community detection and percolation of information in a geometric setting	2
Maximal chordal subgraphs	1
The codegree Turán density of tight cycles minus one edge	1
Intersecting families without unique shadow	1
Disjointness graphs of segments in the space	1
Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings	1
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree	1
Transversal C_k-factors in subgraphs of the balanced blow-up of C_k	1
A bipartite version of the Erdős–McKay conjecture	1
On the size of maximal intersecting families	1
Distribution of tree parameters by martingale approach	1

Fluctuations of subgraph counts in graphon based random graphs	1
Complete subgraphs in a multipartite graph	1
On the number of error correcting codes	1
Ramsey-type numbers involving graphs and hypergraphs with large girth	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
Extending the Tutte and Bollobás–Riordan polynomials to rank 3 weakly coloured stranded graphs	1
Perfect matchings, rank of connection tensors and graph homomorphisms	1
Extremal problems for GCDs	1
The distance profile of rooted and unrooted simply generated trees	1
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers	1
Degree sequences of sufficiently dense random uniform hypergraphs	1
Large N behaviour of the two-dimensional Yang–Mills partition function	1
On the zeroes of hypergraph independence polynomials	1
Approximately symmetric forms far from being exactly symmetric	1
Many Hamiltonian subsets in large graphs with given density	1
Spanning trees in random regular uniform hypergraphs	1
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree	1
On the peel number and the leaf-height of Galton–Watson trees	1
Unimodular random one-ended planar graphs are sofic	1
Problems and results on 1-cross-intersecting set pair systems	1
New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers	1
The diameter of the uniform spanning tree of dense graphs	1
Improved bound for improper colourings of graphs with no odd clique minor	1
Percolation on irregular high-dimensional product graphs	1
Polynomials over structured grids	1
Unavoidable patterns in locally balanced colourings	1
On symmetric intersecting families of vectors	1
On the edit distance function of the random graph	1
Approximate discrete entropy monotonicity for log-concave sums	1