Combinatorics Probability & Computing

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-05-01 to 2025-05-01.)
ArticleCitations
Triangle-free subgraphs with large fractional chromatic number20
A blurred view of Van der Waerden type theorems9
On Turán exponents of bipartite graphs8
On the maximum number of edges in -critical graphs8
A bipartite version of the Erdős–McKay conjecture6
A generalization of Bondy’s pancyclicity theorem6
Ramsey upper density of infinite graphs5
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree5
Essential covers of the hypercube require many hyperplanes5
Vertex-critical graphs far from edge-criticality5
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics5
A generalisation of Varnavides’s theorem5
Bipartite-ness under smooth conditions4
The distribution of the maximum protection number in simply generated trees4
Spectral gap in random bipartite biregular graphs and applications4
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs4
Hypergraph independence polynomials with a zero close to the origin4
Unimodular random one-ended planar graphs are sofic4
On random walks and switched random walks on homogeneous spaces3
Critical configurations of the hard-core model on square grid graphs3
On the size of maximal intersecting families3
On the exponential growth rates of lattice animals and interfaces3
Threshold graphs maximise homomorphism densities3
The chromatic profile of locally colourable graphs3
Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems3
Clustered colouring of graph classes with bounded treedepth or pathwidth3
On perfect subdivision tilings3
Transversal Ck-factors in subgraphs of the balanced blow-up of Ck3
Sampling repulsive Gibbs point processes using random graphs3
Random feedback shift registers and the limit distribution for largest cycle lengths3
Removal lemmas and approximate homomorphisms2
Unavoidable patterns in locally balanced colourings2
Expansion for the critical point of site percolation: the first three terms2
Card guessing with partial feedback2
Noise sensitivity of the minimum spanning tree of the complete graph2
Forcing generalised quasirandom graphs efficiently2
Product structure of graph classes with bounded treewidth2
Expected number of faces in a random embedding of any graph is at most linear2
On minimum spanning trees for random Euclidean bipartite graphs2
Large N behaviour of the two-dimensional Yang–Mills partition function2
Clique-factors in graphs with sublinear -independence number2
Strong complete minors in digraphs2
The critical mean-field Chayes–Machta dynamics2
Supercritical site percolation on the hypercube: small components are small2
On bucket increasing trees, clustered increasing trees and increasing diamonds2
Many Hamiltonian subsets in large graphs with given density2
Distribution of tree parameters by martingale approach2
Poset Ramsey numbers: large Boolean lattice versus a fixed poset2
Hypergraphs without non-trivial intersecting subgraphs2
Sharp bounds for a discrete John’s theorem2
Algorithms for the ferromagnetic Potts model on expanders2
Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph2
0.041923046112061