Combinatorica

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-09-01 to 2025-09-01.)
ArticleCitations
Large Independent Sets from Local Considerations21
Erratum to: Arc Connectivity and Submodular Flows in Digraphs12
Signed graphs with the same even cycles12
Simplicial Spanning Trees in Random Steiner Complexes10
Turán Density of Long Tight Cycle Minus One Hyperedge9
A Characterization of Graphs Whose Small Powers of Their Edge Ideals Have a Linear Free Resolution8
Finding a Shortest Non-Zero Path in Group-Labeled Graphs7
A Lower Bound for Essential Covers of the Cube7
Polynomial Schur’s Theorem7
The Ramsey Properties for Grassmannians Over ℝ, ℂ7
A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions7
Maximal 3-Wise Intersecting Families7
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs6
Finding Certain Arithmetic Progressions in 2-Coloured Cyclic Groups6
On the Chevalley-Warning Theorem When the Degree Equals the Number of Variables6
On the Density of Critical Graphs with No Large Cliques5
Small Subgraphs with Large Average Degree5
The Ungar Games5
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path5
Balanced Subdivisions of Cliques in Graphs5
Pure Pairs. VIII. Excluding a Sparse Graph4
Constructing New Geometries: A Generalized Approach to Halving for Hypertopes4
Asymptotics of the Hypergraph Bipartite Turán Problem4
A Whitney Type Theorem for Surfaces: Characterising Graphs with Locally Planar Embeddings4
Writing Finite Simple Groups of Lie Type as Products of Subset Conjugates4
Storage Codes on Coset Graphs with Asymptotically Unit Rate4
Big Ramsey Degrees of 3-Uniform Hypergraphs Are Finite4
Neighborhood Complexity of Planar Graphs4
The Number of Maximal Independent Sets in the Hamming Cube3
Kempe Equivalence Classes of Cubic Graphs Embedded on the Projective Plane3
Hamming Sandwiches3
A Hypergraph Turán Problem with No Stability3
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path3
A Topological Version of Hedetniemi’s Conjecture for Equivariant Spaces3
Upper Bounds For Families Without Weak Delta-Systems3
A Structural Theorem for Sets with Few Triangles3
Local h-polynomials, Uniform Triangulations and Real-rootedness3
A Hypergraph Analog of Dirac’s Theorem for Long Cycles in 2-Connected Graphs3
Turán Problems for Expanded Hypergraphs3
Component Games on Random Graphs3
Voltage Operations on Maniplexes, Polytopes and Maps3
Sets of r-Graphs that Color All r-Graphs3
Vertex-Coloring Graphs with 4-Edge-Weightings3
A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt3
Convergence and Limits of Finite Trees3
Uniacute Spherical Codes3
Tight Bounds Towards a Conjecture of Gallai2
On the Inverse Problem of the k-th Davenport Constants for Groups of Rank 22
A Large Family of Maximum Scattered Linear Sets of $${{\,\mathrm{{PG}}\,}}(1,q^n)$$ and Their Associated MRD Codes2
On an Application of Higher Energies to Sidon Sets2
A New Bound for the Fourier-Entropy-Influence Conjecture2
Any Two-Coloring of the Plane Contains Monochromatic 3-Term Arithmetic Progressions2
The Characteristic Polynomial of a Random Matrix2
Calculating the Euler Characteristic of the Moduli Space of Curves2
Ruzsa’s Problem on Bi-Sidon Sets2
On the Critical Exponent for k-Primitive Sets2
A Generalization of the Chevalley–Warning and Ax–Katz Theorems with a View Towards Combinatorial Number Theory2
A Book Proof of the Middle Levels Theorem2
Even Maps, the Colin de Verdière Number and Representations of Graphs2
Gadget Construction and Structural Convergence2
Second-Order Bounds on Correlations Between Increasing Families2
Isomorphisms Between Dense Random Graphs2
Ramsey Numbers of Books and Quasirandomness2
Packing Directed Cycles Quarter- and Half-Integrally2
$$\Gamma $$-Graphic Delta-Matroids and Their Applications2
Links and the Diaconis–Graham Inequality2
On the Number of Digons in Arrangements of Pairwise Intersecting Circles2
The Number of Topological Types of Trees2
Arc Connectivity and Submodular Flows in Digraphs2
List-Avoiding Orientations2
L-Systems and the Lovász Number2
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs2
A Group Ring Approach to Fuglede’s Conjecture in Cyclic Groups2
Improved Lower Bound Towards Chen–Chvátal Conjecture2
Algebraic Constructions of Complete m-Arcs2
0.091310024261475