OOIR: Observatory of International Research

Papers

(The TQCC of Combinatorica 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-03-01 to 2025-03-01.)

Article	Citations
Upper Tail Behavior of the Number of Triangles in Random Graphs with Constant Average Degree	12
Bounding the Chromatic Number of Dense Digraphs by Arc Neighborhoods	11
Large Independent Sets from Local Considerations	10
Hamming Sandwiches	9
Defective Coloring is Perfect for Minors	8
Simplicial Spanning Trees in Random Steiner Complexes	7
Constructing Tree-Decompositions That Display All Topological Ends	7
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs	7
A Short Proof of the Blow-Up Lemma for Approximate Decompositions	7
Bounds on the Number of Compatible k-Simplices Matching the Orientation of the (k − 1)-Skeleton of a Simplex	6
Upper Bounds For Families Without Weak Delta-Systems	6
Convergence and Limits of Finite Trees	6
Maximal Digraphs with Respect to Primitive Positive Constructability	5
A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt	5
An Explicit Infinite Family of $$\mathbb{M}$$-Vertex Graphs with Maximum Degree K and Diameter $$\left[ {1 + o\left( 1 \right)} \right]{\log _{K - 1}\mathbb{M}}$$ for Each K − 1 a Prime Power	5
A Hypergraph Turán Problem with No Stability	5
A Topological Version of Hedetniemi’s Conjecture for Equivariant Spaces	5
Stack-Number is Not Bounded by Queue-Number	5
A Characterization of Graphs Whose Small Powers of Their Edge Ideals Have a Linear Free Resolution	5
Kempe Equivalent List Colorings	4
On the Density of C7-Critical Graphs	4
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number	4
Pure Pairs. V. Excluding Some Long Subdivision	4
Vertex-Minor-Closed Classes are χ-Bounded	4
Pure Pairs. II. Excluding All Subdivisions of A Graph	4

Boolean Function Analysis on High-Dimensional Expanders	3
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path	3
Erratum to: Arc Connectivity and Submodular Flows in Digraphs	3
Turán Density of Long Tight Cycle Minus One Hyperedge	3
6-Uniform Maker-Breaker Game is PSPACE-Complete	3
The Sandpile Group of a Trinity and a Canonical Definition for the Planar Bernardi Action	3
Minimum Degree Stability of H-Free Graphs	3
Substitutive Systems and a Finitary Version of Cobham’s Theorem	3
Resolving The Hamiltonian Problem for Vertex-Transitive Graphs of Order a Product of Two Primes	3
The Ramsey Properties for Grassmannians Over ℝ, ℂ	3
A Local Version of Katona’s Intersecting Shadow Theorem	2
Maximal 3-Wise Intersecting Families	2
Perfect Matchings in Random Sparsifications of Dirac Hypergraphs	2
An Analytic Approach to Cardinalities of Sumsets	2
Probabilistic Refinement of the Asymptotic Spectrum of Graphs	2
Separating Polynomial $$\chi $$-Boundedness from $$\chi $$-Boundedness	2
Integer Multiflows in Acyclic Planar Digraphs	2
The Excluded Minors for Embeddability into a Compact Surface	2
Kissing Numbers of Regular Graphs	2
On Bounding the Diameter of a Distance-Regular Graph	2
Spherical Two-Distance Sets and Eigenvalues of Signed Graphs	2
Log-Concavity in Planar Random Walks	2
Uniacute Spherical Codes	2
Bounded Cutoff Window for the Non-backtracking Random Walk on Ramanujan Graphs	2
The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree	2
Prague Dimension of Random Graphs	2
A Necessary and Sufficient Condition for $$(2d-2)$$-Transversals in $$\mathbb {R}^{2d}$$	2
A Solution to Babai’s Problems on Digraphs with Non-diagonalizable Adjacency Matrix	2
On the Critical Exponent for k-Primitive Sets	2
Routing Permutations on Spectral Expanders via Matchings	2
Component Games on Random Graphs	2
Erratum to: High Order Random Walks: Beyond Spectral Gap	2