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

Article	Citations
Eigenvalues and triangles in graphs	44
Spectral gap in random bipartite biregular graphs and applications	12
Tail bounds on hitting times of randomized search heuristics using variable drift analysis	12
Optimal group testing	10
Ramsey properties of randomly perturbed graphs: cliques and cycles	10
Pseudorandom hypergraph matchings	9
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
Covering and tiling hypergraphs with tight cycles	5
Clustered 3-colouring graphs of bounded degree	5
Making K_r+1-free graphs r-partite	5
Powers of paths in tournaments	5
Triangles in randomly perturbed graphs	5
Finding independent transversals efficiently	5
Full rainbow matchings in graphs and hypergraphs	5
Tree limits and limits of random trees	5
On the size-Ramsey number of grid graphs	4
Hamiltonicity in random directed graphs is born resilient	4
Colouring graphs with forbidden bipartite subgraphs	4
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques	4
On the mixing time of coordinate Hit-and-Run	4
Lower bound on the size of a quasirandom forcing set of permutations	4

Large triangle packings and Tuza’s conjecture in sparse random graphs	4
On Turán exponents of bipartite graphs	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
On tripartite common graphs	4
Mixing properties of colourings of the ℤ^d lattice	4
Supersaturation of even linear cycles in linear hypergraphs	4
Pointer chasing via triangular discrimination	3
Poset Ramsey numbers: large Boolean lattice versus a fixed poset	3
Singularity of sparse random matrices: simple proofs	3
On the structure of Dense graphs with bounded clique number	3
Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs	3
Sampling biased monotonic surfaces using exponential metrics	3
The length of an s-increasing sequence of r-tuples	3
Subgraph densities in a surface	3
Monochromatic cycle partitions in random graphs	3
Irregular subgraphs	3
On finite sets of small tripling or small alternation in arbitrary groups	3
Off-diagonal book Ramsey numbers	3
Turán-type results for intersection graphs of boxes	3
Cycle partitions of regular graphs	3
The power of two choices for random walks	3
Clustered colouring of graph classes with bounded treedepth or pathwidth	3
The chromatic profile of locally colourable graphs	3
Universal and unavoidable graphs	2
On convex holes in d-dimensional point sets	2
Counting matchings via capacity-preserving operators	2
A non-increasing tree growth process for recursive trees and applications	2
Many Turán exponents via subdivisions	2
Expansion for the critical point of site percolation: the first three terms	2
Frozen (Δ + 1)-colourings of bounded degree graphs	2
On the smallest singular value of symmetric random matrices	2
Dirac’s theorem for random regular graphs	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
On the exponential growth rates of lattice animals and interfaces	2
Near-perfect clique-factors in sparse pseudorandom graphs	2
The critical window in random digraphs	2
Short proofs for long induced paths	2
Towards the 0-statement of the Kohayakawa-Kreuter conjecture	2
A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy	2
Community detection and percolation of information in a geometric setting	2
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs	2
Strong complete minors in digraphs	2
On deficiency problems for graphs	2
On the number of Hadamard matrices via anti-concentration	2
Large complete minors in random subgraphs	2
Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems	2
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs	2
A note on distinct distances	2

A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles	2
Independent sets of a given size and structure in the hypercube	2
Lipschitz bijections between boolean functions	2
Robustness of randomized rumour spreading	2