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 2020-05-01 to 2024-05-01.)
ArticleCitations
Cycle Lengths in Expanding Graphs13
Stack-Number is Not Bounded by Queue-Number10
More on the Extremal Number of Subdivisions10
Explicit Expanders of Every Degree and Size10
Separating Polynomial $$\chi $$-Boundedness from $$\chi $$-Boundedness9
Generalising the Scattered Property of Subspaces8
A Finitary Structure Theorem for Vertex-Transitive Graphs of Polynomial Growth7
On the Directions Determined by a Cartesian Product in an Affine Galois Plane7
Tournament Quasirandomness from Local Counting7
Euler Tours in Hypergraphs6
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path6
Ramsey Numbers of Books and Quasirandomness5
Equiangular Lines in Low Dimensional Euclidean Spaces5
Probabilistic Refinement of the Asymptotic Spectrum of Graphs5
The Characteristic Polynomial of a Random Matrix5
Expander Graphs — Both Local and Global5
Higher Convexity and Iterated Sum Sets4
Expanding Polynomials: A Generalization of the Elekes-Rónyai Theorem to d Variables4
A Hypergraph Turán Problem with No Stability4
Pure Pairs. II. Excluding All Subdivisions of A Graph4
On the Asymptotic Confirmation of the Faudree–Lehel Conjecture for General Graphs4
Beating the Probabilistic Lower Bound on q-Perfect Hashing4
Resolving The Hamiltonian Problem for Vertex-Transitive Graphs of Order a Product of Two Primes4
A Large Family of Maximum Scattered Linear Sets of $${{\,\mathrm{{PG}}\,}}(1,q^n)$$ and Their Associated MRD Codes4
Big Ramsey Degrees of 3-Uniform Hypergraphs Are Finite4
The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree4
On the Density of C7-Critical Graphs4
Impartial Digraphs3
Bipartite Turán Problems for Ordered Graphs3
On an Application of Higher Energies to Sidon Sets3
Patterns in Random Permutations3
On the Number of Fixed Points of Automorphisms of Vertex-Transitive Graphs3
An Analytic Approach to Cardinalities of Sumsets3
A Cap Covering Theorem3
The Chromatic Number of the Product of 14-Chromatic Graphs Can BE 133
Note on the Number of Hinges Defined by a Point Set in ℝ23
Detecting a Long Odd Hole3
Persistent Graphs and Cyclic Polytope Triangulations3
Algebraic Constructions of Complete m-Arcs3
Non-Bipartite K-Common Graphs3
Countable Ordinals and Big Ramsey Degrees3
A Family of Balanced Generalized Weighing Matrices2
Strongest Transformations2
On Non-Empty Cross-Intersecting Families2
Treedepth vs Circumference2
Boolean Dimension and Tree-Width2
The Edge-Erdős-Pósa Property2
Maximal Digraphs with Respect to Primitive Positive Constructability2
Vertex-Coloring Graphs with 4-Edge-Weightings2
The Number of Maximal Independent Sets in the Hamming Cube2
1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio2
Fractional Isomorphism of Graphons2
On Bounded Degree Graphs with Large Size-Ramsey Numbers2
Minimum Degree Stability of H-Free Graphs2
Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs2
Weakly Norming Graphs are Edge-Transitive2
Base Partition for Mixed Families of Finitary and Cofinitary Matroids2
Excluding a Ladder2
Asymptotics of the Hypergraph Bipartite Turán Problem2
An Improved Bound for the Linear Arboricity Conjecture2
New Results on Simplex-Clusters in Set Systems2
Seymour’s Conjecture on 2-Connected Graphs of Large Pathwidth2
Substitutive Systems and a Finitary Version of Cobham’s Theorem2
0.058295965194702