Combinatorica

Papers
(The median citation count of Combinatorica is 1. 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-11-01 to 2024-11-01.)
ArticleCitations
Cycle Lengths in Expanding Graphs13
More on the Extremal Number of Subdivisions12
Explicit Expanders of Every Degree and Size11
Stack-Number is Not Bounded by Queue-Number11
Generalising the Scattered Property of Subspaces10
A Finitary Structure Theorem for Vertex-Transitive Graphs of Polynomial Growth9
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path9
Separating Polynomial $$\chi $$-Boundedness from $$\chi $$-Boundedness8
A Large Family of Maximum Scattered Linear Sets of $${{\,\mathrm{{PG}}\,}}(1,q^n)$$ and Their Associated MRD Codes7
Equiangular Lines in Low Dimensional Euclidean Spaces7
Higher Convexity and Iterated Sum Sets7
On the Directions Determined by a Cartesian Product in an Affine Galois Plane7
Tournament Quasirandomness from Local Counting7
On an Application of Higher Energies to Sidon Sets6
The Characteristic Polynomial of a Random Matrix6
On the Density of C7-Critical Graphs6
On the Asymptotic Confirmation of the Faudree–Lehel Conjecture for General Graphs5
Probabilistic Refinement of the Asymptotic Spectrum of Graphs5
Beating the Probabilistic Lower Bound on q-Perfect Hashing5
Pure Pairs. II. Excluding All Subdivisions of A Graph5
Ramsey Numbers of Books and Quasirandomness5
Resolving The Hamiltonian Problem for Vertex-Transitive Graphs of Order a Product of Two Primes5
Big Ramsey Degrees of 3-Uniform Hypergraphs Are Finite4
Bipartite Turán Problems for Ordered Graphs4
The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree4
Non-Bipartite K-Common Graphs4
A Hypergraph Turán Problem with No Stability4
Persistent Graphs and Cyclic Polytope Triangulations3
The Chromatic Number of the Product of 14-Chromatic Graphs Can BE 133
Counting Hamilton Cycles in Dirac Hypergraphs3
Countable Ordinals and Big Ramsey Degrees3
An Analytic Approach to Cardinalities of Sumsets3
Vertex-Coloring Graphs with 4-Edge-Weightings3
A Cap Covering Theorem3
On Bounded Degree Graphs with Large Size-Ramsey Numbers3
Detecting a Long Odd Hole3
Kempe Equivalent List Colorings3
A Family of Balanced Generalized Weighing Matrices3
Algebraic Constructions of Complete m-Arcs3
On the Number of Fixed Points of Automorphisms of Vertex-Transitive Graphs3
Spherical Two-Distance Sets and Eigenvalues of Signed Graphs3
Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs3
Oriented Cycles in Digraphs of Large Outdegree2
Treedepth vs Circumference2
A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions2
Minimum Degree Stability of H-Free Graphs2
Pure Pairs. V. Excluding Some Long Subdivision2
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization — II2
Growth in Sumsets of Higher Convex Functions2
A New Upper Bound on the Chromatic Number of Graphs with No Odd Kt Minor2
A Unifying Framework for the $$\nu $$-Tamari Lattice and Principal Order Ideals in Young’s Lattice2
Fractional Isomorphism of Graphons2
An Improved Bound for the Linear Arboricity Conjecture2
New Results on Simplex-Clusters in Set Systems2
The Edge-Erdős-Pósa Property2
Maximal Digraphs with Respect to Primitive Positive Constructability2
Base Partition for Mixed Families of Finitary and Cofinitary Matroids2
Storage Codes on Coset Graphs with Asymptotically Unit Rate2
Strongest Transformations2
Generalizing Korchmáros—Mazzocca Arcs2
On Non-Empty Cross-Intersecting Families2
A Subexponential Size Triangulation of ℝPn2
Bounded VC-Dimension Implies the Schur-Erdős Conjecture2
Seymour’s Conjecture on 2-Connected Graphs of Large Pathwidth2
Substitutive Systems and a Finitary Version of Cobham’s Theorem2
The Number of Maximal Independent Sets in the Hamming Cube2
Excluding a Ladder2
Asymptotics of the Hypergraph Bipartite Turán Problem2
A Short Proof of Shih’s Isomorphism Theorem on Graphic Subspaces1
A New Family of Triangulations of ℝPd1
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 121
A Factor Matching of Optimal Tail Between Poisson Processes1
Perfect Matchings in Random Sparsifications of Dirac Hypergraphs1
On the Maximum of the Sum of the Sizes of Non-trivial Cross-Intersecting Families1
Prague Dimension of Random Graphs1
Cycle Decompositions in 3-Uniform Hypergraphs1
Turán Density of Long Tight Cycle Minus One Hyperedge1
6-Uniform Maker-Breaker Game is PSPACE-Complete1
A Positive Answer to Bárány’s Question on Face Numbers of Polytopes1
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs1
Stability Through Non-Shadows1
On Decidability of Hyperbolicity1
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path1
The VC-Dimension of K-Vertex D-Polytopes1
Improving the $$\frac{1}{3} - \frac{2}{3}$$ Conjecture for Width Two Posets1
A Group Ring Approach to Fuglede’s Conjecture in Cyclic Groups1
Small Subgraphs with Large Average Degree1
Fractionally Balanced Hypergraphs and Rainbow KKM Theorems1
(2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked1
Log-Concavity in Planar Random Walks1
Polynomial Schur’s Theorem1
Maximal 3-Wise Intersecting Families1
Vertex-Minor-Closed Classes are χ-Bounded1
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number1
Sweeps, Polytopes, Oriented Matroids, and Allowable Graphs of Permutations1
Large Independent Sets from Local Considerations1
Universal Planar Graphs for the Topological Minor Relation1
The Strong Nine Dragon Tree Conjecture is True for $$d \le k + 1$$1
Tight Bounds Towards a Conjecture of Gallai1
On Transitive Ovoids of Finite Hermitian Polar Spaces1
Strongly Regular Graphs Satisfying the 4-Vertex Condition1
Lower Bounds on the Chromatic Number of Random Graphs1
A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols1
Tiling Edge-Coloured Graphs with Few Monochromatic Bounded-Degree Graphs1
Weak Saturation of Multipartite Hypergraphs1
On Bounding the Diameter of a Distance-Regular Graph1
On the Classification of Low-Degree Ovoids of Q(4,q)1
The Sandpile Group of a Trinity and a Canonical Definition for the Planar Bernardi Action1
A Characterization of Graphs Whose Small Powers of Their Edge Ideals Have a Linear Free Resolution1
Constructing Tree-Decompositions That Display All Topological Ends1
A Book Proof of the Middle Levels Theorem1
Convergence and Limits of Finite Trees1
A Generalization of the Chevalley–Warning and Ax–Katz Theorems with a View Towards Combinatorial Number Theory1
A Hypergraph Analog of Dirac’s Theorem for Long Cycles in 2-Connected Graphs1
The Number of Tangencies Between Two Families of Curves1
0.022880077362061