Combinatorics Probability & Computing

Article	Citations
On the maximum number of edges in -critical graphs	11
A generalization of Bondy’s pancyclicity theorem	7
A blurred view of Van der Waerden type theorems	7
Essential covers of the hypercube require many hyperplanes	7
A bipartite version of the Erdős–McKay conjecture	7
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics	7
Ramsey upper density of infinite graphs	6
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs	6
Vertex-critical graphs far from edge-criticality	6
Unimodular random one-ended planar graphs are sofic	6
A generalisation of Varnavides’s theorem	6
The distribution of the maximum protection number in simply generated trees	5
Disperse hypergraphs	5
Hypergraph independence polynomials with a zero close to the origin	4
On the size of maximal intersecting families	4
On perfect subdivision tilings	4
Bipartite-ness under smooth conditions	4
Critical configurations of the hard-core model on square grid graphs	4
Threshold graphs maximise homomorphism densities	4
On random walks and switched random walks on homogeneous spaces	4
Transversal Ck-factors in subgraphs of the balanced blow-up of Ck	4
The chromatic profile of locally colourable graphs	3
Sampling repulsive Gibbs point processes using random graphs	3
On approximability of satisfiable $\boldsymbol {k}$ -CSPs: II	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
Random feedback shift registers and the limit distribution for largest cycle lengths	3
A stability theorem for multi-partite graphs	2
Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph	2
Refined universality for critical KCM: lower bounds	2
Saturation in random hypergraphs	2
Removal lemmas and approximate homomorphisms	2
Sharp bounds for a discrete John’s theorem	2
Product structure of graph classes with bounded treewidth	2
Supercritical site percolation on the hypercube: small components are small	2
Poset Ramsey numbers: large Boolean lattice versus a fixed poset	2
Noise sensitivity of the minimum spanning tree of the complete graph	2
Unavoidable patterns in locally balanced colourings	2
Distribution of tree parameters by martingale approach	2
Many Hamiltonian subsets in large graphs with given density	2
On minimum spanning trees for random Euclidean bipartite graphs	2
Clique-factors in graphs with sublinear -independence number	2
Hypergraphs without non-trivial intersecting subgraphs	2
The critical mean-field Chayes–Machta dynamics	2
Embedding nearly spanning trees	2
Algorithms for the ferromagnetic Potts model on expanders	2
On the zeroes of hypergraph independence polynomials	2
Approximation of subgraph counts in the uniform attachment model	2
Expected number of faces in a random embedding of any graph is at most linear	2
Powers of Hamilton cycles in oriented and directed graphs	2
Forcing generalised quasirandom graphs efficiently	2
On the exponential growth rates of lattice animals and interfaces	2
A note on the computational complexity of weak saturation	1
Tree universality in positional games	1
Problems and results on 1-cross-intersecting set pair systems	1
Universal geometric graphs	1
Polynomials over structured grids	1
Improved lower bound for the list chromatic number of graphs with no Kt minor	1
A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree	1
Sandwiching biregular random graphs	1
Mastermind with a linear number of queries	1
Spanning -cycles in random graphs	1
Hamiltonicity of sparse pseudorandom graphs	1
Beyond the broken tetrahedron	1
Maximum chordal subgraphs of random graphs	1
On the size-Ramsey number of grids	1
A conditional lower bound for the Turán number of spheres	1
On oriented cycles in randomly perturbed digraphs	1
A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs	1
Colouring random subgraphs	1
Short proof of the hypergraph container theorem	1
Ramsey simplicity of random graphs	1
The full rank condition for sparse random matrices	1
Structural convergence and algebraic roots	1
Percolation on irregular high-dimensional product graphs	1

