Combinatorica

Papers
(The TQCC of Combinatorica is 3. 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 2022-06-01 to 2026-06-01.)
ArticleCitations
Large Independent Sets from Local Considerations24
Signed graphs with the same even cycles14
Turán Density of Long Tight Cycle Minus One Hyperedge13
Simplicial Spanning Trees in Random Steiner Complexes11
A Characterization of Graphs Whose Small Powers of Their Edge Ideals Have a Linear Free Resolution9
A Refutation of the Pach-Tardos Conjecture for 0–1 Matrices9
Erratum to: Arc Connectivity and Submodular Flows in Digraphs8
A Lower Bound for Essential Covers of the Cube8
Maximal 3-Wise Intersecting Families8
A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions7
Bound on Shortest Cycle Covers7
Finding Certain Arithmetic Progressions in 2-Coloured Cyclic Groups6
Exact Results on Traces of Sets6
On the Chevalley-Warning Theorem When the Degree Equals the Number of Variables6
Counting Perfect Matchings in Dirac Hypergraphs6
Finding a Shortest Non-Zero Path in Group-Labeled Graphs6
Two Disjoint Alternating Paths in Bipartite Graphs: Conformal Crosses6
Small Subgraphs with Large Average Degree5
A Whitney Type Theorem for Surfaces: Characterising Graphs with Locally Planar Embeddings5
Asymptotics of the Hypergraph Bipartite Turán Problem5
Polynomial Schur’s Theorem5
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs5
On the Density of Critical Graphs with No Large Cliques5
The Ungar Games5
Asymptotic Enumeration of Haar Graphical Representations5
Tangle-tree duality in infinite graphs5
Pure Pairs. VIII. Excluding a Sparse Graph5
Writing Finite Simple Groups of Lie Type as Products of Subset Conjugates4
Balanced Subdivisions of Cliques in Graphs4
Sets of r-Graphs that Color All r-Graphs4
Voltage Operations on Maniplexes, Polytopes and Maps4
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path4
Storage Codes on Coset Graphs with Asymptotically Unit Rate4
A Structural Theorem for Sets with Few Triangles4
Local h-polynomials, Uniform Triangulations and Real-rootedness4
Weak saturation rank: a failure of the linear algebraic approach to weak saturation4
Constructing New Geometries: A Generalized Approach to Halving for Hypertopes4
Vertex-Coloring Graphs with 4-Edge-Weightings4
Neighborhood Complexity of Planar Graphs4
A Topological Version of Hedetniemi’s Conjecture for Equivariant Spaces3
Turán Problems for Expanded Hypergraphs3
Small Families of Partially Shattering Permutations3
Uniacute Spherical Codes3
A Group Ring Approach to Fuglede’s Conjecture in Cyclic Groups3
Any Two-Coloring of the Plane Contains Monochromatic 3-Term Arithmetic Progressions3
Extension Property for Partial Automorphisms of the n-partite and Semigeneric Tournaments3
Upper Bounds For Families Without Weak Delta-Systems3
A Hypergraph Analog of Dirac’s Theorem for Long Cycles in 2-Connected Graphs3
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path3
Ruzsa’s Problem on Bi-Sidon Sets3
Packing Directed Cycles Quarter- and Half-Integrally3
Triangles and Vitali Sets3
Hamming Sandwiches3
A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt3
Topology of Independence Complexes and Cycle Structure of Hypergraphs3
A Characterisation of Graphs Quasi-isometric to $$K_4$$-minor-free Graphs3
Improved Lower Bound Towards Chen–Chvátal Conjecture3
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs3
Component Games on Random Graphs3
0.024706840515137