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

Article	Citations
Eigenvalues and triangles in graphs	40
Spectral gap in random bipartite biregular graphs and applications	11
Tail bounds on hitting times of randomized search heuristics using variable drift analysis	11
Optimal group testing	10
Ramsey properties of randomly perturbed graphs: cliques and cycles	10
Pseudorandom hypergraph matchings	8
Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties	7
On the Erdős–Sós conjecture for trees with bounded degree	7
Concentration functions and entropy bounds for discrete log-concave distributions	7
A discrepancy version of the Hajnal–Szemerédi theorem	6
Card guessing with partial feedback	6
Finding independent transversals efficiently	5
Full rainbow matchings in graphs and hypergraphs	5
Tree limits and limits of random trees	5
Clustered 3-colouring graphs of bounded degree	5
Making K_r+1-free graphs r-partite	5
Covering and tiling hypergraphs with tight cycles	4
Powers of paths in tournaments	4
Triangles in randomly perturbed graphs	4
Large triangle packings and Tuza’s conjecture in sparse random graphs	4
Colouring graphs with forbidden bipartite subgraphs	4
On the mixing time of coordinate Hit-and-Run	4
On the size-Ramsey number of grid graphs	4
On minimal Ramsey graphs and Ramsey equivalence in multiple colours	4
Mixing properties of colourings of the ℤ^d lattice	4

Improved lower bound for the list chromatic number of graphs with no K_t minor	4
Refined universality for critical KCM: lower bounds	4
Lower bound on the size of a quasirandom forcing set of permutations	4
Hamiltonicity in random directed graphs is born resilient	4
On Turán exponents of bipartite graphs	4
Turán-type results for intersection graphs of boxes	3
On tripartite common graphs	3
Clustered colouring of graph classes with bounded treedepth or pathwidth	3
The chromatic profile of locally colourable graphs	3
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques	3
Pointer chasing via triangular discrimination	3
Singularity of sparse random matrices: simple proofs	3
Monochromatic cycle partitions in random graphs	3
Irregular subgraphs	3
On finite sets of small tripling or small alternation in arbitrary groups	3
Supersaturation of even linear cycles in linear hypergraphs	3
Cycle partitions of regular graphs	3
On the structure of Dense graphs with bounded clique number	3
The power of two choices for random walks	3
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs	3
Sampling biased monotonic surfaces using exponential metrics	3
Off-diagonal book Ramsey numbers	3
A note on distinct distances	2
Frozen (Δ + 1)-colourings of bounded degree graphs	2
Community detection and percolation of information in a geometric setting	2
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs	2
Brownian bridge expansions for Lévy area approximations and particular values of the Riemann zeta function	2
Universal and unavoidable graphs	2
On the number of Hadamard matrices via anti-concentration	2
Counting matchings via capacity-preserving operators	2
Estimating parameters associated with monotone properties	2
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs	2
Expansion for the critical point of site percolation: the first three terms	2
A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles	2
The length of an s-increasing sequence of r-tuples	2
Subgraph densities in a surface	2
Lipschitz bijections between boolean functions	2
On deficiency problems for graphs	2
On the exponential growth rates of lattice animals and interfaces	2
On convex holes in d-dimensional point sets	2
The critical window in random digraphs	2
A non-increasing tree growth process for recursive trees and applications	2
Many Turán exponents via subdivisions	2
Towards the 0-statement of the Kohayakawa-Kreuter conjecture	2
On the smallest singular value of symmetric random matrices	2
Poset Ramsey numbers: large Boolean lattice versus a fixed poset	2
Independent sets of a given size and structure in the hypercube	2
New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs	2
Robustness of randomized rumour spreading	2
Large complete minors in random subgraphs	2

Near-perfect clique-factors in sparse pseudorandom graphs	2
Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems	2
Short proofs for long induced paths	2
Archaeology of random recursive dags and Cooper-Frieze random networks	1
Dirac’s theorem for random regular graphs	1
Improved Ramsey-type results for comparability graphs	1
Product structure of graph classes with bounded treewidth	1
Breaking bivariate records	1
Strong complete minors in digraphs	1
The critical mean-field Chayes–Machta dynamics	1
Transversal C_k-factors in subgraphs of the balanced blow-up of C_k	1
Large N behaviour of the two-dimensional Yang–Mills partition function	1
A bipartite version of the Erdős–McKay conjecture	1
Hamiltonian Berge cycles in random hypergraphs	1
The bunkbed conjecture holds in the limit	1
Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph	1
On the edit distance function of the random graph	1
Independent dominating sets in graphs of girth five	1
Approximately counting bases of bicircular matroids	1
Intersecting families without unique shadow	1
Disjointness graphs of segments in the space	1
Spanning -cycles in random graphs	1
Resilience of the rank of random matrices	1
The diameter of the uniform spanning tree of dense graphs	1
Distribution of tree parameters by martingale approach	1
Improved bound for improper colourings of graphs with no odd clique minor	1
Fluctuations of subgraph counts in graphon based random graphs	1
Complete subgraphs in a multipartite graph	1
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree	1
On the number of error correcting codes	1
Spanning trees in random regular uniform hypergraphs	1
Problems and results on 1-cross-intersecting set pair systems	1
Unimodular random one-ended planar graphs are sofic	1
Extending the Tutte and Bollobás–Riordan polynomials to rank 3 weakly coloured stranded graphs	1
Extremal problems for GCDs	1
A smoother notion of spread hypergraphs	1
Polynomials over structured grids	1
The distance profile of rooted and unrooted simply generated trees	1
On oriented cycles in randomly perturbed digraphs	1
The minimum perfect matching in pseudo-dimension 0 < q < 1	1
Approximately symmetric forms far from being exactly symmetric	1
A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy	1