Comparing the sets of volume polynomials and Lorentzian polynomials	1
On the smallest singular value of symmetric random matrices	1
Maximal chordal subgraphs	1
Couplings and Poisson approximation for stabilising functionals of determinantal point processes	0
Approximate discrete entropy monotonicity for log-concave sums	0
Colouring graphs with forbidden bipartite subgraphs	0
Towards the 0-statement of the Kohayakawa-Kreuter conjecture	0
A note on extremal constructions for the Erdős–Rademacher problem	0
Height function localisation on trees	0
Counting spanning subgraphs in dense hypergraphs	0
On the peel number and the leaf-height of Galton–Watson trees	0
Complete subgraphs in a multipartite graph	0
Central limit theorem for components in meandric systems through high moments	0
Twin-width of sparse random graphs	0
Community detection and percolation of information in a geometric setting	0
Cokernel statistics for walk matrices of directed and weighted random graphs	0
Subspace coverings with multiplicities	0
The Excluded Tree Minor Theorem Revisited	0
On the number of error correcting codes	0
Abelian groups from random hypergraphs	0
Counting independent sets in structured graphs	0
Spanning trees in graphs without large bipartite holes	0
Quasipolynomial-time algorithms for Gibbs point processes	0
Sparse recovery properties of discrete random matrices	0
Fluctuations of subgraph counts in graphon based random graphs	0
Behaviour of the minimum degree throughout the ${\textit{d}}$ -process	0
On tripartite common graphs	0
Off-diagonal book Ramsey numbers	0
Tight Hamilton cycles with high discrepancy	0
Optimal mixing via tensorization for random independent sets on arbitrary trees	0
Subgraph densities in a surface	0
Large monochromatic components in expansive hypergraphs	0
Convergence of blanket times for sequences of random walks on critical random graphs	0
Turán problems in pseudorandom graphs	0
Satisfiability thresholds for regular occupation problems	0
Approximately symmetric forms far from being exactly symmetric	0
Embedding theorems for random graphs with specified degrees	0
On the smallest gap in a sequence with Poisson pair correlations	0
Random embeddings of bounded-degree trees with optimal spread	0
Intersecting families without unique shadow	0
On the Ramsey numbers of daisies I	0
The Bernoulli clock: probabilistic and combinatorial interpretations of the Bernoulli polynomials by circular convolution	0
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree	0
Partial recovery and weak consistency in the non-uniform hypergraph stochastic block model	0
On the Ramsey numbers of daisies II	0
New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers	0
Antidirected subgraphs of oriented graphs	0
The codegree Turán density of tight cycles minus one edge	0
The bunkbed conjecture holds in the limit	0
A note on digraph splitting	0
The diameter of the uniform spanning tree of dense graphs	0
Small subsets with large sumset: Beyond the Cauchy–Davenport bound	0
Spanning subdivisions in Dirac graphs	0
A class of graphs of zero Turán density in a hypercube	0
Common pairs of graphs	0
A new formula for the determinant and bounds on its tensor and Waring ranks	0
Brownian bridge expansions for Lévy area approximations and particular values of the Riemann zeta function	0
Improved bound for improper colourings of graphs with no odd clique minor	0
On mappings on the hypercube with small average stretch	0
List packing number of bounded degree graphs	0
Degree sequences of sufficiently dense random uniform hypergraphs	0
A large deviation principle for block models	0
A smoother notion of spread hypergraphs	0
A BK inequality for random matchings	0
A spanning bandwidth theorem in random graphs	0
Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers	0
Polarised random -SAT	0
Convergence of the QuickVal residual	0
Many Turán exponents via subdivisions	0
Glauber dynamics for the hard-core model on bounded-degree $H$ -free graphs	0
Long induced paths in expanders	0
On the choosability of -minor-free graphs	0
Expansion of the critical intensity for the random connection model	0
Tight bound for the Erdős–Pósa property of tree minors	0
Archaeology of random recursive dags and Cooper-Frieze random networks	0
Triangles in randomly perturbed graphs	0
An explicit economical additive basis	0
Extending Wormald’s differential equation method to one-sided bounds	0
Multiple random walks on graphs: mixing few to cover many	0
Short proofs for long induced paths	0

On a conjecture of Conlon, Fox, and Wigderson	0
Large cliques or cocliques in hypergraphs with forbidden order-size pairs	0
The List-Ramsey threshold for families of graphs	0
Irregular subgraphs	0
Face enumeration for split matroid polytopes	0
Spread-out limit of the critical points for lattice trees and lattice animals in dimensions	0
Noisy group testing via spatial coupling	0
Proper minor-closed classes of graphs have Assouad–Nagata dimension 2	0
Noise sensitivity on affine Weyl groups	0
On the size of temporal cliques in subcritical random temporal graphs	0
Independent sets of a given size and structure in the hypercube	0